QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #317836 | #6639. Disk Tree | ucup-team1005 | WA | 1ms | 3628kb | C++14 | 1.2kb | 2024-01-29 20:08:44 | 2024-01-29 20:08:45 |
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: 3628kb
input:
3 1 0 3 10 10 6 0 5 1
output:
YES 0 6 10 6 1 3 0 4
result:
ok answer = 1
Test #2:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
2 1 1 1 3 3 1
output:
YES 1 2 3 2
result:
ok answer = 1
Test #3:
score: 0
Accepted
time: 1ms
memory: 3588kb
input:
5 10 10 10 2 0 1 20 20 1 3 20 1 20 0 1
output:
YES 3 21 20 21 10 20 20 20 20 1 10 1 2 1 10 1
result:
ok answer = 1
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3628kb
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 98 17 92 45 92 99 85 45 85 48 78 99 78 28 65 48 65 17 34 28 45 29 31 17 31 0 18 17 18 34 10 0 10
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