Submission #900512

#	Time	Username	Problem	Language	Result	Execution time	Memory
900512		Trisanu_Das	Magic Tree (CEOI19_magictree)	C++17	0 / 100	40 ms	23828 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, ans = 0, u;
	cin >> N >> M >> K;
	vector<int> adj[N];
	int d[N] {}, w[N] {};
	map<int, int> dp[N];
	for(int i = 1; i < N; i++)  cin >> u, adj[u - 1].push_back(i);
	while(M--)  cin >> u >> d[u - 1] >> w[u - 1];
	for(u = N; u >= 0; u--) {
		int h = 0;
		for(int v : adj[u]) if(size(dp[v]) > size(dp[h])) h = v;
		dp[h].swap(dp[u]);
		for(int v : adj[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]) ans += j;
	cout << ans << '\n';
}

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