QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #212040 | #6639. Disk Tree | ucup-team241# | WA | 6ms | 29100kb | C++14 | 1.6kb | 2023-10-13 06:33:25 | 2023-10-13 06:33:26 |
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: 6ms
memory: 27768kb
input:
3 1 0 3 10 10 6 0 5 1
output:
YES 10 4 1 3 10 6 0 6
result:
ok answer = 1
Test #2:
score: 0
Accepted
time: 3ms
memory: 28052kb
input:
2 1 1 1 3 3 1
output:
YES 3 2 1 2
result:
ok answer = 1
Test #3:
score: 0
Accepted
time: 0ms
memory: 29100kb
input:
5 10 10 10 2 0 1 20 20 1 3 20 1 20 0 1
output:
YES 3 20 10 20 10 1 2 1 3 21 20 21 10 1 20 1
result:
ok answer = 1
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 28160kb
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 17 31 29 31 48 65 28 65 45 85 99 85 45 92 17 92 98 98 45 98 17 78 48 78 17 18 0 18 0 10 34 10 28 45 17 34
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