제출 #659412

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

magictree

/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD1 (1000000000+7)
#define MOD (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 25;



int n, m, k, t[N];
vector<int> g[N];
ll w[N], dp[N][K];

void dfs(int v, int p){
    for(int i = 0; i < K; ++i) dp[v][i] = 0;
    for(int u: g[v]){
        dfs(u, v);
        for(int i = 1; i < K; ++i) dp[v][i] += dp[u][i];
    }
    dp[v][t[v]] += w[v];
    for(int i = 1; i < K; ++i) dp[v][i] = max(dp[v][i], dp[v][i - 1]);
}


void solve(){
    cin >> n >> m >> k;
    for(int i = 2; i <= n; ++i){
        int p; cin >> p;
        g[p].pb(i);
    }
    for(int i = 0; i <= n; ++i) t[i] = w[i] = 0;
    for(int i = 0; i < m; ++i){
        int v, d, e; cin >> v >> d >> e;
        t[v] = d;
        w[v] = e;
    }


    dfs(1, 0);


    cout << *max_element(dp[1] + 1, dp[1] + K);
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

컴파일 시 표준 에러 (stderr) 메시지

magictree.cpp: In function 'int main()':
magictree.cpp:60:16: warning: unused variable 'aa' [-Wunused-variable]
   60 |     int T = 1, aa;
      |                ^~

• 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