Laskettelukeskus

#include <iostream>
#include <vector>
#include <map>
using namespace std;
 
void dfs(int n, map<int, vector<int>>& routes, map<int, long long>& times) {
    long long sum = 0;
    for (int i : routes[n]) {
        dfs(i, routes, times);
        sum += times[i];
    }
    times[n] = max(times[n], sum);
}
 
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, long long> times;
    for (int i = 1; i <= n; i++) {
        long long c;
        cin >> c;
        times[i] = c;
    }
 
    dfs(1, routes, times);
 
    cout << 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: 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