CT33681

The Separate Camps of Scrollkeep

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Cressida the registry keeper watches over the archive halls of Scrollkeep's stores of corridors. A careful computation stands between order and chaos. Task: An undirected graph has n nodes and m edges. Print the number of connected components. Input format: First line: n and m. Next m lines: u v. Output format: Print the component count. Constraints: 1 <= n <= 1259; 0 <= m <= 2518; 1 <= u,v <= n.

Example 1:

Input: 832 826 521 588 16 711 351 670 605 823 55 396 278 791 95 575 170 469 7 408 157 605 106 166 136 718 429 826 228 399 538 689 547 561 28 159 515 578 295 629 164 614 199 372 460 628 346 386 423 523 534 783 102 718 310 580 7 810 486 764 576 580 56 773 184 421 117 433 227 259 144 706 256 417 294 750 120 733 430 663 460 651 106 119 439 526 28 818 686 781 466 821 166 303 182 504 132 777 519 640 477 797 11 97 141 672 343 698 27 108 403 771 378 645 115 206 97 590 629 706 110 290 224 340 320 437 25 445 721 827 215 259 228 759 157 521 505 534 166 612 57 424 77 674 65 603 261 369 498 613 10 311 236 559 35 555 70 542 566 573 335 354 408 446 152 644 436 507 527 725 359 479 654 692 143 366 192 373 86 812 319 694 251 287 435 557 399 565 342 490 34 365 360 462 10 741 563 667 291 776 549 803 304 352 17 336 4…
Output: 130

Example 2:

Input: 289 873 5 257 5 233 22 276 75 145 19 43 110 184 210 246 67 208 256 280 79 115 75 131 92 180 80 149 155 213 25 106 91 94 136 246 3 181 44 52 57 141 47 131 19 67 113 234 5 141 22 200 80 258 222 289 143 161 1 57 113 262 183 218 55 180 26 242 95 161 10 62 24 272 29 241 119 178 83 282 42 150 36 74 35 136 140 267 53 227 110 262 6 63 60 193 137 180 192 237 276 284 122 154 100 206 231 268 243 265 116 190 28 63 64 132 16 42 11 120 98 106 87 275 75 132 11 164 37 152 90 245 79 163 25 81 233 262 53 181 39 173 24 170 61 119 175 216 92 233 85 125 175 237 129 187 91 131 34 134 190 226 196 255 158 224 214 252 47 109 36 101 61 90 102 118 61 106 16 145 71 272 171 195 200 283 5 8 114 273 162 264 160 169 138 156 126 149 101 259 87 208 150 201 179 260 43 173 143 181 145 239 88 288 7 263 223 247 62 268 103 261 …
Output: 1

Example 3:

Input: 43 325 27 31 28 31 15 17 4 35 14 26 5 22 28 34 6 8 10 26 9 34 27 43 10 38 5 20 14 41 16 24 6 37 9 20 2 9 2 6 6 26 25 39 7 22 8 23 34 35 19 29 10 22 21 35 41 42 13 18 28 37 16 26 19 41 32 43 22 38 16 20 13 14 1 11 11 23 14 40 8 21 29 36 8 11 11 13 7 35 5 40 16 29 17 34 16 42 4 13 18 24 2 22 30 32 23 27 33 43 3 41 9 32 26 39 2 14 11 27 12 32 10 42 29 31 13 42 10 18 8 41 23 39 38 39 15 25 30 41 5 28 22 28 15 28 20 42 11 32 29 43 22 30 5 19 11 16 6 11 1 3 6 15 15 27 5 11 35 41 27 41 4 31 5 15 4 32 33 35 21 29 5 12 4 28 9 37 9 28 12 24 19 42 4 40 20 33 17 36 19 39 21 23 1 38 4 37 20 26 18 34 3 8 40 42 4 26 11 29 5 8 30 38 5 43 25 32 12 43 9 26 1 32 38 40 7 23 9 13 18 29 7 24 13 36 10 20 7 26 9 43 17 22 5 21 18 39 11 33 29 34 19 37 42 43 35 37 11 19 34 41 18 25 1 18 12 29 1 13 39 42 16 35 18 37 …
Output: 1

Constraints:

1 <= n <= 1259; 0 <= m <= 2518; 1 <= u,v <= n.

Loading...
Test Cases:No test cases
No test cases available.