QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #212045 | #6639. Disk Tree | ucup-team241# | WA | 6ms | 29476kb | C++14 | 1.9kb | 2023-10-13 06:39:34 | 2023-10-13 06:39:34 |
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: 29208kb
input:
3 1 0 3 10 10 6 0 5 1
output:
YES 0 4 10 4 1 3 0 4
result:
ok answer = 1
Test #2:
score: 0
Accepted
time: 0ms
memory: 28496kb
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: 4ms
memory: 29476kb
input:
5 10 10 10 2 0 1 20 20 1 3 20 1 20 0 1
output:
YES 2 0 10 0 10 19 20 19 10 19 3 19 2 0 20 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