제출 #966731

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
966731		boyliguanhan	Magic Tree (CEOI19_magictree)	C++17	100 / 100	110 ms	32584 KiB

magictree

#include<bits/stdc++.h>
using namespace std;
#define N 7<<14
#define int long long
vector<int>adj[N];
map<int,int> dp[N];
int d[N],w[N];
void dfs(int n){
    dp[n][0];
    for(auto i:adj[n]){
        dfs(i);
        if(size(dp[n])<size(dp[i]))
            swap(dp[n],dp[i]);
        for(auto&[i,j]:dp[i])
            dp[n][i]+=j;
        dp[i].clear();
    }
    if(w[n]){
        dp[n][d[n]]+=w[n];
        auto it=dp[n].upper_bound(d[n]);
        while(it!=dp[n].end()){
            if(it->second<=w[n])
                next(it)->second+=it->second,it=next(it),dp[n].erase(prev(it));
            else {
                it->second-=w[n];
                break;
            }
        }
    }
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int n,m,k,Q;
    cin>>n>>m>>k;
    for(int i=2;i<=n;i++)
        cin>>Q,adj[Q].push_back(i);
    while(m--){
        int a,b,c;
        cin>>a>>b>>c;
        d[a]=b,w[a]=c;
    }
    dfs(1);
    int ans=0;
    for(auto&[i,j]:dp[1])
        ans+=j;
    cout<<ans;
}

• 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