CT29921

The Separate Camps at Greyfen

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Faye runs the foundry at the foggy moor of Greyfen. Today the books show a list of tunnels, and the numbers must be worked out before sundown. 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 <= 923; 0 <= m <= 1846; 1 <= u,v <= n.

Example 1:

Input: 906 125 636 805 201 702 231 648 411 865 285 355 99 554 672 775 390 391 98 364 715 742 445 704 415 689 22 602 521 825 634 779 590 830 632 800 338 568 107 804 433 483 211 270 145 849 443 834 192 496 567 872 428 672 7 756 152 359 448 522 230 785 242 888 132 240 237 852 26 763 150 201 152 904 217 502 128 536 281 284 279 359 437 519 403 523 719 802 55 358 105 506 377 625 138 143 177 844 130 726 209 609 534 799 554 676 594 628 184 740 253 363 533 889 421 567 579 737 10 693 235 903 100 400 555 663 22 623 461 694 438 454 153 614 592 884 291 384 552 764 55 828 106 397 77 376 657 792 258 553 9 230 337 779 400 466 550 756 13 845 129 806 314 835 552 878 530 887 104 478 62 123 15 679 146 159 135 258 155 806 754 804 527 806 546 622 24 145 43 454 728 839 682 800 223 699 112 215 851 864 4 633 26 126 366 6…
Output: 781

Example 2:

Input: 97 779 45 67 24 48 42 71 68 92 15 16 7 59 28 80 1 70 11 64 28 35 3 89 68 74 25 44 52 83 27 45 7 52 23 51 29 33 27 82 50 87 10 18 16 77 13 72 9 32 48 81 10 57 21 52 60 76 6 87 63 86 26 66 57 75 8 69 24 31 5 50 57 69 36 40 37 71 29 87 15 26 59 90 69 75 50 73 11 65 42 86 18 46 22 65 30 93 19 87 73 87 46 75 13 42 45 53 63 68 42 97 33 45 19 57 16 43 26 55 33 57 14 22 70 82 19 70 82 96 20 69 5 57 18 27 12 84 4 13 71 89 11 85 23 89 12 42 18 41 17 81 33 53 72 95 22 69 22 84 1 48 53 54 17 29 36 76 32 37 68 83 1 23 8 22 36 72 83 88 4 5 12 30 17 43 45 92 32 47 47 53 26 90 58 71 10 29 47 87 24 28 16 45 4 53 32 70 24 75 2 14 77 81 6 39 1 87 83 87 32 83 23 68 23 86 44 75 49 92 22 51 28 49 3 11 19 72 73 89 17 63 10 69 88 89 62 71 24 71 44 76 55 76 38 53 44 91 81 94 13 22 28 30 55 85 35 90 25 88 58 80 40 …
Output: 1

Example 3:

Input: 347 997 273 293 123 249 270 290 30 227 34 76 301 307 181 197 22 93 78 162 254 263 203 215 25 179 2 48 38 284 110 198 240 250 51 223 52 66 217 242 167 232 7 293 178 335 140 192 41 228 189 297 2 123 21 74 190 210 76 149 5 29 41 231 45 109 66 179 89 104 9 12 75 144 83 128 15 279 82 248 25 210 176 285 269 334 207 324 268 328 66 248 261 326 34 90 55 113 84 321 197 228 50 111 41 295 23 334 112 173 279 287 13 160 4 134 118 233 40 175 206 281 143 323 283 341 100 227 92 177 20 66 14 117 36 229 56 275 53 337 257 287 294 336 98 306 140 215 134 209 83 205 57 307 41 56 103 304 72 98 271 341 207 264 11 46 144 157 237 295 19 109 150 261 64 143 202 239 109 210 146 342 204 334 97 154 225 253 59 144 219 288 258 326 46 228 117 342 89 295 127 181 78 115 117 292 20 176 147 331 128 247 4 147 98 215 87 111 170 3…
Output: 1

Constraints:

1 <= n <= 923; 0 <= m <= 1846; 1 <= u,v <= n.

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