제출 #899389

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
899389		12345678	Magic Tree (CEOI19_magictree)	C++17	34 / 100	2067 ms	33872 KiB

magictree

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=1e5+5, kx=21;
ll n, m, k, t[nx], w[nx], p, dp[nx][kx], x, ans, vl;
vector<int> d[nx];

void dfs(int u)
{
    for (auto v:d[u]) 
    {
        dfs(v);
        vl=0;
        for (int i=1; i<=k; i++) vl=max(vl, dp[v][i]), dp[u][i]+=vl;
    }
    dp[u][t[u]]+=w[u];
    for (int i=1; i<=k; i++) ans=max(ans, dp[u][i]);
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>k;
    for (int i=2; i<=n; i++) cin>>p, d[p].push_back(i);
    for (int i=1; i<=m; i++) cin>>x>>t[x]>>w[x];
    dfs(1);
    cout<<ans<<'\n';
}

• 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