Laskettelukeskus

#include <cmath>
#include <iostream>
#include <queue>

int recurse(std::vector<std::pair<int, int>>& huiput, int n) {
    if (n > 0) {
        return n;
    }

    while (huiput[n].second < 0) {
        n = -(huiput[n].second);
    }

    return n;
}

int main() {
    int rinteet;
    std::cin >> rinteet;

    std::vector<std::pair<int, int>> paths;
    std::vector<std::pair<int, int>> huiput;

    for (int i = 0; i < rinteet-1; ++i) {
        int n1;
        int n2;

        std::cin >> n1 >> n2;

        if (n2 > n1) {
            std::swap(n1, n2);
        }

        paths.push_back(std::pair(n2-1, n1-1));
    }

    for (int i = 0; i < rinteet; ++i) {
        int n;
        std::cin >> n;

        huiput.push_back(std::pair(n, 0));
    }

    for (auto path : paths) {
        int idx = path.second;

        while (huiput[std::abs(idx)].second < 0) {
            idx = huiput[-(idx)].second;
        }

        huiput[idx].second += std::max(huiput[path.first].second, huiput[path.first].first);

        huiput[path.first].second = -idx;
    }

    std::cout << huiput.front().second;
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 2

Verdict: RUNTIME ERROR

Test 5

Group: 2

Verdict: RUNTIME ERROR

Test 6

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: RUNTIME ERROR

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

Test 12

Group: 1, 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER