oj.uz

Submission #43071

# Submission time Handle Problem Language Result Execution time Memory
43071 2018-03-08T19:38:03 Z ekrem Fireworks (APIO16_fireworks) C++
55 / 100
 2000 ms 524288 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];
	heap < int > x;
	if(h[par].size() > h[coc].size()){
		x = h[par];
		while(!h[coc].empty()){
			int t = h[coc].top();h[coc].pop();
			x.push(t);
		}
	} else{
		x = h[coc];
		while(!h[par].empty()){
			int t = h[par].top();h[par].pop();
			x.push(t);
		}
	}
	h[par] = x;
}

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 28 ms 31608 KB Output is correct
2 Correct 29 ms 31712 KB Output is correct
3 Correct 28 ms 31784 KB Output is correct
4 Correct 28 ms 31784 KB Output is correct
5 Correct 29 ms 31784 KB Output is correct
6 Correct 29 ms 31784 KB Output is correct
7 Correct 29 ms 31820 KB Output is correct
8 Correct 28 ms 31820 KB Output is correct
9 Correct 29 ms 31836 KB Output is correct
10 Correct 29 ms 31836 KB Output is correct

Subtask #2
19.0 / 19.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31608 KB Output is correct
2 Correct 29 ms 31712 KB Output is correct
3 Correct 28 ms 31784 KB Output is correct
4 Correct 28 ms 31784 KB Output is correct
5 Correct 29 ms 31784 KB Output is correct
6 Correct 29 ms 31784 KB Output is correct
7 Correct 29 ms 31820 KB Output is correct
8 Correct 28 ms 31820 KB Output is correct
9 Correct 29 ms 31836 KB Output is correct
10 Correct 29 ms 31836 KB Output is correct
11 Correct 32 ms 31836 KB Output is correct
12 Correct 29 ms 31836 KB Output is correct
13 Correct 28 ms 31892 KB Output is correct
14 Correct 28 ms 31892 KB Output is correct
15 Correct 28 ms 31892 KB Output is correct
16 Correct 29 ms 31892 KB Output is correct
17 Correct 29 ms 31892 KB Output is correct
18 Correct 29 ms 31892 KB Output is correct
19 Correct 28 ms 31892 KB Output is correct
20 Correct 29 ms 31980 KB Output is correct
21 Correct 28 ms 32104 KB Output is correct
22 Correct 28 ms 32104 KB Output is correct
23 Correct 28 ms 32104 KB Output is correct
24 Correct 29 ms 32104 KB Output is correct
25 Correct 28 ms 32104 KB Output is correct
26 Correct 28 ms 32104 KB Output is correct
27 Correct 29 ms 32104 KB Output is correct
28 Correct 29 ms 32104 KB Output is correct
29 Correct 28 ms 32104 KB Output is correct
30 Correct 28 ms 32104 KB Output is correct
31 Correct 34 ms 32108 KB Output is correct
32 Correct 30 ms 32236 KB Output is correct
33 Correct 31 ms 32364 KB Output is correct
34 Correct 31 ms 32620 KB Output is correct
35 Correct 32 ms 33260 KB Output is correct
36 Correct 33 ms 33260 KB Output is correct
37 Correct 32 ms 33260 KB Output is correct
38 Correct 34 ms 34668 KB Output is correct
39 Correct 34 ms 34668 KB Output is correct
40 Correct 32 ms 34668 KB Output is correct
41 Correct 29 ms 34668 KB Output is correct
42 Correct 30 ms 34668 KB Output is correct
43 Correct 63 ms 59756 KB Output is correct
44 Correct 50 ms 59756 KB Output is correct
45 Correct 49 ms 59756 KB Output is correct
46 Correct 40 ms 59756 KB Output is correct
47 Correct 37 ms 59756 KB Output is correct
48 Correct 38 ms 59756 KB Output is correct
49 Correct 37 ms 59756 KB Output is correct
50 Correct 49 ms 59756 KB Output is correct
51 Correct 47 ms 59756 KB Output is correct
52 Correct 47 ms 59756 KB Output is correct
53 Correct 41 ms 59756 KB Output is correct
54 Correct 130 ms 59756 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31608 KB Output is correct
2 Correct 29 ms 31712 KB Output is correct
3 Correct 28 ms 31784 KB Output is correct
4 Correct 28 ms 31784 KB Output is correct
5 Correct 29 ms 31784 KB Output is correct
6 Correct 29 ms 31784 KB Output is correct
7 Correct 29 ms 31820 KB Output is correct
8 Correct 28 ms 31820 KB Output is correct
9 Correct 29 ms 31836 KB Output is correct
10 Correct 29 ms 31836 KB Output is correct
11 Correct 32 ms 31836 KB Output is correct
12 Correct 29 ms 31836 KB Output is correct
13 Correct 28 ms 31892 KB Output is correct
14 Correct 28 ms 31892 KB Output is correct
15 Correct 28 ms 31892 KB Output is correct
16 Correct 29 ms 31892 KB Output is correct
17 Correct 29 ms 31892 KB Output is correct
18 Correct 29 ms 31892 KB Output is correct
19 Correct 28 ms 31892 KB Output is correct
20 Correct 29 ms 31980 KB Output is correct
21 Correct 28 ms 32104 KB Output is correct
22 Correct 28 ms 32104 KB Output is correct
23 Correct 28 ms 32104 KB Output is correct
24 Correct 29 ms 32104 KB Output is correct
25 Correct 28 ms 32104 KB Output is correct
26 Correct 28 ms 32104 KB Output is correct
27 Correct 29 ms 32104 KB Output is correct
28 Correct 29 ms 32104 KB Output is correct
29 Correct 28 ms 32104 KB Output is correct
30 Correct 28 ms 32104 KB Output is correct
31 Correct 34 ms 32108 KB Output is correct
32 Correct 30 ms 32236 KB Output is correct
33 Correct 31 ms 32364 KB Output is correct
34 Correct 31 ms 32620 KB Output is correct
35 Correct 32 ms 33260 KB Output is correct
36 Correct 33 ms 33260 KB Output is correct
37 Correct 32 ms 33260 KB Output is correct
38 Correct 34 ms 34668 KB Output is correct
39 Correct 34 ms 34668 KB Output is correct
40 Correct 32 ms 34668 KB Output is correct
41 Correct 29 ms 34668 KB Output is correct
42 Correct 30 ms 34668 KB Output is correct
43 Correct 63 ms 59756 KB Output is correct
44 Correct 50 ms 59756 KB Output is correct
45 Correct 49 ms 59756 KB Output is correct
46 Correct 40 ms 59756 KB Output is correct
47 Correct 37 ms 59756 KB Output is correct
48 Correct 38 ms 59756 KB Output is correct
49 Correct 37 ms 59756 KB Output is correct
50 Correct 49 ms 59756 KB Output is correct
51 Correct 47 ms 59756 KB Output is correct
52 Correct 47 ms 59756 KB Output is correct
53 Correct 41 ms 59756 KB Output is correct
54 Correct 130 ms 59756 KB Output is correct
55 Correct 43 ms 59756 KB Output is correct
56 Correct 110 ms 86508 KB Output is correct
57 Correct 180 ms 141972 KB Output is correct
58 Correct 213 ms 158700 KB Output is correct
59 Correct 381 ms 326308 KB Output is correct
60 Correct 403 ms 326308 KB Output is correct
61 Correct 503 ms 411176 KB Output is correct
62 Correct 524 ms 432924 KB Output is correct
63 Correct 580 ms 433368 KB Output is correct
64 Execution timed out 2103 ms 524288 KB Time limit exceeded
65 Halted 0 ms 0 KB -