Laskettelukeskus

#include <iostream>
#include <vector>
using namespace std;

vector<vector<int>> graph;
vector<int> c;

int dfs(int node, int parent) {
    int snowplows_needed = 0;

    for (int neighbor : graph[node]) {
        if (neighbor != parent) {
            snowplows_needed += max(0, dfs(neighbor, node) - 1);
        }
    }

    snowplows_needed += c[node];

    return max(snowplows_needed, 0);
}

int smallest_number_of_snowplows(int n) {
    int minimum_snowplows = dfs(0, -1);
    return minimum_snowplows;
}

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

    graph.resize(n);
    c.resize(n);

    for (int i = 0; i < n - 1; i++) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        graph[a].push_back(b);
    }

    for (int i = 0; i < n; i++) {
        cin >> c[i];
    }

    int result = smallest_number_of_snowplows(n);
    cout << result << endl;

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

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

Test 13

Group: 2

Verdict: WRONG ANSWER