QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#878493 | #8591. Shops | GuanYunchang | 0 | 1907ms | 90540kb | Python3 | 3.2kb | 2025-02-01 15:40:07 | 2025-02-01 15:40:07 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 7
Accepted
time: 10ms
memory: 8832kb
input:
3 3 1 2 3 2 3 1 1 3 2
output:
2 BBD
result:
ok inconveniences = 2
Test #2:
score: 7
Accepted
time: 8ms
memory: 8960kb
input:
5 6 3 2 3 4 2 1 5 3 9 1 3 5 1 4 2 2 3 1
output:
9 BBDDB
result:
ok inconveniences = 9
Test #3:
score: 0
Wrong Answer
time: 289ms
memory: 23276kb
input:
8 135737 1 4 763713071 3 7 45141437 4 8 618418466 6 8 91803956 7 5 972595945 5 2 751163228 2 8 9886315 4 3 106470622 8 6 949495949 1 2 885918825 4 6 322040168 7 6 754489330 4 8 618968328 5 3 996860159 3 6 210132897 3 4 591744987 8 7 447985622 2 4 4833956 5 7 610154418 2 5 410116873 2 5 912717336 8 7...
output:
47935 BBDDBDDD
result:
wrong answer your claimed answer is 47935, but the inconveniences of your plan is actually 19258
Subtask #2:
score: 0
Time Limit Exceeded
Test #11:
score: 0
Time Limit Exceeded
input:
500000 499999 1 2 776715136 2 3 406881694 3 4 265792290 4 5 507607272 5 6 182246639 6 7 997847597 7 8 164130256 8 9 278962226 9 10 411194641 10 11 363646402 11 12 672225656 12 13 494629089 13 14 717664153 14 15 121619271 15 16 476857704 16 17 301215244 17 18 810217743 18 19 850722975 19 20 10710274 ...
output:
999999116 BDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBDBD...
result:
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Time Limit Exceeded
Test #31:
score: 24
Accepted
time: 1907ms
memory: 90540kb
input:
366489 397001 2 127909 1 7 171229 1 8 158597 1 11 282213 1 14 356007 1 15 286102 1 16 93205 1 17 260111 1 18 138962 1 20 359938 1 29 223905 1 31 357684 1 32 259968 1 34 65205 1 37 200276 1 41 83195 1 43 159858 1 48 332277 1 50 320322 1 51 338467 1 53 262785 1 55 83815 1 56 173198 1 58 169473 1 63 19...
output:
1 BBDDDDBDBDDDDBBBDDDDDBDDBBBBDDBBDDBDDDDDDBDDDDDBDDDDDBBBBDDBDDBBBBDDDDDDBBBDBBBDDDBBBBDBBBBDDDDBBDDDDBDBBBDDBDBDBDDDDBDBBDBBDBDDDBDDDBBDDBBBDDDBBDBDBBDBBBDBDBDDBDBDBDBDBDDBBDBDDBDDDDBDDDBBBDDBBBBBBBBBBBBDDDDBDBDBDDDDBBBDDDDBDBDBDBDBBBBDDDDDBBBDDDDBDDDBDDBDDBBBBDDBDBDBDBDBDDBDBBDDBBBDDBBDBBDDBBDBDD...
result:
ok inconveniences = 1
Test #32:
score: 0
Time Limit Exceeded
input:
475552 488952 2 161263 1 3 312211 1 5 41910 1 6 421865 1 7 340911 1 9 419906 1 10 468773 1 13 17837 1 18 465833 1 19 297766 1 21 234125 1 26 218984 1 28 296050 1 29 411520 1 30 38207 1 33 370786 1 34 21620 1 35 467168 1 40 136766 1 42 353240 1 44 194443 1 46 119022 1 48 23233 1 54 380603 1 60 99339 ...
output:
result:
Subtask #5:
score: 0
Skipped
Dependency #1:
0%