oj.uz

Submission #43069

# Submission time Handle Problem Language Result Execution time Memory
43069 2018-03-08T19:34:02 Z ekrem Fireworks (APIO16_fireworks) C++
55 / 100
 2000 ms 251512 KB 
/*
ID: ekrem
LANG: C++
TASK: Fireworks
*/
#include <algorithm>
#include <iostream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map>
#include <set>

using namespace std;
#define foreach(kk,gg) for(__typeof(gg.begin())kk=gg.begin();kk!=gg.end();kk++)
#define dbgs(x) cerr << (#x) << " --> " << (x) << ' '
#define dbg(x) cerr << (#x) << " --> " << (x) << endl
#define FOR(ii,aa,bb) for(int ii=aa;ii<=bb;ii++)
#define ROF(ii,aa,bb) for(int ii=aa;ii>=bb;ii--)
#define SET(a, b) memset(a, b, sizeof a)
#define heap priority_queue
#define orta (bas+son>>1)
#define endll puts("")
#define mp make_pair
#define pb push_back
#define sag (k+k+1)
#define sol (k+k)
#define endl '\n'
#define nd second
#define st first
#define y1 ekrem
#define y2 merke
typedef int don;
#define int long long int
inline int read(){int x;scanf(" %lld",&x);return x;}

typedef pair < int , int > ii;
typedef vector < int > vi;
typedef vector < ii > vii;

const int inf = 1e9 + 7;
const int linf = 1e18 + 7;

const int N = 1e6 + 5;

int n, m, p[N], c[N], a[N], b[N];
heap < int > h[N];

void ekle(int par, int coc){
	a[par] += a[coc];
	b[par] += b[coc];
	while(!h[coc].empty()){
		int t = h[coc].top();h[coc].pop();
		h[par].push(t);
		// if(h[par].top() > t){
		// 	h[par].push(t);
		// 	h[par].pop();
		// }
	}
}

don main(){
	// freopen("input.in", "r", stdin);freopen("input.out", "w", stdout);
	n = read();
	m = read();
	FOR(i, 2, n + m){
		p[i] = read();
		c[i] = read();
	}
	ROF(i, n + m, n + 1){//Yapraklar
		a[i] = 1;
		b[i] = -c[i];
		h[i].push(c[i]);
		h[i].push(c[i]);
		ekle(p[i], i);
	}
	ROF(i, n, 2){
		while(a[i] > 1){
			a[i]--;
			b[i] += h[i].top();h[i].pop();
		}
		int bir = h[i].top();h[i].pop();
		int iki = h[i].top();h[i].pop();
		h[i].push(bir + c[i]);
		h[i].push(iki + c[i]);
		b[i] -= c[i];//Bu ne
		ekle(p[i], i);
	}
	while(a[1] > 0){
		a[1]--;
		b[1] += h[1].top();h[1].pop();
	}
	cout << b[1] << endl;
	return 0;
}

Compilation message

fireworks.cpp: In function 'long long int read()':
fireworks.cpp:45:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 inline int read(){int x;scanf(" %lld",&x);return x;}
                                          ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 31612 KB Output is correct
