QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #212048 | #6639. Disk Tree | ucup-team241# | WA | 3ms | 29660kb | C++14 | 2.0kb | 2023-10-13 06:41:49 | 2023-10-13 06:41:50 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 28532kb
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: 29660kb
input:
2 1 1 1 3 3 1
output:
YES 1 2 3 2
result:
ok answer = 1
Test #3:
score: 0
Accepted
time: 0ms
memory: 28192kb
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 10 0 20 0
result:
ok answer = 1
Test #4:
score: 0
Accepted
time: 3ms
memory: 28596kb
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 27 29 27 17 34 28 45 48 77 99 77 48 72 17 72 17 78 45 78 28 58 48 58 45 85 98 85 0 0 34 0 0 14 17 14
result:
ok answer = 1
Test #5:
score: -100
Wrong Answer
time: 0ms
memory: 28448kb
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 384 771 490 771 560 405 666 405 412 239 561 239 195 298 223 298 92 443 3 443 133 137 225 137 482 174 514 174 841 814 997 814 225 165 412 165 326 574 374 574 116 815 296 815 553 899 601 899 47 0 307 0 92 398 390 398 814 382 940 382 240 403 332 403 468 892 553 892 160 772 235 772 468 864 656 864 6...
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