Submission #1204502

#	Time	Username	Problem	Language	Result	Execution time	Memory
1204502		irmuun	Magic Tree (CEOI19_magictree)	C++20	34 / 100	2115 ms	886356 KiB

magictree

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m,k;
    cin>>n>>m>>k;
    vector<ll>g[n+5];
    ll p[n+5];
    for(ll i=2;i<=n;i++){
        cin>>p[i];
        g[p[i]].pb(i);
    }
    vector<ll>days;
    ll u[m],d[m],w[m];
    vector<ll>day(n+5,0),pt(n+5,0);
    for(ll i=0;i<m;i++){
        cin>>u[i]>>d[i]>>w[i];
        day[u[i]]=d[i];
        pt[u[i]]=w[i];
        days.pb(d[i]);
    }
    sort(all(days));
    days.erase(unique(all(days)),days.end());
    for(ll i=0;i<m;i++){
        ll j=lower_bound(all(days),d[i])-days.begin()+1;
        day[u[i]]=j;
    }
    k=days.size();
    map<ll,ll>dp[n+5];
    map<ll,ll>add;
    for(ll i=n;i>=1;i--){
        ll sz=-1,id=-1;
        for(ll j:g[i]){
            if(dp[j].size()>sz){
                sz=dp[j].size();
                id=j;
            }
        }
        if(id>-1){
            swap(dp[i],dp[id]);
        }
        set<ll>st;
        for(auto x:dp[i]){
            st.insert(x.ff);
        }
        if(day[i]>0){
            st.insert(day[i]);
        }
        for(ll j:g[i]){
            if(j==id) continue;
            for(auto x:dp[j]){
                st.insert(x.ff);
            }
        }
        for(ll x:st){
            for(ll j:g[i]){
                if(j==id) continue;
                auto it=dp[j].upper_bound(x);
                if(it!=dp[j].begin()){
                    it--;
                    dp[i][x]+=(it->ss);
                }
            }
        }
        if(day[i]>0){
            dp[i][day[i]]+=pt[i];
        }
        ll mx=0;
        for(auto &p:dp[i]){
            mx=max(mx,p.ss);
            p.ss=max(p.ss,mx);
        }
        /*
        for(ll j=1;j<=k;j++){
            for(ll x:g[i]){
                dp[i][j]+=pre[x][j];
            }
            if(day[i]==j){
                dp[i][j]+=pt[i];
            }
        }
        for(ll j=1;j<=k;j++){
            pre[i][j]=max(dp[i][j],pre[i][j-1]);
        }
        */
        if(i==1){
            cout<<mx;
            return 0;
        }
    }
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 3
• Subtask 3: 0 / 11
• Subtask 4: 12 / 12
• Subtask 5: 16 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17