QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #876969 | #7861. Inverse Topological Sort | ucup-team1494 | TL | 206ms | 12280kb | C++20 | 3.8kb | 2025-01-31 16:04:21 | 2025-01-31 16:04:21 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 5876kb
input:
3 1 2 3 1 2 3
output:
Yes 3 1 2 1 3 2 3
result:
ok n=3
Test #2:
score: 0
Accepted
time: 0ms
memory: 5736kb
input:
3 1 2 3 3 2 1
output:
Yes 0
result:
ok n=3
Test #3:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
3 3 2 1 1 2 3
output:
No
result:
ok n=3
Test #4:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
10 6 8 9 4 1 3 7 5 10 2 8 6 9 10 4 7 5 3 2 1
output:
Yes 33 3 2 4 1 4 2 4 3 4 5 4 7 5 2 6 1 6 2 6 3 6 4 6 5 6 7 6 9 6 10 7 2 7 5 8 1 8 2 8 3 8 4 8 5 8 7 8 9 8 10 9 1 9 2 9 3 9 4 9 5 9 7 9 10 10 2
result:
ok n=10
Test #5:
score: 0
Accepted
time: 0ms
memory: 5868kb
input:
10 4 2 5 6 7 8 9 1 3 10 8 7 9 6 5 4 2 1 10 3
output:
Yes 26 1 3 1 10 2 1 2 3 2 10 4 1 4 2 4 3 4 10 5 1 5 3 5 10 6 1 6 3 6 10 7 1 7 3 7 9 7 10 8 1 8 3 8 9 8 10 9 1 9 3 9 10
result:
ok n=10
Test #6:
score: 0
Accepted
time: 3ms
memory: 5992kb
input:
100 5 16 25 26 36 28 42 46 2 38 48 23 29 30 31 12 40 51 58 64 71 75 83 14 68 74 79 84 86 88 56 6 39 92 9 11 4 47 3 13 15 8 49 54 32 45 61 33 66 72 80 24 69 89 21 82 93 94 27 76 90 10 18 77 78 57 95 7 50 81 96 97 35 19 44 20 55 63 34 60 67 22 73 52 87 91 65 43 85 37 62 53 98 1 41 70 99 59 100 17 92 8...
output:
Yes 4146 1 41 1 70 2 1 2 3 2 7 2 8 2 10 2 13 2 15 2 17 2 18 2 19 2 20 2 21 2 22 2 27 2 33 2 34 2 35 2 37 2 40 2 41 2 43 2 44 2 45 2 47 2 50 2 52 2 53 2 55 2 57 2 59 2 60 2 62 2 63 2 65 2 67 2 70 2 72 2 73 2 76 2 77 2 78 2 81 2 85 2 86 2 87 2 90 2 91 2 94 2 95 2 96 2 98 2 99 2 100 3 1 3 17 3 20 3 37 ...
result:
ok n=100
Test #7:
score: 0
Accepted
time: 206ms
memory: 12280kb
input:
1000 11 2 29 50 53 54 155 162 211 213 223 240 270 226 243 276 288 304 315 341 249 358 359 381 178 402 51 417 434 163 459 466 471 498 327 464 518 527 549 559 113 581 589 60 347 594 504 593 598 603 607 610 619 648 649 658 681 684 416 686 153 712 575 741 349 382 759 322 17 289 763 764 774 718 777 9 637...
output:
Yes 456428 1 761 1 964 2 1 2 3 2 4 2 5 2 6 2 7 2 8 2 12 2 13 2 18 2 19 2 20 2 21 2 23 2 24 2 25 2 26 2 27 2 28 2 30 2 32 2 33 2 34 2 35 2 36 2 37 2 39 2 40 2 42 2 43 2 45 2 46 2 47 2 48 2 49 2 52 2 55 2 56 2 57 2 58 2 61 2 62 2 63 2 64 2 65 2 66 2 67 2 69 2 70 2 71 2 72 2 73 2 74 2 75 2 76 2 77 2 78...
result:
ok n=1000
Test #8:
score: -100
Time Limit Exceeded
input:
100000 1 5 10 12 13 14 16 17 18 19 21 27 28 33 37 40 41 44 45 49 50 51 52 54 57 58 62 64 67 69 71 72 74 75 77 78 79 80 84 89 93 95 96 100 102 104 111 113 115 117 118 119 120 121 122 123 124 126 127 129 132 135 136 138 139 142 144 150 151 152 153 154 155 156 164 166 167 170 174 177 178 180 181 182 18...