Laskettelukeskus

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

int bfs(int cur, vector<int> & slopes, vector<vector<int>> & adj){
    if(adj[cur].size() == 0){
        return slopes[cur];
    }
    int sum = 0;
    for(auto & ad : adj[cur]){
        sum += bfs(ad, slopes, adj);
    }
    return max(slopes[cur], sum);
}

int main() {
    int n;
    cin >> n;
    vector<int> slopes(n);
    vector<vector<int>> adj(n);
    int a, b;
    for(int i =0; i < n-1; i++){
        cin >> a >> b;
        adj[a-1].push_back(b-1);
    }
    int c;
    for(int i =0; i < n; i++){
        cin >> c;
        slopes[i] = c;
    }
    cout << bfs(0, slopes, adj);
}

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

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: WRONG ANSWER