Laskettelukeskus

#include <ios>
#include <iostream>
#include <vector>
 
int main() {
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
 
    long rinteet;
    std::cin >> rinteet;
 
    std::vector<std::pair<long, long>> paths;
    paths.resize(rinteet);
 
    std::vector<std::pair<long, long>> huiput;
    huiput.resize(rinteet+1);
 
    for (long i = 0; i < rinteet-1; ++i) {
        long n1;
        long n2;
 
        std::cin >> n1 >> n2;
 
        paths[i] = std::pair(n2, n1);
    }
 
    for (long i = 0; i < rinteet; ++i) {
        long n;
        std::cin >> n;
 
        huiput[i+1] = std::pair(n, 0);
    }
 
    for (long i = paths.size(); i >= 0; i--) {
        auto path = paths[i];
        huiput[path.second].second += std::max(huiput[path.first].first, huiput[path.first].second);
    }
 
    std::cout << std::max(huiput[1].second, huiput[1].first);
}

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