Laskettelukeskus

#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<int, int> values;
 
int traverse(map<int, vector<int>>& routes, map<int, int>& times, int n){
    int amount = times[n];
    int sum = 0;
    for(auto i : routes[n]){
        if(values.find(i) != values.end())
            return values[i];
        sum += traverse(routes, times, i);
    }
    values[n] = max(amount, sum);
    return values[n];
}
 
int main(){
    int n;
    cin >> n;
 
    map<int, vector<int>> routes;
    for(int i = 0; i < n-1; i++){
        int a, b;
        cin >> a >> b;
        routes[a].push_back(b);
    }
    map<int, int> times;
    for(int i = 1; i <= n; i++){
        int c;
        cin >> c;
        times[i] = c;
    }
 
    cout << traverse(routes, times, 1);
}

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