QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #317813 | #6639. Disk Tree | ucup-team1005 | WA | 1ms | 3704kb | C++14 | 920b | 2024-01-29 19:40:35 | 2024-01-29 19:40:35 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3588kb
input:
3 1 0 3 10 10 6 0 5 1
output:
YES 0 6 10 10 1 3 10 10
result:
ok answer = 1
Test #2:
score: 0
Accepted
time: 0ms
memory: 3700kb
input:
2 1 1 1 3 3 1
output:
YES 1 2 3 3
result:
ok answer = 1
Test #3:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
5 10 10 10 2 0 1 20 20 1 3 20 1 20 0 1
output:
YES 3 21 20 20 10 20 20 20 20 1 10 10 2 1 10 10
result:
ok answer = 1
Test #4:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
10 29 29 2 28 55 10 99 81 4 17 82 10 45 88 10 48 68 10 0 8 10 98 95 10 34 0 10 17 24 10
output:
YES 45 98 98 95 17 92 45 88 99 85 98 95 48 78 99 81 28 65 48 68 17 34 17 82 29 31 48 68 0 18 17 24 34 10 48 68
result:
ok answer = 1
Test #5:
score: -100
Wrong Answer
time: 0ms
memory: 3544kb
input:
100 490 783 12 666 460 55 561 245 6 223 323 25 3 520 77 225 161 24 514 190 16 997 914 100 412 265 100 374 610 36 296 854 39 601 901 2 307 21 100 390 422 24 940 414 32 332 438 35 553 992 100 235 775 3 656 901 37 770 417 22 649 305 100 448 84 3 375 939 77 910 847 9 776 357 37 743 97 100 371 502 39 508...
output:
YES 375 1016 553 992 997 1014 553 992 67 1012 375 939 235 990 375 939 293 974 375 939 777 948 997 914 656 938 777 925 841 930 997 914 468 908 553 992 601 903 656 901 116 903 235 934 296 893 375 939 680 864 777 925 910 856 997 914 51 855 116 850 384 846 468 868 771 846 777 925 32 818 51 843 584 811 6...
result:
wrong answer Two line segments intersect, and it's not only the endpoints that intersect or line segments intersects/touches more than 2 disks