제출 #723635

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

magictree

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define MP make_pair
const int N = 100500;

vector<int> g[N];

ll dp[N][30];
pair<int, int> fruit[N];

void dfs(int v){
    dp[v][fruit[v].first] = fruit[v].second;

    for (int u : g[v]){
        dfs(u);
    }

    for (int t = 1; t <= 20; t++){
        for (int u : g[v]){
            dp[v][t] += *max_element(dp[u], dp[u] + t + 1);
        }
    }
}

void solve(){
    int n, m, k;
    cin >> n >> m >> k;

    for (int i = 2; i <= n; i++){
        int p;
        cin >> p;
        g[p].push_back(i);
    }

    for (int i = 0; i < m; i++){
        int v, d, w;
        cin >> v >> d >> w;
        fruit[v] = MP(d, w);
    }

    dfs(1);

    cout << *max_element(dp[1], dp[1] + 30) << endl;

}

int main() {
    ios_base::sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    solve();

    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