| Task: | Laskettelukeskus |
| Sender: | Verlet |
| Submission time: | 2023-11-03 13:50:54 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | RUNTIME ERROR | 0 |
| #2 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | RUNTIME ERROR | 0.00 s | 1, 2 | details |
| #2 | RUNTIME ERROR | 0.61 s | 1, 2 | details |
| #3 | RUNTIME ERROR | 0.61 s | 1, 2 | details |
| #4 | RUNTIME ERROR | 0.71 s | 2 | details |
| #5 | RUNTIME ERROR | 0.71 s | 2 | details |
| #6 | RUNTIME ERROR | 0.61 s | 1, 2 | details |
| #7 | RUNTIME ERROR | 0.69 s | 2 | details |
| #8 | RUNTIME ERROR | 0.61 s | 1, 2 | details |
| #9 | RUNTIME ERROR | 0.75 s | 2 | details |
| #10 | RUNTIME ERROR | 0.61 s | 1, 2 | details |
| #11 | RUNTIME ERROR | 0.72 s | 2 | details |
| #12 | RUNTIME ERROR | 0.61 s | 1, 2 | details |
| #13 | RUNTIME ERROR | 0.72 s | 2 | details |
Code
#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;
node.children = vector<Node>(0);
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 details
Test 1
Group: 1, 2
Verdict: RUNTIME ERROR
| input |
|---|
| 5 1 2 1 3 3 4 3 5 ... |
| correct output |
|---|
| 6 |
| user output |
|---|
| (empty) |
Test 2
Group: 1, 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100 1 73 1 64 64 23 1 88 ... |
| correct output |
|---|
| 2675 |
| user output |
|---|
| (empty) |
Test 3
Group: 1, 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100 1 36 36 56 56 59 36 97 ... |
| correct output |
|---|
| 2808 |
| user output |
|---|
| (empty) |
Test 4
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 1 45452 1 74209 45452 78960 45452 79820 ... |
| correct output |
|---|
| 28399367694319 |
| user output |
|---|
| (empty) |
Test 5
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 1 31165 1 23263 31165 89516 31165 53122 ... |
| correct output |
|---|
| 28546840313799 |
| user output |
|---|
| (empty) |
Test 6
Group: 1, 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100 1 79 79 9 79 45 45 10 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 7
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 1 66038 1 56789 56789 7403 66038 69542 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 8
Group: 1, 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100 1 2 2 3 3 4 4 5 ... |
| correct output |
|---|
| 100 |
| user output |
|---|
| (empty) |
Test 9
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 1 2 2 3 3 4 4 5 ... |
| correct output |
|---|
| 1000000000 |
| user output |
|---|
| (empty) |
Test 10
Group: 1, 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 2809 |
| user output |
|---|
| (empty) |
Test 11
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 26053917212428 |
| user output |
|---|
| (empty) |
Test 12
Group: 1, 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 5000 |
| user output |
|---|
| (empty) |
Test 13
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 50000000000000 |
| user output |
|---|
| (empty) |
