제출 #594822

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594822		czhang2718	Magic Tree (CEOI19_magictree)	C++17	100 / 100	140 ms	37868 KiB

magictree

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

typedef long long ll;

const int N=1e5;
int n, m, k;
int par[N];
int d[N], w[N];
map<int,ll> mp[N];

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> m >> k;
    for(int i=1; i<n; i++){
        cin >> par[i]; --par[i];
    }
    for(int i=0; i<m; i++){
        int v; cin >> v;
        v--;
        cin >> d[v] >> w[v];
    }

    auto join=[&](int i, int j){
        if(mp[i].size()>mp[j].size()) swap(mp[i], mp[j]);
        for(auto p:mp[i]){
            mp[j][p.first]+=p.second;
        }
    };

    for(int i=n-1; i>=0; i--){
        mp[i][d[i]]+=w[i];
        auto it=mp[i].upper_bound(d[i]);
        while(it!=mp[i].end()){
            if(it->second>w[i]){
                it->second-=w[i];
                break;
            }
            w[i]-=it->second;
            it++;
            mp[i].erase(prev(it));
        }
        // cout << "mp[" << i << "]\n";
        // for(auto p:mp[i]) cout << p.first << " " << p.second << "\n";
        if(i) join(i, par[i]);
    }

    ll ans=0;
    for(auto p:mp[0]) ans+=p.second;
    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