제출 #1107654

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1107654		imarn	Magic Tree (CEOI19_magictree)	C++14	100 / 100	124 ms	36760 KiB

magictree

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
using namespace std;
const int mxn=1e5+5;
vector<int>g[mxn];
int d[mxn]{0},w[mxn]{0};
map<int,ll>mp[mxn];
void dfs(int u){
    for(auto v:g[u]){
        dfs(v);
        if(mp[u].size()<mp[v].size())swap(mp[u],mp[v]);
        for(auto it : mp[v])mp[u][it.f]+=it.s;
    }if(d[u]==0)return;
    mp[u][d[u]]+=w[u];int cur=w[u];
    auto it = mp[u].upper_bound(d[u]);
    for(;it!=mp[u].end();){
        if(it->s<=cur){auto ij=it;it++;cur-=ij->s;mp[u].erase(ij);}
        else {it->s-=cur;break;}
    }
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,m,k;cin>>n>>m>>k;
    for(int i=2;i<=n;i++){
        int p;cin>>p;g[p].pb(i);
    }
    for(int i=1;i<=m;i++){
        int v;cin>>v;cin>>d[v]>>w[v];
    }dfs(1);ll rs=0;
    for(auto it : mp[1])rs+=it.s;
    cout<<rs;
}

• 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