제출 #1235970

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1235970		clemmy14	Magic Tree (CEOI19_magictree)	C++20	0 / 100	64 ms	6868 KiB

magictree

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

vector<pair<int, int>> fruit;
vector<vector<int>> adj;

signed main() {
    int n, m, k; cin >> n >> m >> k;
    adj = vector<vector<int>>(n+1);
    for(int i=1; i<n; i++) {
        int a; cin >> a;
        adj[i+1].push_back(a);
        adj[a].push_back(i+1);
    }
    fruit = vector<pair<int, int>>(n+1, {0, 0});
    for(int i=1; i<n; i++) {
        int v, d, w; cin >> v >> d >> w;
        fruit[v]={d, w};
    }
    int ans=0;
    for(int i=1; i<=n; i++) ans+=fruit[i].second;
    cout << ans;
    return 0;
}

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