제출 #574154

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
574154		AQT	Magic Tree (CEOI19_magictree)	C++14	100 / 100	106 ms	31588 KiB

magictree

#include <bits/stdc++.h>

using namespace std;

int N, M, K;
vector<int> graph[100005];
int day[100005];
long long val[100005];

map<int, long long> dfs(int n) {
	map<int, long long> ret;
	for(int e : graph[n]) {
		auto m = dfs(e);
		if(ret.size() < m.size()) {
			swap(ret, m);
		}
		for(auto p : m) {
			ret[p.first] += p.second;
		}
	}
	if(val[n]) {
		ret[day[n]] += val[n];
		long long pre = 0;
		while(1) {
			auto ptr = ret.upper_bound(day[n]);
			if(ptr != ret.end()) {
				pre += ptr->second;
				if(pre > val[n]) {
					ptr->second = pre - val[n];
					break;
				}
				else {
					ret.erase(ptr);
				}
			}
			else {
				break;
			}
		}
	}
	return ret;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M >> K;
	for(int i = 2; i <= N; i++) {
		int p;
		cin >> p;
		graph[p].push_back(i);
	}
	for(int i = 1; i <= M; i++) {
		int n;
		cin >> n;
		cin >> day[n] >> val[n];
	}
	auto mp = dfs(1);
	long long ans = 0;
	for(auto p : mp) {
		ans += p.second;
	}
	cout << ans << "\n";
}

• 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