Laskettelukeskus

#include <bits/stdc++.h>
#define FOR(m) for (long i = 0; i<m; i++)
using namespace std;

vector <pair <long, long>> slopes = {}; //left, right
vector <long> wt;

long solve(long rt) {
    if (slopes[rt-1].first == 0)
        return wt[rt-1];
    long x = solve(slopes[rt-1].first) + solve(slopes[rt-1].second);
    return max(wt[rt-1], x);
}

int main() {
    long n, x, y;
    cin >> n;
    
    FOR(n) {
        slopes.push_back({0,0});
        wt.push_back(0);
    }
    
    FOR (n-1) {
        cin >> x >> y;
        if (slopes[x-1].first == 0)
            slopes[x-1].first = y;
        else
            slopes[x-1].second = y;
    }
    
    FOR (n) {
        cin >> wt[i];
    }
    long ans = solve(1);
    cout << ans;
    return 0;
}

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: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 1, 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER