Laskettelukeskus

#include <iostream>
#include <vector>
 
using namespace std;
 
long long int dfs(int node, vector<vector<int>> &children, vector<long long int> &sizes) {
    long long int c = 0;
    for (auto i: children[node]) {
        c += dfs(i, children, sizes);
    }
    return max(c, sizes[node]);
}
 
int main() {
    
    int n;
    cin >> n;
 
    vector<vector<int>> children(n, vector<int>());
    for (int i = 0; i < n - 1; i++) {
        int a, b;
        cin >> a >> b;
        a -= 1;
        b -= 1;
        // cout << "a: " << a <<  " b: " << b << "\n";
        children[a].push_back(b);
    }
 
    vector<long long int> sizes(n);
    for (int i = 0; i < n; i++) {
        long long int c;
        cin >> c;
        sizes[i] = c;
    }
    
    /*
    for (int i = 0; i < n - 1; i++) {
        for (auto j: children[i]) {
            cout << i + 1 << " -> " << j + 1 << "\n";
        }
    }
    */
   
    long long int res = dfs(0, children, sizes);
    cout << res << "\n";
 
    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: ACCEPTED

Test 5

Group: 2

Verdict: ACCEPTED

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: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED