Submission #793335

#	Time	Username	Problem	Language	Result	Execution time	Memory
793335		ToniB	Fireworks (APIO16_fireworks)	C++17	26 / 100	39 ms	4016 KiB

fireworks

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 5005;

ll n, m, perm[MAXN];
vector<pair<ll, ll> > adj[MAXN];
ll walk[MAXN], dp[MAXN][MAXN];

void precalc(ll node){
	for(pair<ll, ll> x : adj[node]){
		walk[x.first] = walk[node] + x.second;
		precalc(x.first);
	}
}

void dfs(ll node){
	if(node >= n){
		for(ll i = 0; i < n + m; ++i) dp[node][i] = abs(walk[perm[i]] - walk[node]);
	}
	for(pair<ll, ll> x : adj[node]){
		dfs(x.first);

		multiset<ll> lo, hi;
		vector<ll> uk (n + m);

		for(ll i = 0; i < n + m; ++i){
			lo.insert(dp[x.first][i] - walk[perm[i]]);
			uk[i] = walk[perm[i]] + *lo.begin();
			if(i != n + m - 1) assert(walk[perm[i]] <= walk[perm[i + 1]]);
		}

		ll p = n + m - 1;
		for(ll i = n + m - 1; i >= 0; --i){
			hi.insert(dp[x.first][i] + walk[perm[i]]);

			while(p > i && x.second + walk[perm[i]] - walk[perm[p]] < 0){
				assert(hi.find(dp[x.first][p] + walk[perm[p]]) != hi.end());
				hi.erase(hi.find(dp[x.first][p] + walk[perm[p]]));
				--p;
			}
			uk[i] = min(uk[i], *hi.begin() - walk[perm[i]]);
		}

		for(ll i = 0; i < n + m; ++i){
			dp[node][i] += uk[i];
		}
	}
}

int main(){
	cin >> n >> m;
	for(ll i = 1; i < n + m; ++i){
		ll p, c;
		cin >> p >> c, --p;
		adj[p].push_back({i, c});
	}
	precalc(0);
	vector<pair<ll, ll> > walks;
	for(ll i = 0; i < n + m; ++i) walks.push_back({walk[i], i});
	sort(walks.begin(), walks.end());
	for(ll i = 0; i < n + m; ++i) perm[i] = walks[i].second;

	dfs(0);

	ll ans = dp[0][0];
	for(ll i = 1; i < n + m; ++i) ans = min(ans, dp[0][i]);

	cout << ans;
	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 19 / 19
• Subtask 3: 0 / 29
• Subtask 4: 0 / 45