QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #54167 | #4927. Bounded Spanning Tree | larryzhong | 0 | 20ms | 3712kb | C++17 | 3.0kb | 2022-10-07 10:43:53 | 2022-10-07 10:43:56 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Memory Limit Exceeded
Test #1:
score: 0
Memory Limit Exceeded
input:
1 500001 500000 254401 281557 349855 349855 181158 183050 7695 7695 168649 393239 182447 182447 275491 426002 407013 407013 412840 430191 81351 81351 180729 474744 468590 468590 167128 233022 352396 352396 56562 410078 411755 411755 28611 28934 27783 27783 250615 303207 495889 495889 348947 377767 2...
output:
result:
Subtask #2:
score: 0
Wrong Answer
Test #22:
score: 0
Wrong Answer
time: 0ms
memory: 3544kb
input:
1 7 10 1 5 1 3 3 6 8 10 4 6 5 6 1 7 1 2 3 5 1 1 2 4 6 6 1 7 10 10 6 7 8 10 1 7 6 8 3 5 1 4
output:
3 8 5 2 1 6 10 9 7 4
result:
wrong answer Token parameter [name=Yes/No] equals to "3", doesn't correspond to pattern "[yY][eE][sS]|[nN][oO]" (test case 1)
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Wrong Answer
Test #45:
score: 0
Wrong Answer
time: 20ms
memory: 3712kb
input:
1 501 500 127 170 433 434 26 98 284 285 179 379 82 82 136 270 253 254 100 391 474 476 175 393 170 171 247 311 223 225 32 318 270 270 87 434 294 294 335 417 308 310 249 356 292 294 327 331 42 44 325 498 334 336 73 133 260 262 276 394 493 495 74 289 330 331 29 83 244 245 7 486 482 483 115 368 90 90 22...
output:
433 284 82 254 476 170 223 270 294 308 293 44 336 261 493 331 244 482 90 277 32 115 416 106 240 386 479 444 125 500 487 305 399 86 474 408 455 458 15 87 41 141 24 128 33 383 29 342 333 381 448 214 346 365 2 25 397 13 499 357 326 310 391 139 366 488 449 361 498 285 436 153 481 412 83 328 84 187 373 6...
result:
wrong answer Token parameter [name=Yes/No] equals to "433", doesn't correspond to pattern "[yY][eE][sS]|[nN][oO]" (test case 1)
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
Subtask #6:
score: 0
Time Limit Exceeded
Test #93:
score: 0
Time Limit Exceeded
input:
1000 500 500 100 331 2 8 162 182 272 276 133 415 393 397 144 176 499 500 64 273 47 55 37 463 424 428 96 481 127 127 115 341 333 336 79 95 246 248 266 473 473 476 117 140 113 120 112 309 323 330 251 438 39 45 22 339 275 285 83 474 264 266 185 212 282 291 377 425 25 31 42 436 351 357 35 69 173 182 159...
output:
2 272 393 499 50 424 127 333 246 473 114 323 39 275 266 282 25 351 173 485 147 10 9 346 359 267 18 81 343 371 194 480 454 401 213 86 482 111 276 192 153 487 124 224 155 268 356 367 315 394 29 103 444 396 284 94 202 335 181 240 379 198 303 362 215 95 372 19 300 115 373 347 165 399 82 311 38 363 241 1...
result:
Subtask #7:
score: 0
Skipped
Dependency #3:
0%
Subtask #8:
score: 0
Time Limit Exceeded
Test #143:
score: 0
Time Limit Exceeded
input:
1000 251 500 1 2 280 287 2 3 251 256 3 4 249 249 4 5 252 253 5 6 252 256 6 7 250 250 7 8 254 261 8 9 245 256 9 10 123 127 10 11 45 49 11 12 122 128 12 13 164 167 13 14 153 156 14 15 210 217 15 16 53 64 16 17 205 208 17 18 136 149 18 19 132 135 19 20 24 27 20 21 45 51 21 22 21 30 22 23 5 7 23 24 178 ...
output:
280 251 249 252 253 250 254 256 123 45 122 164 153 210 53 205 136 132 24 46 21 5 179 83 78 207 187 103 216 20 180 107 23 29 121 7 221 26 126 206 140 32 217 35 11 183 149 61 68 143 166 202 162 144 90 159 128 62 28 163 85 110 130 54 76 167 31 145 95 1 105 75 141 172 188 3 9 69 211 36 190 34 124 102 20...
result:
Subtask #9:
score: 0
Skipped
Dependency #7:
0%
Subtask #10:
score: 0
Skipped
Dependency #1:
0%