oj.uz

Submission #419298

# Submission time Handle Problem Language Result Execution time Memory
419298 2021-06-06T19:25:54 Z Return_0 Fireworks (APIO16_fireworks) C++17
100 / 100
 188 ms 34548 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 3e5 + 7;

struct slope_data {
	ll a, b;
	priority_queue <ll> pq;

	slope_data () : a(0), b(0) {}

	slope_data operator + (slope_data &x) {
		slope_data ret;
		ret.a = a + x.a;
		ret.b = b + x.b;
		if (SZ(pq) > SZ(x.pq)) pq.swap(x.pq);
		ret.pq.swap(x.pq);
		for (; !pq.empty(); pq.pop()) ret.pq.push(pq.top());
		return ret;
	}

	void operator += (slope_data &x) { *this = *this + x; }
} slp [N];

ll p [N], c [N], n, m;

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> m;
	for (ll i = 2; i <= n + m; i++) cin>> p[i] >> c[i];

	for (ll v = n + m; v > n; v--) {
		slp[v].a = 1;
		slp[v].b = -c[v];
		slp[v].pq.push(c[v]); slp[v].pq.push(c[v]);
		slp[p[v]] += slp[v];
	}

	for (ll v = n; v > 1; v--) {
		auto &pq = slp[v].pq;
		for (; slp[v].a > 1; pq.pop(), slp[v].a--) slp[v].b += pq.top();
		ll x = pq.top(); pq.pop();
		ll y = pq.top(); pq.pop();
		pq.push(y + c[v]); pq.push(x + c[v]);
		slp[v].b -= c[v];
		slp[p[v]] += slp[v];
	}

	for (; slp[1].a; slp[1].a--, slp[1].pq.pop()) slp[1].b += slp[1].pq.top();

	kill(slp[1].b);

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
4 6
1 5
2 5
2 8
3 3
3 2
3 3
2 9
4 4
4 3

*/

