| Task: | Laskettelukeskus |
| Sender: | Verlet |
| Submission time: | 2023-11-03 17:44:12 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.00 s | 1, 2 | details |
| #2 | WRONG ANSWER | 0.00 s | 1, 2 | details |
| #3 | WRONG ANSWER | 0.00 s | 1, 2 | details |
| #4 | WRONG ANSWER | 0.11 s | 2 | details |
| #5 | WRONG ANSWER | 0.11 s | 2 | details |
| #6 | ACCEPTED | 0.00 s | 1, 2 | details |
| #7 | ACCEPTED | 0.09 s | 2 | details |
| #8 | ACCEPTED | 0.00 s | 1, 2 | details |
| #9 | ACCEPTED | 0.12 s | 2 | details |
| #10 | WRONG ANSWER | 0.00 s | 1, 2 | details |
| #11 | WRONG ANSWER | 0.11 s | 2 | details |
| #12 | WRONG ANSWER | 0.00 s | 1, 2 | details |
| #13 | WRONG ANSWER | 0.12 s | 2 | details |
Code
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
struct Node {
int id;
long data;
vector<Node*> children;
};
Node* create_node(long data, int id)
{
Node* node = new Node;
node->data = data;
node->id = id;
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);
}
void insert(Node* root, int parent, Node* node)
{
if (root->id == parent)
{
root->children.push_back(node);
}
else
{
for (Node* child : root->children)
{
if (child->id == parent)
{
insert(child, parent, node);
}
}
}
}
int main()
{
int n;
cin >> n;
int path_start[n-1], path_end[n-1], data[n];
for (int i = 0; i < n - 1; i++)
{
cin >> path_start[i];
cin >> path_end[i];
}
for (int i = 0; i < n; i++)
{
cin >> data[i];
}
Node* root = create_node(data[0], 1);
for (int i = 1; i < n; i++)
{
Node* node = create_node(data[i], path_start[i-1]);
insert(root, path_end[i-1], node);
}
cout << eval(root);
}Test details
Test 1
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 5 1 2 1 3 3 4 3 5 ... |
| correct output |
|---|
| 6 |
| user output |
|---|
| 0 |
Test 2
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 100 1 73 1 64 64 23 1 88 ... |
| correct output |
|---|
| 2675 |
| user output |
|---|
| 61 |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 100 1 36 36 56 56 59 36 97 ... |
| correct output |
|---|
| 2808 |
| user output |
|---|
| 65 |
Test 4
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 100000 1 45452 1 74209 45452 78960 45452 79820 ... |
| correct output |
|---|
| 28399367694319 |
| user output |
|---|
| 981018595 |
Test 5
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 100000 1 31165 1 23263 31165 89516 31165 53122 ... |
| correct output |
|---|
| 28546840313799 |
| user output |
|---|
| 409055242 |
Test 6
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 100 1 79 79 9 79 45 45 10 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 7
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 1 66038 1 56789 56789 7403 66038 69542 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 100 1 2 2 3 3 4 4 5 ... |
| correct output |
|---|
| 100 |
| user output |
|---|
| 100 |
Test 9
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 1 2 2 3 3 4 4 5 ... |
| correct output |
|---|
| 1000000000 |
| user output |
|---|
| 1000000000 |
Test 10
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 100 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 2809 |
| user output |
|---|
| 28 |
Test 11
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 100000 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 26053917212428 |
| user output |
|---|
| 19135575 |
Test 12
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 100 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 5000 |
| user output |
|---|
| 100 |
Test 13
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 100000 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 50000000000000 |
| user output |
|---|
| 1000000000 |
