Submission #1200005

#	Time	Username	Problem	Language	Result	Execution time	Memory
1200005		irmuun	Magic Tree (CEOI19_magictree)	C++20	12 / 100	27 ms	12616 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];
    bool line=true;
    for(ll i=2;i<=n;i++){
        cin>>p[i];
        g[p[i]].pb(i);
        line&=(p[i]==i-1);
    }
    ll u[m],d[m],w[m];
    bool leaf=true;
    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];
    }
    if(k<=2){
        ll dp[n+5][3];
        memset(dp,0,sizeof dp);
        for(ll i=n;i>=1;i--){
            for(ll j=1;j<=2;j++){
                if(j==1){
                    for(ll x:g[i]){
                        dp[i][1]+=dp[x][1];
                    }
                    if(day[i]==1) dp[i][1]+=pt[i];
                }
                else{
                    for(ll x:g[i]){
                        dp[i][2]+=max(dp[x][1],dp[x][2]);
                    }
                    if(day[i]==2) dp[i][2]+=pt[i];
                }
            }
        }
        cout<<max(dp[1][1],dp[1][2]);
    }
}

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