Subtask #1
7.0 / 7.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14384 KB Output is correct
2 Correct 9 ms 14360 KB Output is correct
3 Correct 9 ms 14328 KB Output is correct
4 Correct 10 ms 14312 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 9 ms 14408 KB Output is correct
7 Correct 10 ms 14416 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 9 ms 14412 KB Output is correct
10 Correct 9 ms 14412 KB Output is correct
11 Correct 9 ms 14412 KB Output is correct
12 Correct 11 ms 14412 KB Output is correct
13 Correct 9 ms 14376 KB Output is correct
14 Correct 9 ms 14412 KB Output is correct
15 Correct 9 ms 14412 KB Output is correct
16 Correct 10 ms 14412 KB Output is correct
17 Correct 10 ms 14424 KB Output is correct
18 Correct 10 ms 14392 KB Output is correct
19 Correct 9 ms 14408 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14412 KB Output is correct
2 Correct 9 ms 14412 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 9 ms 14404 KB Output is correct
5 Correct 11 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 11 ms 14412 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 9 ms 14412 KB Output is correct
10 Correct 9 ms 14412 KB Output is correct
11 Correct 9 ms 14384 KB Output is correct
12 Correct 9 ms 14360 KB Output is correct
13 Correct 9 ms 14328 KB Output is correct
14 Correct 10 ms 14312 KB Output is correct
15 Correct 9 ms 14412 KB Output is correct
16 Correct 9 ms 14408 KB Output is correct
17 Correct 10 ms 14416 KB Output is correct
18 Correct 10 ms 14412 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 9 ms 14412 KB Output is correct
21 Correct 9 ms 14412 KB Output is correct
22 Correct 11 ms 14412 KB Output is correct
23 Correct 9 ms 14376 KB Output is correct
24 Correct 9 ms 14412 KB Output is correct
25 Correct 9 ms 14412 KB Output is correct
26 Correct 10 ms 14412 KB Output is correct
27 Correct 10 ms 14424 KB Output is correct
28 Correct 10 ms 14392 KB Output is correct
29 Correct 9 ms 14408 KB Output is correct
30 Correct 10 ms 14412 KB Output is correct
31 Correct 10 ms 14388 KB Output is correct
32 Correct 10 ms 14412 KB Output is correct
33 Correct 11 ms 14552 KB Output is correct
34 Correct 11 ms 14540 KB Output is correct
35 Correct 12 ms 14540 KB Output is correct
36 Correct 11 ms 14668 KB Output is correct
37 Correct 12 ms 14620 KB Output is correct
38 Correct 12 ms 14668 KB Output is correct
39 Correct 12 ms 14688 KB Output is correct
40 Correct 11 ms 14492 KB Output is correct
41 Correct 11 ms 14552 KB Output is correct
42 Correct 11 ms 14556 KB Output is correct
43 Correct 12 ms 14668 KB Output is correct
44 Correct 12 ms 14676 KB Output is correct
45 Correct 12 ms 14680 KB Output is correct
46 Correct 12 ms 14796 KB Output is correct
47 Correct 12 ms 14780 KB Output is correct
48 Correct 12 ms 14680 KB Output is correct
49 Correct 12 ms 14640 KB Output is correct
50 Correct 12 ms 14540 KB Output is correct
51 Correct 12 ms 14552 KB Output is correct
52 Correct 12 ms 14660 KB Output is correct
53 Correct 12 ms 14668 KB Output is correct
54 Correct 12 ms 14668 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14412 KB Output is correct
2 Correct 9 ms 14412 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 9 ms 14404 KB Output is correct
5 Correct 11 ms 14412 KB Output is correct
6 Correct 9 ms 14412 KB Output is correct
7 Correct 11 ms 14412 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 9 ms 14412 KB Output is correct
10 Correct 9 ms 14412 KB Output is correct
11 Correct 9 ms 14384 KB Output is correct
12 Correct 9 ms 14360 KB Output is correct
13 Correct 9 ms 14328 KB Output is correct
14 Correct 10 ms 14312 KB Output is correct
15 Correct 9 ms 14412 KB Output is correct
16 Correct 9 ms 14408 KB Output is correct
17 Correct 10 ms 14416 KB Output is correct
18 Correct 10 ms 14412 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 9 ms 14412 KB Output is correct
21 Correct 9 ms 14412 KB Output is correct
22 Correct 11 ms 14412 KB Output is correct
23 Correct 9 ms 14376 KB Output is correct
24 Correct 9 ms 14412 KB Output is correct
25 Correct 9 ms 14412 KB Output is correct
26 Correct 10 ms 14412 KB Output is correct
27 Correct 10 ms 14424 KB Output is correct
28 Correct 10 ms 14392 KB Output is correct
29 Correct 9 ms 14408 KB Output is correct
30 Correct 10 ms 14412 KB Output is correct
31 Correct 10 ms 14388 KB Output is correct
32 Correct 10 ms 14412 KB Output is correct
33 Correct 11 ms 14552 KB Output is correct
34 Correct 11 ms 14540 KB Output is correct
35 Correct 12 ms 14540 KB Output is correct
36 Correct 11 ms 14668 KB Output is correct
37 Correct 12 ms 14620 KB Output is correct
38 Correct 12 ms 14668 KB Output is correct
39 Correct 12 ms 14688 KB Output is correct
40 Correct 11 ms 14492 KB Output is correct
41 Correct 11 ms 14552 KB Output is correct
42 Correct 11 ms 14556 KB Output is correct
43 Correct 12 ms 14668 KB Output is correct
44 Correct 12 ms 14676 KB Output is correct
45 Correct 12 ms 14680 KB Output is correct
46 Correct 12 ms 14796 KB Output is correct
47 Correct 12 ms 14780 KB Output is correct
48 Correct 12 ms 14680 KB Output is correct
49 Correct 12 ms 14640 KB Output is correct
50 Correct 12 ms 14540 KB Output is correct
51 Correct 12 ms 14552 KB Output is correct
52 Correct 12 ms 14660 KB Output is correct
53 Correct 12 ms 14668 KB Output is correct
54 Correct 12 ms 14668 KB Output is correct
55 Correct 16 ms 15156 KB Output is correct
56 Correct 35 ms 17048 KB Output is correct
57 Correct 52 ms 18912 KB Output is correct
58 Correct 63 ms 20080 KB Output is correct
59 Correct 83 ms 22188 KB Output is correct
60 Correct 105 ms 24188 KB Output is correct
61 Correct 118 ms 25280 KB Output is correct
62 Correct 135 ms 26680 KB Output is correct
63 Correct 154 ms 28568 KB Output is correct
64 Correct 174 ms 29756 KB Output is correct
65 Correct 95 ms 23856 KB Output is correct
66 Correct 93 ms 23960 KB Output is correct
67 Correct 93 ms 24004 KB Output is correct
68 Correct 150 ms 29800 KB Output is correct
69 Correct 161 ms 30484 KB Output is correct
70 Correct 168 ms 30736 KB Output is correct
71 Correct 187 ms 34232 KB Output is correct
72 Correct 188 ms 34548 KB Output is correct
73 Correct 168 ms 33344 KB Output is correct
74 Correct 171 ms 32004 KB Output is correct
75 Correct 165 ms 31016 KB Output is correct
76 Correct 164 ms 31396 KB Output is correct
77 Correct 178 ms 30776 KB Output is correct
78 Correct 185 ms 30284 KB Output is correct
79 Correct 157 ms 30896 KB Output is correct