QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #317810 | #6639. Disk Tree | ucup-team1005 | WA | 0ms | 3680kb | C++14 | 791b | 2024-01-29 19:37:15 | 2024-01-29 19:37:16 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3672kb
input:
3 1 0 3 10 10 6 0 5 1
output:
YES 0 6 10 16 1 3 10 16
result:
ok answer = 1
Test #2:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
2 1 1 1 3 3 1
output:
YES 1 2 3 4
result:
ok answer = 1
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3680kb
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 21 20 1 20 21 2 1 3 21
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