답안 #442714

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442714	2021-07-08T17:55:25 Z	FlowerOfSorrow	Fireworks (APIO16_fireworks)	C++17	55 / 100	2000 ms	83660 KB

fireworks

#include <bits/stdc++.h>
using namespace std;

template<class F>
struct y_combinator_result{
	F f;
	template<class T> explicit y_combinator_result(T &&f): f(forward<T>(f)){ }
	template<class ...Args> decltype(auto) operator()(Args &&...args){ return f(ref(*this), forward<Args>(args)...); }
};
template<class F>
decltype(auto) y_combinator(F &&f){
	return y_combinator_result<decay_t<F>>(forward<F>(f));
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(ios::badbit | ios::failbit);
	int n, m;
	cin >> n >> m;
	vector<vector<int>> adj(n + m);
	vector<int> par_w(n + m);
	for(auto u = 1; u < n + m; ++ u){
		int p;
		cin >> p >> par_w[u], -- p;
		adj[p].push_back(u);
	}
	auto res = y_combinator([&](auto self, int u)->pair<pair<int, long long>, priority_queue<long long>>{
		pair<int, long long> line{};
		priority_queue<long long> pq;
		if(u >= n){
			line = {1, -par_w[u]};
			pq = priority_queue<long long>{{}, vector<long long>(2, par_w[u])};
		}
		else{
			for(auto v: adj[u]){
				auto res_v = self(v);
				auto &[line_v, pq_v] = res_v;
				line.first += line_v.first, line.second += line_v.second;
				if((int)pq.size() < (int)pq_v.size()){
					swap(pq, pq_v);
				}
				while(!pq_v.empty()){
					pq.push(pq_v.top());
					pq_v.pop();
				}
			}
			while(line.first > 1){
				-- line.first;
				line.second += pq.top();
				pq.pop();
			}
			array<long long, 2> store{};
			for(auto rep = 0; rep < 2; ++ rep){
				store[rep] = pq.top() + par_w[u];
				pq.pop();
			}
			for(auto x: store){
				pq.push(x);
			}
			line.second -= par_w[u];
		}
		return {line, pq};
	})(0);
	cout << 1LL * res.first.first * res.second.top() + res.first.second << "\n";
	return 0;
}

/*

*/

////////////////////////////////////////////////////////////////////////////////////////
//                                                                                    //
//                                   Coded by Aeren                                   //
//                                                                                    //
////////////////////////////////////////////////////////////////////////////////////////

Subtask #1
7.0 / 7.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	2 ms	460 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	3 ms	588 KB	Output is correct
36	Correct	3 ms	588 KB	Output is correct
37	Correct	3 ms	588 KB	Output is correct
38	Correct	3 ms	588 KB	Output is correct
39	Correct	3 ms	588 KB	Output is correct
40	Correct	3 ms	1612 KB	Output is correct
41	Correct	3 ms	1612 KB	Output is correct
42	Correct	2 ms	588 KB	Output is correct
43	Correct	6 ms	1228 KB	Output is correct
44	Correct	5 ms	992 KB	Output is correct
45	Correct	5 ms	972 KB	Output is correct
46	Correct	3 ms	588 KB	Output is correct
47	Correct	3 ms	588 KB	Output is correct
48	Correct	3 ms	460 KB	Output is correct
49	Correct	3 ms	588 KB	Output is correct
50	Correct	2 ms	460 KB	Output is correct
51	Correct	2 ms	460 KB	Output is correct
52	Correct	3 ms	588 KB	Output is correct
53	Correct	3 ms	584 KB	Output is correct
54	Correct	4 ms	588 KB	Output is correct

Subtask #4
0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	2 ms	460 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	3 ms	588 KB	Output is correct
36	Correct	3 ms	588 KB	Output is correct
37	Correct	3 ms	588 KB	Output is correct
38	Correct	3 ms	588 KB	Output is correct
39	Correct	3 ms	588 KB	Output is correct
40	Correct	3 ms	1612 KB	Output is correct
41	Correct	3 ms	1612 KB	Output is correct
42	Correct	2 ms	588 KB	Output is correct
43	Correct	6 ms	1228 KB	Output is correct
44	Correct	5 ms	992 KB	Output is correct
45	Correct	5 ms	972 KB	Output is correct
46	Correct	3 ms	588 KB	Output is correct
47	Correct	3 ms	588 KB	Output is correct
48	Correct	3 ms	460 KB	Output is correct
49	Correct	3 ms	588 KB	Output is correct
50	Correct	2 ms	460 KB	Output is correct
51	Correct	2 ms	460 KB	Output is correct
52	Correct	3 ms	588 KB	Output is correct
53	Correct	3 ms	584 KB	Output is correct
54	Correct	4 ms	588 KB	Output is correct
55	Correct	8 ms	1180 KB	Output is correct
56	Correct	35 ms	3452 KB	Output is correct
57	Correct	66 ms	5712 KB	Output is correct
58	Correct	85 ms	7300 KB	Output is correct
59	Correct	128 ms	9548 KB	Output is correct
60	Correct	157 ms	11616 KB	Output is correct
61	Correct	202 ms	13044 KB	Output is correct
62	Correct	217 ms	14672 KB	Output is correct
63	Correct	232 ms	16264 KB	Output is correct
64	Correct	313 ms	18040 KB	Output is correct
65	Correct	155 ms	83552 KB	Output is correct
66	Correct	149 ms	83660 KB	Output is correct
67	Correct	130 ms	18020 KB	Output is correct
68	Execution timed out	2096 ms	48096 KB	Time limit exceeded
69	Halted	0 ms	0 KB	-

답안 #442714

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