Laskettelukeskus

#include <bits/stdc++.h>
using namespace std;
 
const int N = 1e5+5;
 
vector<int> v[N], c(N), leaves(N);
 
void find_leaves(int s) {
    if (!v[s].size()) 
        leaves[s] = 1;
    for (int u : v[s]) find_leaves(u);
}
 
int calc(int s) {
    if (leaves[s]) return c[s];
    int cnt = 0;
    for (int u : v[s]) {
        cnt += calc(u);
    }
    return cnt;  
}
 
int main() {
    int n;
    cin >> n;
    for (int i = 1; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
    }
    for (int i = 1; i <= n; ++i) 
        cin >> c[i];
    find_leaves(1);
    //for (int i = 1; i <= n; ++i) cout << leaves[i] << ' ';
    //cout << '\n';
    cout << calc(1);
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 2

Verdict: WRONG ANSWER

Test 5

Group: 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: WRONG ANSWER