제출 #1327911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1327911		nguyenkhangninh99	Magic Tree (CEOI19_magictree)	C++20	47 / 100	2094 ms	10760 KiB

magictree

#include <bits/stdc++.h>
using namespace std;

#define int long long
const int maxn = 2e5 + 5;
int dp[maxn], p[maxn];
vector<int> adj[maxn];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n, m, k; cin >> n >> m >> k;
    for(int i = 2; i <= n; i++){
        cin >> p[i];
        adj[p[i]].push_back(i);
    }

    vector<int> w(n + 1), d(n + 1, -1);

    for(int i = 1; i <= m; i++){
        int v; cin >> v;
        cin >> d[v] >> w[v];
    }

    vector<int> s;
    for(int i = 1; i <= n; i++) if(d[i] != -1) s.push_back(d[i]);

    sort(s.begin(), s.end());
    s.erase(unique(s.begin(), s.end()), s.end());

    for(int x: s){
        vector<int> sum(n + 1);
        for(int j = n; j >= 1; j--){
            dp[j] = max(dp[j], sum[j] + (d[j] == x ? w[j] : 0));
            sum[p[j]] += dp[j];
        }
    }

    cout << dp[1];
}

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