Submission #419298

#	Time	Username	Problem	Language	Result	Execution time	Memory
419298		Return_0	Fireworks (APIO16_fireworks)	C++17	100 / 100	188 ms	34548 KiB

fireworks

#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 / 7
• Subtask 2: 19 / 19
• Subtask 3: 29 / 29
• Subtask 4: 45 / 45