Laskettelukeskus

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

vector<vector<int>> v;
vector<int> values;

int haku(int index)
{
  // If the node has no children
  if (v[index].size() == 0) return values[index];

  // The node has children
  
  // The number needed to plow the children
  int s = 0;

  for (int child : v[index])
  {
    s += haku(child);
  }

  /*
  Return the max of the number needed to
  plow the children and the number needed
  to plow the node
  */

  return max(s, values[index]);
}

int main()
{
  int n;

  cin >> n;

  v.resize(n);
  values.resize(n);

  for (int i = 0; i < n; i++)
  {
    int a, b;

    cin >> a >> b;

    v[a-1].push_back(b-1);
  }

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

  cout << haku(0);
}

Test 1

Group: 1, 2

Verdict: RUNTIME ERROR

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: RUNTIME ERROR

Test 7

Group: 2

Verdict: RUNTIME ERROR

Test 8

Group: 1, 2

Verdict: RUNTIME ERROR

Test 9

Group: 2

Verdict: RUNTIME ERROR

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: RUNTIME ERROR

Test 12

Group: 1, 2

Verdict: RUNTIME ERROR

Test 13

Group: 2

Verdict: RUNTIME ERROR