QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #317948 | #6639. Disk Tree | ucup-team1005 | WA | 0ms | 3696kb | C++14 | 1.6kb | 2024-01-30 00:31:26 | 2024-01-30 00:31: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: 0ms
memory: 3576kb
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: 0ms
memory: 3632kb
input:
2 1 1 1 3 3 1
output:
YES 1 2 3 2
result:
ok answer = 1
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3696kb
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 20 1 2 0
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