Laskettelukeskus

#include <iostream>
#include <vector>

using namespace std;

vector<vector<int>> tree;
vector<int> values;

long dfs(int root) {
  if (tree[root].size() == 0) {
    return values[root];
  }
  int sum = 0;
  for (int child : tree[root]) {
    sum += dfs(child);
  }
  return max(values[root], sum);
}

int main()
{
  int a, b, c, N, E;
  cin >> N;
  E = N - 1;
  tree.resize(N+1);
  values.resize(N);

  while (E--) {
    cin >> a >> b;
    tree[a].push_back(b);
  }
  while (N--) {
    cin >> c;
    values.push_back(c);
  }

  cout << dfs(1);
}

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

Test 13

Group: 2

Verdict: WRONG ANSWER