Laskettelukeskus

#include <iostream>
#include <vector>
#include <math.h>
#include <limits.h>
#include <set>
#include <algorithm>
#include <queue>
#include <bitset>
#include <limits.h>
#include <float.h>
#include <stack>
#include <map>
 
using namespace std;
using ll = long long;
 
void dfs(int current, int parent, vector<vector<int>> &e, vector<ll> &r, vector<ll> &ch) {
 
    for(auto child: e[current])
        dfs(child, current, e, r, ch);
 
    ch[parent] += max(r[current], ch[current]);
 
}
 
int main()
{
    int n;
    cin >> n;
    vector<vector<int>> edges(n+1);
    vector<ll> reqs(n+1);
    vector<ll> ch_reqs(n+1, 0);
    for(int i = 0; i < n-1; i++) {
        int p,c;
        cin >> p >> c;
        edges[p].push_back(c);
    }
    for(int i = 1; i <= n; i++) {
        ll r;
        cin >> r;
        reqs[i] = r;
    }
 
    dfs(1, 0, edges, reqs, ch_reqs);
 
    cout << ch_reqs[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