QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #472598 | #4927. Bounded Spanning Tree | ZhaoZiLong | 0 | 195ms | 48100kb | C++14 | 1.8kb | 2024-07-11 17:28:14 | 2024-07-11 17:28:16 |
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
Wrong Answer
Test #1:
score: 4
Accepted
time: 195ms
memory: 48100kb
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:
YES 349855 7695 182447 407013 81351 468590 352396 411755 27783 495889 279148 126532 371490 46443 75037 440945 17872 376183 227217 256463 268704 93994 142674 221161 313215 423148 348655 110097 61558 138416 182869 460629 101134 233433 485321 293910 161637 31401 388370 43691 103888 258050 186588 285649...
result:
ok all is ok (1 test case)
Test #2:
score: -4
Wrong Answer
time: 194ms
memory: 47940kb
input:
1 300001 500000 146540 236321 23350 23350 110737 197257 49315 49315 87807 244200 2878 2878 27529 179675 90834 90834 39761 204225 209751 209751 175226 239307 945 945 25136 248902 243667 243667 215811 229229 48401 48401 152882 243088 63537 63537 136220 210273 244339 244339 31127 43815 196573 196573 31...
output:
YES 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 ...
result:
wrong answer p_i is not in [l_i;r_i] (test case 1)
Subtask #2:
score: 0
Wrong Answer
Test #22:
score: 0
Wrong Answer
time: 0ms
memory: 13888kb
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:
result:
wrong output format Unexpected end of file - token expected (test case 1)
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Wrong Answer
Test #45:
score: 0
Wrong Answer
time: 2ms
memory: 16072kb
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:
NO
result:
wrong answer jury found the answer but participant didn't (test case 1)
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
Subtask #6:
score: 0
Wrong Answer
Test #93:
score: 0
Wrong Answer
time: 106ms
memory: 14020kb
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:
result:
wrong output format Unexpected end of file - token expected (test case 1)
Subtask #7:
score: 0
Skipped
Dependency #3:
0%
Subtask #8:
score: 0
Wrong Answer
Test #143:
score: 0
Wrong Answer
time: 104ms
memory: 14024kb
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:
result:
wrong output format Unexpected end of file - token expected (test case 1)
Subtask #9:
score: 0
Skipped
Dependency #7:
0%
Subtask #10:
score: 0
Skipped
Dependency #1:
0%