Laskettelukeskus

#include <iostream>
#include <algorithm>

using namespace std;


struct node {
   struct node *parent;
   int snowplows;
   int going = 0;
};



int main()
{
    int slope_count;

    cin >> slope_count;

    node slopes[slope_count];

    node root_node;
    root_node.snowplows = 0;
    slopes[0] = root_node;

    for (int i = 1; i < slope_count; i++) {
        int a, b;
        cin >> a >> b;
        node n;
        n.parent = &slopes[a-1];
        slopes[b-1] = n;
    }

    int plows;
    int slope_i = 0;
    while ( cin >> plows ) {
        slopes[slope_i].snowplows = plows;
        slope_i++;
    }
    for (int i = slope_count; i--;) {
        int needed = max(slopes[i].snowplows, slopes[i].going);
        if (i == 0) {
            cout << needed;
            break;
        }
        slopes[i].parent->going += needed;
    }

        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: ACCEPTED

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: WRONG ANSWER