QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#297216#5404. 述树术hyforces#0 417ms3896kbC++201.2kb2024-01-04 06:53:432024-04-28 08:30:49

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 42ms
memory: 3788kb

input:

499 7890
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0...

output:

0
you must call Report(x, y) exactly n-1 times.

result:

wrong answer you

Subtask #2:

score: 0
Wrong Answer

Test #30:

score: 0
Wrong Answer
time: 417ms
memory: 3896kb

input:

999 16789
0 0
0 0
0 0
495 639
428 443
0 0
511 28
0 0
0 0
0 0
0 0
31 729
899 866
429 959
357 322
795 615
235 620
0 0
0 0
85 389
33 50
234 522
276 468
480 269
0 0
705 536
0 0
87 446
889 578
86 472
0 0
699 53
0 0
706 976
381 493
0 0
441 164
0 0
0 0
0 0
283 215
0 0
113 208
334 225
372 487
0 0
878 418
0 ...

output:

0
Wrong answer!

result:

wrong answer Wrong