Laskettelukeskus

#include <iostream>
#include <vector>
#include <queue>

using namespace std;
const int MAXN = 100001; // Maximum number of cities

int main()
{
    int n;
    cin >> n;

    vector<int> graph(n + 1, 0);
    vector<int> plows(n + 1, 0);
    for (int i = 1; i < n; i++)
    {
        int a, b;
        cin >> a >> b;
        graph[a] = b;
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> plows[i];
    }
    // output the leaves
    // queue<int> leaves;
    int totalPlows = 0;
    for (int i = 1; i <= n; i++)
    {
        // cout << graph[i] << " ";
        if (graph[i] == 0)
        {
            // leaves.push(i);
            totalPlows += plows[i];
        }
    }
    cout << totalPlows << endl;
    // while (!leaves.empty())
    // {
    //     cout << leaves.front() << " ";
    //     leaves.pop();
    // }
    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

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

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: WRONG ANSWER