oj.uz

Submission #244917

# Submission time Handle Problem Language Result Execution time Memory
244917 2020-07-05T09:23:59 Z Red_Inside Fireworks (APIO16_fireworks) C++17
100 / 100
 230 ms 50332 KB 
/*
 * Author: Seokhwan Choi
 * Time Complexity: O((N+M) (log (N+M))^2 )
 */

#include<stdio.h>
#include<queue>
#define MAXN 300100
int n,m;
int p[MAXN];
int c[MAXN];
struct ndata{//contains data for subtree (y=f(x), where y is minimum cost when distance to all leaf node is x
	long long int a,b;//y=ax+b at large x
	std::priority_queue<long long int> *pq;//saves slope changing points, slope change by 1 at each element
	ndata operator+(ndata r){//merge two data by adding them
		ndata s;//result(merged data)
		s.a=a+r.a;
		s.b=b+r.b;
		if(pq->size()>r.pq->size()){//merge smaller priority queue to larger priority queue
			s.pq=pq;
			while(r.pq->size()!=0){
				s.pq->push(r.pq->top());
				r.pq->pop();
			}
		}
		else{
			s.pq=r.pq;
			while(pq->size()!=0){
				s.pq->push(pq->top());
				pq->pop();
			}
		}
		return s;
	}
};
ndata d[MAXN];
int main(){
	int i;
	scanf("%d%d",&n,&m);
	for(i=2;i<=n+m;i++){
		scanf("%d%d",&p[i],&c[i]);
	}
	for(i=n+m;i>0;i--){//initiallize
		d[i].a=0;
		d[i].b=0;
		d[i].pq=new std::priority_queue<long long>;
	}
	for(i=n+m;i>n;i--){//leaf nodes
		d[i].a=1;
		d[i].b=-c[i];
		d[i].pq->push(c[i]);//slope is -1 if x<c[i], 1 if x>c[i]
		d[i].pq->push(c[i]);//slope changes by 2
		d[p[i]]=d[p[i]]+d[i];//add the data to parent node
	}
	for(i=n;i>1;i--){
		//add edge to parent node
		while(d[i].a>1){//slope over 1 is useless because we can increase only one edge(edge toward parent node)
			d[i].a--;//slope decrease by 1
			d[i].b+=d[i].pq->top();//y=ax+b=(a-1)x+(b+x) at slope changing point
			d[i].pq->pop();
		}
		long long int ta=d[i].pq->top();//increase length of slope -1 part by c[i]
		d[i].pq->pop();
		long long int tb=d[i].pq->top();
		d[i].pq->pop();
		d[i].pq->push(tb+c[i]);//move location of slope 0, 1 part by c[i]
		d[i].pq->push(ta+c[i]);
		d[i].b-=c[i];//y is decreased by c[i] at sufficiently large x (slope 1 part)
		d[p[i]]=d[p[i]]+d[i];//add the data to parent node
	}
	while(d[1].a>0){//root node, y at slope 0 is the answer because it is minimum y
		d[1].a--;
		d[1].b+=d[1].pq->top();
		d[1].pq->pop();
	}
	printf("%lld\n",d[1].b);
	return 0;
}

Compilation message

fireworks.cpp: In function 'int main()':
fireworks.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
fireworks.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&p[i],&c[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 6 ms 768 KB Output is correct
35 Correct 6 ms 768 KB Output is correct
36 Correct 7 ms 896 KB Output is correct
37 Correct 7 ms 896 KB Output is correct
38 Correct 8 ms 896 KB Output is correct
39 Correct 8 ms 1024 KB Output is correct
40 Correct 6 ms 768 KB Output is correct
41 Correct 6 ms 768 KB Output is correct
42 Correct 7 ms 768 KB Output is correct
43 Correct 8 ms 896 KB Output is correct
44 Correct 7 ms 896 KB Output is correct
45 Correct 7 ms 896 KB Output is correct
46 Correct 8 ms 1152 KB Output is correct
47 Correct 8 ms 1152 KB Output is correct
48 Correct 7 ms 1024 KB Output is correct
49 Correct 8 ms 1152 KB Output is correct
50 Correct 7 ms 896 KB Output is correct
51 Correct 7 ms 896 KB Output is correct
52 Correct 7 ms 1024 KB Output is correct
53 Correct 8 ms 1024 KB Output is correct
54 Correct 7 ms 1024 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 6 ms 768 KB Output is correct
35 Correct 6 ms 768 KB Output is correct
36 Correct 7 ms 896 KB Output is correct
37 Correct 7 ms 896 KB Output is correct
38 Correct 8 ms 896 KB Output is correct
39 Correct 8 ms 1024 KB Output is correct
40 Correct 6 ms 768 KB Output is correct
41 Correct 6 ms 768 KB Output is correct
42 Correct 7 ms 768 KB Output is correct
43 Correct 8 ms 896 KB Output is correct
44 Correct 7 ms 896 KB Output is correct
45 Correct 7 ms 896 KB Output is correct
46 Correct 8 ms 1152 KB Output is correct
47 Correct 8 ms 1152 KB Output is correct
48 Correct 7 ms 1024 KB Output is correct
49 Correct 8 ms 1152 KB Output is correct
50 Correct 7 ms 896 KB Output is correct
51 Correct 7 ms 896 KB Output is correct
52 Correct 7 ms 1024 KB Output is correct
53 Correct 8 ms 1024 KB Output is correct
54 Correct 7 ms 1024 KB Output is correct
55 Correct 13 ms 2048 KB Output is correct
56 Correct 34 ms 6776 KB Output is correct
57 Correct 60 ms 11256 KB Output is correct
58 Correct 77 ms 14452 KB Output is correct
59 Correct 102 ms 19060 KB Output is correct
60 Correct 131 ms 23540 KB Output is correct
61 Correct 145 ms 27120 KB Output is correct
62 Correct 174 ms 29676 KB Output is correct
63 Correct 201 ms 34556 KB Output is correct
64 Correct 209 ms 35948 KB Output is correct
65 Correct 115 ms 27376 KB Output is correct
66 Correct 114 ms 27368 KB Output is correct
67 Correct 112 ms 27384 KB Output is correct
68 Correct 177 ms 34264 KB Output is correct
69 Correct 192 ms 34796 KB Output is correct
70 Correct 190 ms 34800 KB Output is correct
71 Correct 230 ms 50308 KB Output is correct
72 Correct 224 ms 50332 KB Output is correct
73 Correct 196 ms 46856 KB Output is correct
74 Correct 196 ms 47516 KB Output is correct
75 Correct 198 ms 45924 KB Output is correct
76 Correct 200 ms 45924 KB Output is correct
77 Correct 212 ms 44772 KB Output is correct
78 Correct 204 ms 44520 KB Output is correct
79 Correct 190 ms 43824 KB Output is correct