Submission #500980

#	Time	Username	Problem	Language	Result	Execution time	Memory
500980		sidon	Magic Tree (CEOI19_magictree)	C++17	100 / 100	168 ms	35864 KiB

magictree

#include <bits/stdc++.h>
using namespace std;
#define int long long
 
signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
 
	int N, M, K, res = 0, u;
	cin >> N >> M >> K;
 
	vector<int> g[N];
	int d[N] {}, w[N] {};
	map<int, int> dp[N];

	for(int i = 1; i < N; i++) 
		cin >> u, g[u-1].push_back(i);
	while(M--) 
		cin >> u >> d[u-1] >> w[u-1];
 
	for(u = N; --u >= 0; ) {
		int h = 0;
		for(int v : g[u])
			if(size(dp[v]) > size(dp[h])) h = v;
 
		dp[h].swap(dp[u]);
		for(int v : g[u]) if(v != h)
			for(auto &[i, j] : dp[v])
				dp[u][i] += j;
 
		dp[u][d[u]] += w[u];
 
		auto f = dp[u].upper_bound(d[u]);
		while(f != end(dp[u]) && (f->second -= w[u]) < 0)
			w[u] = -f->second, f = dp[u].erase(f);
	}
 
	for(auto &[i, j] : dp[0]) res += j;
	cout << res;
}

• Subtask 1: 6 / 6
• Subtask 2: 3 / 3
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 16 / 16
• Subtask 6: 13 / 13
• Subtask 7: 22 / 22
• Subtask 8: 17 / 17