Laskettelukeskus

#include <iostream>
#include <vector>
#include <deque>

using namespace std;

struct Node {
  long data;
  vector<Node*> children;
};

vector<Node*> nodes;

Node create_node(long data)
{
  Node node;
  node.data = data;
  return node;
}

long eval(Node* root)
{
  if (root->children.size() == 0) return root->data;
  long sum = 0;
  for (Node* child : root->children)
  {
    sum += eval(child);
  }
  return max(root->data, sum);
}

int main()
{
  int n;

  cin >> n;

  int path_start[n-1];
  int path_end[n-1];

  for (int i = 0; i < n - 1; i++)
  {
    cin >> path_start[i];
    cin >> path_end[i];
  }

  int data[n];

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

  for (int i = 0; i < n; i++)
  {
    Node node = create_node(data[i]);
    nodes.push_back(&node);
  }

  for (int i = 0; i < n - 1; i++)
  {
    nodes[path_start[i]]->children.push_back(nodes[path_end[i]]);
  }

  //cout << eval(nodes[0]);
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 1, 2

Verdict: RUNTIME ERROR

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

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

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