Laskettelukeskus

#include <bits/stdc++.h>
#define FOR(m) for (int i = 0; i<m; i++)
using namespace std;
 
vector <pair <int, int>> slopes = {}; //left, right
vector <int> wt;
 
int solve(int rt) {
    if (slopes[rt-1].first == 0)
        return wt[rt-1];
    int x = solve(slopes[rt-1].first) + solve(slopes[rt-1].second);
    return max(wt[rt-1], x);
}
 
int main() {
    int 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];
    }
    int ans = solve(1);
    cout << ans << endl;
    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: RUNTIME ERROR

Test 3

Group: 1, 2

Verdict: RUNTIME ERROR

Test 4

Group: 2

Verdict: RUNTIME ERROR

Test 5

Group: 2

Verdict: RUNTIME ERROR

Test 6

Group: 1, 2

Verdict: RUNTIME ERROR

Test 7

Group: 2

Verdict: RUNTIME ERROR

Test 8

Group: 1, 2

Verdict: RUNTIME ERROR

Test 9

Group: 2

Verdict: RUNTIME ERROR

Test 10

Group: 1, 2

Verdict: RUNTIME ERROR

Test 11

Group: 2

Verdict: RUNTIME ERROR

Test 12

Group: 1, 2

Verdict: RUNTIME ERROR

Test 13

Group: 2

Verdict: RUNTIME ERROR