Submission #1327985

#	Time	Username	Problem	Language	Result	Execution time	Memory
1327985		nguyenkhangninh99	Magic Tree (CEOI19_magictree)	C++20	100 / 100	87 ms	39576 KiB

magictree

#include <bits/stdc++.h>
using namespace std;

#define int long long
const int maxn = 2e5 + 5;
vector<int> adj[maxn];
map<int, int> f[maxn];
int d[maxn], w[maxn];

void dfs(int u){
    for(int v: adj[u]){
        dfs(v);
        if(f[u].size() < f[v].size()) swap(f[u], f[v]);
        for(auto [t, val]: f[v]) f[u][t] += val;
        f[v].clear(); 
    }

    if(d[u] != 0){
        f[u][d[u]] += w[u];
        auto it = f[u].upper_bound(d[u]);
        while(it != f[u].end() && w[u]){
            if(it->second <= w[u]){
                w[u] -= it->second;
                it = f[u].erase(it);
            }else{
                it->second -= w[u];
                w[u] = 0;
            }
        }
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n, m, k; cin >> n >> m >> k;
    for(int i = 2; i <= n; i++){
        int p; cin >> p;
        adj[p].push_back(i);
    }
    for(int i = 1; i <= m; i++){
        int v; cin >> v;
        cin >> d[v] >> w[v];
    }
    dfs(1);
    int res = 0;
    for(auto [t, val] : f[1]) res += val;
    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