Task: | Laskettelukeskus |
Sender: | drvilepis |
Submission time: | 2023-10-30 22:35:49 +0200 |
Language: | C++ (C++20) |
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 | RUNTIME ERROR | 0.11 s | 2 | details |
#5 | RUNTIME ERROR | 0.11 s | 2 | details |
#6 | TIME LIMIT EXCEEDED | -- | 1, 2 | details |
#7 | RUNTIME ERROR | 0.09 s | 2 | details |
#8 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#9 | WRONG ANSWER | 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 <cmath>#include <iostream>#include <queue>int recurse(std::vector<std::pair<int, int>>& huiput, int n) {if (n > 0) {return n;}while (huiput[n].second < 0) {n = -(huiput[n].second);}return n;}int main() {int rinteet;std::cin >> rinteet;std::vector<std::pair<int, int>> paths;std::vector<std::pair<int, int>> huiput;for (int i = 0; i < rinteet-1; ++i) {int n1;int n2;std::cin >> n1 >> n2;if (n2 > n1) {std::swap(n1, n2);}paths.push_back(std::pair(n2-1, n1-1));}for (int i = 0; i < rinteet; ++i) {int n;std::cin >> n;huiput.push_back(std::pair(n, 0));}for (auto path : paths) {int idx = path.second;while (huiput[std::abs(idx)].second < 0) {idx = huiput[-(idx)].second;}huiput[idx].second += std::max(huiput[path.first].second, huiput[path.first].first);huiput[path.first].second = -idx;}std::cout << huiput.front().second;}
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 |
---|
-2 |
Test 2
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 73 1 64 64 23 1 88 ... |
correct output |
---|
2675 |
user output |
---|
-87 |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 36 36 56 56 59 36 97 ... |
correct output |
---|
2808 |
user output |
---|
-67 |
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: TIME LIMIT EXCEEDED
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: WRONG ANSWER
input |
---|
100 1 2 2 3 3 4 4 5 ... |
correct output |
---|
100 |
user output |
---|
-1 |
Test 9
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 1 2 2 3 3 4 4 5 ... |
correct output |
---|
1000000000 |
user output |
---|
-1 |
Test 10
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 2 1 3 2 4 2 5 ... |
correct output |
---|
2809 |
user output |
---|
-2 |
Test 11
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 1 2 1 3 2 4 2 5 ... |
correct output |
---|
26053917212428 |
user output |
---|
-2 |
Test 12
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 2 1 3 2 4 2 5 ... |
correct output |
---|
5000 |
user output |
---|
-2 |
Test 13
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 1 2 1 3 2 4 2 5 ... |
correct output |
---|
50000000000000 |
user output |
---|
-2 |