2 Correct 25 ms 31716 KB Output is correct
3 Correct 26 ms 31828 KB Output is correct
4 Correct 25 ms 31932 KB Output is correct
5 Correct 26 ms 31952 KB Output is correct
6 Correct 25 ms 31992 KB Output is correct
7 Correct 25 ms 32036 KB Output is correct
8 Correct 26 ms 32036 KB Output is correct
9 Correct 26 ms 32036 KB Output is correct
10 Correct 26 ms 32036 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 32120 KB Output is correct
2 Correct 25 ms 32120 KB Output is correct
3 Correct 26 ms 32120 KB Output is correct
4 Correct 25 ms 32120 KB Output is correct
5 Correct 26 ms 32120 KB Output is correct
6 Correct 25 ms 32120 KB Output is correct
7 Correct 25 ms 32120 KB Output is correct
8 Correct 25 ms 32148 KB Output is correct
9 Correct 26 ms 32152 KB Output is correct
10 Correct 25 ms 32152 KB Output is correct
11 Correct 25 ms 32160 KB Output is correct
12 Correct 25 ms 32164 KB Output is correct
13 Correct 26 ms 32168 KB Output is correct
14 Correct 28 ms 32168 KB Output is correct
15 Correct 25 ms 32176 KB Output is correct
16 Correct 28 ms 32180 KB Output is correct
17 Correct 27 ms 32184 KB Output is correct
18 Correct 26 ms 32188 KB Output is correct
19 Correct 26 ms 32192 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 31612 KB Output is correct
2 Correct 25 ms 31716 KB Output is correct
3 Correct 26 ms 31828 KB Output is correct
4 Correct 25 ms 31932 KB Output is correct
5 Correct 26 ms 31952 KB Output is correct
6 Correct 25 ms 31992 KB Output is correct
7 Correct 25 ms 32036 KB Output is correct
8 Correct 26 ms 32036 KB Output is correct
9 Correct 26 ms 32036 KB Output is correct
10 Correct 26 ms 32036 KB Output is correct
11 Correct 26 ms 32120 KB Output is correct
12 Correct 25 ms 32120 KB Output is correct
13 Correct 26 ms 32120 KB Output is correct
14 Correct 25 ms 32120 KB Output is correct
15 Correct 26 ms 32120 KB Output is correct
16 Correct 25 ms 32120 KB Output is correct
17 Correct 25 ms 32120 KB Output is correct
18 Correct 25 ms 32148 KB Output is correct
19 Correct 26 ms 32152 KB Output is correct
20 Correct 25 ms 32152 KB Output is correct
21 Correct 25 ms 32160 KB Output is correct
22 Correct 25 ms 32164 KB Output is correct
23 Correct 26 ms 32168 KB Output is correct
24 Correct 28 ms 32168 KB Output is correct
25 Correct 25 ms 32176 KB Output is correct
26 Correct 28 ms 32180 KB Output is correct
27 Correct 27 ms 32184 KB Output is correct
28 Correct 26 ms 32188 KB Output is correct
29 Correct 26 ms 32192 KB Output is correct
30 Correct 27 ms 32324 KB Output is correct
31 Correct 28 ms 32584 KB Output is correct
32 Correct 27 ms 32616 KB Output is correct
33 Correct 28 ms 32912 KB Output is correct
34 Correct 32 ms 33216 KB Output is correct
35 Correct 36 ms 34028 KB Output is correct
36 Correct 35 ms 34028 KB Output is correct
37 Correct 34 ms 34028 KB Output is correct
38 Correct 47 ms 35360 KB Output is correct
39 Correct 41 ms 35360 KB Output is correct
40 Correct 27 ms 35360 KB Output is correct
41 Correct 28 ms 35360 KB Output is correct
42 Correct 28 ms 35360 KB Output is correct
43 Correct 284 ms 64220 KB Output is correct
44 Correct 224 ms 64220 KB Output is correct
45 Correct 204 ms 64220 KB Output is correct
46 Correct 30 ms 64220 KB Output is correct
47 Correct 29 ms 64220 KB Output is correct
48 Correct 30 ms 64220 KB Output is correct
49 Correct 28 ms 64220 KB Output is correct
50 Correct 28 ms 64220 KB Output is correct
51 Correct 28 ms 64220 KB Output is correct
52 Correct 35 ms 64220 KB Output is correct
53 Correct 32 ms 64220 KB Output is correct
54 Correct 29 ms 64220 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 31612 KB Output is correct
2 Correct 25 ms 31716 KB Output is correct
3 Correct 26 ms 31828 KB Output is correct
4 Correct 25 ms 31932 KB Output is correct
5 Correct 26 ms 31952 KB Output is correct
6 Correct 25 ms 31992 KB Output is correct
7 Correct 25 ms 32036 KB Output is correct
8 Correct 26 ms 32036 KB Output is correct
9 Correct 26 ms 32036 KB Output is correct
10 Correct 26 ms 32036 KB Output is correct
11 Correct 26 ms 32120 KB Output is correct
12 Correct 25 ms 32120 KB Output is correct
13 Correct 26 ms 32120 KB Output is correct
14 Correct 25 ms 32120 KB Output is correct
15 Correct 26 ms 32120 KB Output is correct
16 Correct 25 ms 32120 KB Output is correct
17 Correct 25 ms 32120 KB Output is correct
18 Correct 25 ms 32148 KB Output is correct
19 Correct 26 ms 32152 KB Output is correct
20 Correct 25 ms 32152 KB Output is correct
21 Correct 25 ms 32160 KB Output is correct
22 Correct 25 ms 32164 KB Output is correct
23 Correct 26 ms 32168 KB Output is correct
24 Correct 28 ms 32168 KB Output is correct
25 Correct 25 ms 32176 KB Output is correct
26 Correct 28 ms 32180 KB Output is correct
27 Correct 27 ms 32184 KB Output is correct
28 Correct 26 ms 32188 KB Output is correct
29 Correct 26 ms 32192 KB Output is correct
30 Correct 27 ms 32324 KB Output is correct
31 Correct 28 ms 32584 KB Output is correct
32 Correct 27 ms 32616 KB Output is correct
33 Correct 28 ms 32912 KB Output is correct
34 Correct 32 ms 33216 KB Output is correct
35 Correct 36 ms 34028 KB Output is correct
36 Correct 35 ms 34028 KB Output is correct
37 Correct 34 ms 34028 KB Output is correct
38 Correct 47 ms 35360 KB Output is correct
39 Correct 41 ms 35360 KB Output is correct
40 Correct 27 ms 35360 KB Output is correct
41 Correct 28 ms 35360 KB Output is correct
42 Correct 28 ms 35360 KB Output is correct
43 Correct 284 ms 64220 KB Output is correct
44 Correct 224 ms 64220 KB Output is correct
45 Correct 204 ms 64220 KB Output is correct
46 Correct 30 ms 64220 KB Output is correct
47 Correct 29 ms 64220 KB Output is correct
48 Correct 30 ms 64220 KB Output is correct
49 Correct 28 ms 64220 KB Output is correct
50 Correct 28 ms 64220 KB Output is correct
51 Correct 28 ms 64220 KB Output is correct
52 Correct 35 ms 64220 KB Output is correct
53 Correct 32 ms 64220 KB Output is correct
54 Correct 29 ms 64220 KB Output is correct
55 Correct 79 ms 64220 KB Output is correct
56 Correct 513 ms 88268 KB Output is correct
57 Correct 1063 ms 141744 KB Output is correct
58 Correct 1221 ms 165944 KB Output is correct
59 Execution timed out 2061 ms 251512 KB Time limit exceeded
60 Halted 0 ms 0 KB -