Task: | Hiker Safety |
Sender: | Hannes Ihalainen |
Submission time: | 2017-10-31 19:48:58 +0200 |
Language: | C++ |
Status: | READY |
Result: | WRONG ANSWER |
test | verdict | time | |
---|---|---|---|
#1 | WRONG ANSWER | 0.04 s | details |
#2 | WRONG ANSWER | 0.04 s | details |
#3 | WRONG ANSWER | 0.05 s | details |
#4 | WRONG ANSWER | 0.05 s | details |
#5 | WRONG ANSWER | 0.03 s | details |
#6 | WRONG ANSWER | 0.04 s | details |
#7 | WRONG ANSWER | 0.04 s | details |
#8 | WRONG ANSWER | 0.03 s | details |
#9 | WRONG ANSWER | 0.04 s | details |
#10 | WRONG ANSWER | 0.04 s | details |
#11 | WRONG ANSWER | 0.03 s | details |
#12 | WRONG ANSWER | 0.04 s | details |
#13 | WRONG ANSWER | 0.03 s | details |
#14 | WRONG ANSWER | 0.03 s | details |
#15 | WRONG ANSWER | 0.03 s | details |
#16 | WRONG ANSWER | 0.03 s | details |
#17 | WRONG ANSWER | 0.04 s | details |
Code
#include <iostream> using namespace std; int B; int P; int K; int d[1010]; int A[1010]; int V[1010]; int MD[1010][1010]; int main(){ cin >> B; cin >> P; for (int i=0; i<P; ++i){ cin >> d[i]; if (i>0){ if (d[i]<d[i-1]) while (1); } } cin >> K; for (int i=0; i<K; ++i){ cin >> A[i] >> V[i]; } }
Test details
Test 1
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 99 218 221 239 269 684 719 1... |
correct output |
---|
1 1 1 1 1 2 1 1 2 4 5 6 7 8 9 ... |
user output |
---|
(empty) |
Test 2
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 548 712 779 815 978 1511 199... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 ... |
user output |
---|
(empty) |
Test 3
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 277 451 479 672 1238 1604 19... |
correct output |
---|
impossible |
user output |
---|
(empty) |
Test 4
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 232 341 342 510 575 942 1137... |
correct output |
---|
impossible |
user output |
---|
(empty) |
Test 5
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 980 1535 1694 2048 2430 3117... |
correct output |
---|
impossible |
user output |
---|
(empty) |
Test 6
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 179 318 387 529 633 861 872 ... |
correct output |
---|
impossible |
user output |
---|
(empty) |
Test 7
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 170 309 371 844 1656 2162 23... |
correct output |
---|
impossible |
user output |
---|
(empty) |
Test 8
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 600 1543 1909 1913 2128 2272... |
correct output |
---|
impossible |
user output |
---|
(empty) |
Test 9
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 15 24 215 1035 1056 1064 140... |
correct output |
---|
impossible |
user output |
---|
(empty) |
Test 10
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 525 1663 1820 1879 3342 4726... |
correct output |
---|
263 615 615 615 615 615 615 61... |
user output |
---|
(empty) |
Test 11
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 431 1256 1305 1530 3361 3445... |
correct output |
---|
620 620 619 619 619 619 618 61... |
user output |
---|
(empty) |
Test 12
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 140 162 888 1550 1746 2010 2... |
correct output |
---|
impossible |
user output |
---|
(empty) |
Test 13
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 109 153 562 649 1211 1316 15... |
correct output |
---|
impossible |
user output |
---|
(empty) |
Test 14
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 73 75 315 351 976 1015 1389 ... |
correct output |
---|
impossible |
user output |
---|
(empty) |
Test 15
Verdict: WRONG ANSWER
input |
---|
2 1000 0 1 2 3 4 5 6 7 8 9 10 11 12 1... |
correct output |
---|
999 998 997 998 996 997 995 99... |
user output |
---|
(empty) |
Test 16
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 171 195 1219 1417 2558 2771 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 17
Verdict: WRONG ANSWER
input |
---|
15000 1000 0 2 233 305 553 556 612 937 15... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |