QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #213530 | #6639. Disk Tree | GuanYunchang | WA | 1ms | 3536kb | C++20 | 2.9kb | 2023-10-14 14:44:39 | 2023-10-14 14:44:39 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3536kb
input:
3 1 0 3 10 10 6 0 5 1
output:
YES 1 0 0 5 0 5 10 10
result:
ok answer = 1
Test #2:
score: 0
Accepted
time: 0ms
memory: 3472kb
input:
2 1 1 1 3 3 1
output:
YES 1 1 3 3
result:
ok answer = 1
Test #3:
score: 0
Accepted
time: 0ms
memory: 3460kb
input:
5 10 10 10 2 0 1 20 20 1 3 20 1 20 0 1
output:
YES 3 20 10 10 10 10 2 0 10 10 20 20 20 0 10 10
result:
ok answer = 1
Test #4:
score: 0
Accepted
time: 0ms
memory: 3516kb
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 24 29 29 99 81 98 95 45 88 48 68 0 8 17 24 28 55 48 68 29 29 28 55 17 82 45 88 34 0 29 29 48 68 99 81
result:
ok answer = 1
Test #5:
score: -100
Wrong Answer
time: 1ms
memory: 3532kb
input:
100 490 783 12 666 460 55 561 245 6 223 323 25 3 520 77 225 161 24 514 190 16 997 914 100 412 265 100 374 610 36 296 854 39 601 901 2 307 21 100 390 422 24 940 414 32 332 438 35 553 992 100 235 775 3 656 901 37 770 417 22 649 305 100 448 84 3 375 939 77 910 847 9 776 357 37 743 97 100 371 502 39 508...
output:
YES 267 249 255 263 76 226 95 208 770 417 749 401 951 132 975 153 837 286 833 250 865 52 897 76 935 697 982 709 290 204 267 249 776 357 749 401 742 210 787 237 304 613 252 629 445 639 459 585 819 14 865 52 307 494 332 438 195 241 255 263 749 401 814 404 293 965 235 934 304 613 326 550 422 163 482 13...
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