답안 #43074 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
43074	2018-03-08T19:58:17 Z	ekrem	Fireworks (APIO16_fireworks)	C++	55 / 100	2000 ms	524288 KB

fireworks

/*
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 = 3e5 + 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];
	if(h[coc].size() > h[par].size())
		swap(h[par], h[coc]);
	while(!h[coc].empty()){
		h[par].push(h[coc].top());h[coc].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

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	9716 KB	Output is correct
2	Correct	8 ms	9824 KB	Output is correct
3	Correct	8 ms	9824 KB	Output is correct
4	Correct	8 ms	9824 KB	Output is correct
5	Correct	8 ms	9824 KB	Output is correct
6	Correct	8 ms	9872 KB	Output is correct
7	Correct	8 ms	10024 KB	Output is correct
8	Correct	8 ms	10024 KB	Output is correct
9	Correct	8 ms	10024 KB	Output is correct
10	Correct	8 ms	10024 KB	Output is correct

Subtask #2
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	10024 KB	Output is correct
2	Correct	8 ms	10024 KB	Output is correct
3	Correct	8 ms	10024 KB	Output is correct
4	Correct	8 ms	10024 KB	Output is correct
5	Correct	8 ms	10024 KB	Output is correct
6	Correct	8 ms	10024 KB	Output is correct
7	Correct	8 ms	10024 KB	Output is correct
8	Correct	10 ms	10024 KB	Output is correct
9	Correct	8 ms	10024 KB	Output is correct
10	Correct	8 ms	10024 KB	Output is correct
11	Correct	8 ms	10024 KB	Output is correct
12	Correct	8 ms	10024 KB	Output is correct
13	Correct	8 ms	10024 KB	Output is correct
14	Correct	9 ms	10024 KB	Output is correct
15	Correct	8 ms	10024 KB	Output is correct
16	Correct	9 ms	10024 KB	Output is correct
17	Correct	8 ms	10024 KB	Output is correct
18	Correct	8 ms	10024 KB	Output is correct
19	Correct	8 ms	10024 KB	Output is correct

Subtask #3
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	9716 KB	Output is correct
2	Correct	8 ms	9824 KB	Output is correct
3	Correct	8 ms	9824 KB	Output is correct
4	Correct	8 ms	9824 KB	Output is correct
5	Correct	8 ms	9824 KB	Output is correct
6	Correct	8 ms	9872 KB	Output is correct
7	Correct	8 ms	10024 KB	Output is correct
8	Correct	8 ms	10024 KB	Output is correct
9	Correct	8 ms	10024 KB	Output is correct
10	Correct	8 ms	10024 KB	Output is correct
11	Correct	8 ms	10024 KB	Output is correct
12	Correct	8 ms	10024 KB	Output is correct
13	Correct	8 ms	10024 KB	Output is correct
14	Correct	8 ms	10024 KB	Output is correct
15	Correct	8 ms	10024 KB	Output is correct
16	Correct	8 ms	10024 KB	Output is correct
17	Correct	8 ms	10024 KB	Output is correct
18	Correct	10 ms	10024 KB	Output is correct
19	Correct	8 ms	10024 KB	Output is correct
20	Correct	8 ms	10024 KB	Output is correct
21	Correct	8 ms	10024 KB	Output is correct
22	Correct	8 ms	10024 KB	Output is correct
23	Correct	8 ms	10024 KB	Output is correct
24	Correct	9 ms	10024 KB	Output is correct
25	Correct	8 ms	10024 KB	Output is correct
26	Correct	9 ms	10024 KB	Output is correct
27	Correct	8 ms	10024 KB	Output is correct
28	Correct	8 ms	10024 KB	Output is correct
29	Correct	8 ms	10024 KB	Output is correct
30	Correct	8 ms	10092 KB	Output is correct
31	Correct	9 ms	10352 KB	Output is correct
32	Correct	10 ms	10352 KB	Output is correct
33	Correct	11 ms	10604 KB	Output is correct
34	Correct	11 ms	10812 KB	Output is correct
35	Correct	13 ms	11756 KB	Output is correct
36	Correct	12 ms	11756 KB	Output is correct
37	Correct	12 ms	11756 KB	Output is correct
38	Correct	14 ms	13548 KB	Output is correct
39	Correct	13 ms	13548 KB	Output is correct
40	Correct	10 ms	13548 KB	Output is correct
41	Correct	12 ms	13548 KB	Output is correct
42	Correct	10 ms	13548 KB	Output is correct
43	Correct	47 ms	56080 KB	Output is correct
44	Correct	39 ms	56080 KB	Output is correct
45	Correct	40 ms	56080 KB	Output is correct
46	Correct	13 ms	56080 KB	Output is correct
47	Correct	12 ms	56080 KB	Output is correct
48	Correct	18 ms	56080 KB	Output is correct
49	Correct	12 ms	56080 KB	Output is correct
50	Correct	11 ms	56080 KB	Output is correct
51	Correct	11 ms	56080 KB	Output is correct
52	Correct	12 ms	56080 KB	Output is correct
53	Correct	17 ms	56080 KB	Output is correct
54	Correct	12 ms	56080 KB	Output is correct

Subtask #4
0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	9716 KB	Output is correct
2	Correct	8 ms	9824 KB	Output is correct
3	Correct	8 ms	9824 KB	Output is correct
4	Correct	8 ms	9824 KB	Output is correct
5	Correct	8 ms	9824 KB	Output is correct
6	Correct	8 ms	9872 KB	Output is correct
7	Correct	8 ms	10024 KB	Output is correct
8	Correct	8 ms	10024 KB	Output is correct
9	Correct	8 ms	10024 KB	Output is correct
10	Correct	8 ms	10024 KB	Output is correct
11	Correct	8 ms	10024 KB	Output is correct
12	Correct	8 ms	10024 KB	Output is correct
13	Correct	8 ms	10024 KB	Output is correct
14	Correct	8 ms	10024 KB	Output is correct
15	Correct	8 ms	10024 KB	Output is correct
16	Correct	8 ms	10024 KB	Output is correct
17	Correct	8 ms	10024 KB	Output is correct
18	Correct	10 ms	10024 KB	Output is correct
19	Correct	8 ms	10024 KB	Output is correct
20	Correct	8 ms	10024 KB	Output is correct
21	Correct	8 ms	10024 KB	Output is correct
22	Correct	8 ms	10024 KB	Output is correct
23	Correct	8 ms	10024 KB	Output is correct
24	Correct	9 ms	10024 KB	Output is correct
25	Correct	8 ms	10024 KB	Output is correct
26	Correct	9 ms	10024 KB	Output is correct
27	Correct	8 ms	10024 KB	Output is correct
28	Correct	8 ms	10024 KB	Output is correct
29	Correct	8 ms	10024 KB	Output is correct
30	Correct	8 ms	10092 KB	Output is correct
31	Correct	9 ms	10352 KB	Output is correct
32	Correct	10 ms	10352 KB	Output is correct
33	Correct	11 ms	10604 KB	Output is correct
34	Correct	11 ms	10812 KB	Output is correct
35	Correct	13 ms	11756 KB	Output is correct
36	Correct	12 ms	11756 KB	Output is correct
37	Correct	12 ms	11756 KB	Output is correct
38	Correct	14 ms	13548 KB	Output is correct
39	Correct	13 ms	13548 KB	Output is correct
40	Correct	10 ms	13548 KB	Output is correct
41	Correct	12 ms	13548 KB	Output is correct
42	Correct	10 ms	13548 KB	Output is correct
43	Correct	47 ms	56080 KB	Output is correct
44	Correct	39 ms	56080 KB	Output is correct
45	Correct	40 ms	56080 KB	Output is correct
46	Correct	13 ms	56080 KB	Output is correct
47	Correct	12 ms	56080 KB	Output is correct
48	Correct	18 ms	56080 KB	Output is correct
49	Correct	12 ms	56080 KB	Output is correct
50	Correct	11 ms	56080 KB	Output is correct
51	Correct	11 ms	56080 KB	Output is correct
52	Correct	12 ms	56080 KB	Output is correct
53	Correct	17 ms	56080 KB	Output is correct
54	Correct	12 ms	56080 KB	Output is correct
55	Correct	23 ms	56080 KB	Output is correct
56	Correct	83 ms	63812 KB	Output is correct
57	Correct	149 ms	118152 KB	Output is correct
58	Correct	183 ms	141136 KB	Output is correct
59	Correct	328 ms	289068 KB	Output is correct
60	Correct	371 ms	295736 KB	Output is correct
61	Execution timed out	2086 ms	524288 KB	Time limit exceeded
62	Halted	0 ms	0 KB	-

답안 #43074

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 19.0 / 19.0

Subtask #3 29.0 / 29.0

Subtask #4 0 / 45.0

Subtask #1
7.0 / 7.0

Subtask #2
19.0 / 19.0

Subtask #3
29.0 / 29.0

Subtask #4
0 / 45.0