QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#534670#4927. Bounded Spanning Treeegypt_ioi2024_02#0 234ms67696kbC++201016b2024-08-27 15:07:062024-08-27 15:07:07

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 234ms
memory: 67696kb

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
214870 153358 404031 368471 164064 303349 247786 184379 451758 464405 453470 296855 76122 35161 128470 122060 230238 52427 491865 193205 255545 430064 276388 403953 431132 72198 359343 442791 439387 344751 186176 63282 193214 121472 388041 78628 164284 377153 473468 307880 10416 462752 62934 320...

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: 3504kb

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:

YES
2 5 4 1 10 3 6 9 2 7 

result:

wrong answer p_i is not in [l_i;r_i] (test case 1)

Subtask #3:

score: 0
Skipped

Dependency #2:

0%

Subtask #4:

score: 0
Wrong Answer

Test #45:

score: 0
Wrong Answer
time: 1ms
memory: 3932kb

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:

YES
30 84 55 94 198 202 220 280 473 199 275 475 135 58 376 39 425 183 118 133 149 231 491 315 43 56 96 81 422 47 297 492 21 45 213 302 164 432 289 200 165 272 41 420 12 217 287 442 105 197 177 253 424 112 157 226 303 237 274 277 259 82 178 314 192 500 356 172 319 80 392 263 286 382 348 110 161 313 4...

result:

wrong answer p_i is not in [l_i;r_i] (test case 1)

Subtask #5:

score: 0
Skipped

Dependency #4:

0%

Subtask #6:

score: 0
Runtime Error

Test #93:

score: 0
Runtime Error

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:


Subtask #7:

score: 0
Skipped

Dependency #3:

0%

Subtask #8:

score: 0
Runtime Error

Test #143:

score: 0
Runtime Error

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:

YES
267 76 92 70 118 22 147 93 36 89 228 45 171 176 77 114 108 188 86 135 210 33 204 30 19 109 21 38 59 218 67 177 34 82 192 80 42 124 153 149 202 148 44 138 185 197 10 20 156 142 165 201 98 160 64 168 162 163 15 196 123 58 205 167 150 213 48 151 49 184 225 91 190 78 200 72 65 97 25 132 159 229 154 ...

result:


Subtask #9:

score: 0
Skipped

Dependency #7:

0%

Subtask #10:

score: 0
Skipped

Dependency #1:

0%