CT33971

Hugo's Separate Camps Ledger

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Before the gates of the honey farms of Buzzwell close for winter, Hugo must finish the roads ledger - one figure at a time. 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 <= 1101; 0 <= m <= 2202; 1 <= u,v <= n.

Example 1:

Input: 729 1873 294 478 507 650 230 293 450 489 13 236 307 450 53 657 65 657 507 553 468 548 101 358 102 530 596 611 256 658 113 712 365 388 525 528 252 442 36 180 278 623 512 534 556 683 219 521 79 283 543 625 105 191 294 662 300 414 192 238 229 257 5 198 307 667 169 299 332 516 55 151 53 196 503 683 134 203 443 488 489 717 256 333 427 638 358 657 359 479 301 570 78 239 144 446 228 670 246 453 305 639 184 251 21 141 371 712 175 615 56 261 71 647 40 610 128 416 395 626 248 618 146 455 39 425 320 455 92 656 202 457 68 616 501 703 425 642 36 241 196 237 135 642 62 108 370 540 151 672 394 475 80 342 174 718 118 205 73 313 639 650 691 713 297 520 61 564 62 264 563 597 143 248 455 589 229 665 189 584 125 150 64 79 8 59 295 303 258 717 125 622 85 552 109 191 272 343 179 432 45 407 162 689 456 466 192 5…
Output: 3

Example 2:

Input: 157 1680 7 111 134 138 62 96 24 67 18 76 80 102 64 103 36 69 16 52 9 126 37 111 3 35 11 150 3 40 92 114 27 51 1 112 9 120 18 114 35 127 89 112 52 81 42 129 36 97 58 79 53 152 12 109 48 140 104 152 58 65 31 122 85 153 83 105 66 97 20 95 16 124 61 90 76 102 45 97 22 148 148 153 10 30 43 92 115 139 6 41 18 105 15 143 61 148 115 136 7 79 18 118 1 44 79 113 77 147 51 99 107 113 66 80 28 140 58 68 11 112 82 135 32 91 17 27 34 65 37 99 1 132 50 87 82 157 123 133 8 102 6 122 27 68 33 136 4 7 47 88 28 126 126 134 26 119 54 140 41 100 13 84 75 112 93 148 3 63 37 108 42 148 59 109 64 154 24 146 116 153 87 131 25 103 103 113 138 142 37 154 42 87 11 12 103 148 33 154 106 115 47 126 5 81 2 68 64 72 28 99 14 97 132 133 51 156 31 45 69 90 99 101 70 74 108 152 26 88 47 85 62 66 6 127 55 133 90 132 125 146 …
Output: 1

Example 3:

Input: 122 2121 62 81 37 81 18 67 27 62 98 108 90 101 60 117 72 102 57 59 66 78 3 60 9 75 10 27 69 118 14 120 46 101 19 44 59 95 38 40 85 101 66 108 48 75 3 20 31 87 80 109 9 89 20 103 14 32 67 91 5 56 12 32 10 119 108 118 64 65 47 81 23 104 105 116 108 109 35 40 23 34 46 106 30 104 95 111 40 77 2 23 10 41 79 122 13 99 11 56 9 121 13 20 9 97 86 120 2 22 98 116 2 81 29 102 90 120 43 113 11 27 44 72 17 118 38 77 53 65 45 90 55 115 37 73 87 105 42 105 29 122 38 59 6 19 69 77 28 50 15 108 54 105 21 80 18 38 61 98 20 66 4 76 1 53 20 43 19 112 100 103 8 25 15 75 53 101 37 109 44 71 48 83 4 25 80 102 70 80 29 66 16 59 12 76 5 105 95 107 60 77 27 29 7 43 48 99 60 72 46 110 1 81 25 90 31 52 37 55 106 113 105 114 14 64 13 103 104 114 23 53 33 113 82 92 19 49 53 89 49 114 77 122 39 77 5 57 40 122 53 54 27 3…
Output: 1

Constraints:

1 <= n <= 1101; 0 <= m <= 2202; 1 <= u,v <= n.

Loading...
Test Cases:No test cases
No test cases available.
Hugo's Separate Camps Ledger - MEDIUM Coding Problem | CodeTikki