Submission #898877

#	Time	Username	Problem	Language	Result	Execution time	Memory
898877		vjudge1	Magic Tree (CEOI19_magictree)	C++17	0 / 100	35 ms	6240 KiB

magictree

#include <bits/stdc++.h>

using namespace std;

#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define u_map unordered_map
#define int ll
const int maxn = 1e5 + 5, mod = 1e9 + 7;

vector<int> adj[maxn];
int d[maxn], w[maxn], ans;
bool mark[maxn];

void dfs(int v) {
	mark[v] = 1;
	for (int u: adj[v]) {
		dfs(u);
	}
	if (adj[v].size() == 0) {
		ans += d[v];
	}
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 2; i <= n; i++) {
    	int p;
    	cin >> p;
    	adj[p].pb(i);
    }
    for (int i = 1; i <= m; i++) {
    	int a, b, c;
    	cin >> a >> b >> c;
    	d[a] = b;
    	w[a] = c;
    }
    dfs(1);
    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