CT37592

Last bridges of Mason

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the pine barrens of Needlepoint, Mason studies rows of bridges entries. One clean number will settle the guild's oldest argument. 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 <= 1306; 0 <= m <= 2612; 1 <= u,v <= n.

Example 1:

Input: 480 897 154 338 131 155 162 234 68 143 57 440 57 367 204 266 202 390 206 480 62 246 147 379 205 457 309 405 4 124 318 413 76 137 76 371 182 224 23 108 216 444 19 197 19 337 172 456 11 177 49 101 289 363 76 325 106 428 135 439 378 437 304 395 57 283 28 162 472 478 66 273 31 379 49 385 63 168 380 420 52 431 40 335 108 458 338 415 134 318 184 339 66 158 288 448 440 452 267 293 134 346 262 335 11 185 381 416 312 434 231 255 393 429 29 297 56 184 5 346 45 473 126 431 337 422 57 287 386 392 454 458 60 146 146 448 279 404 79 196 397 440 126 376 75 364 92 252 136 343 3 17 408 460 212 272 236 286 137 479 292 378 243 359 6 315 209 303 83 156 117 139 162 204 295 477 140 421 30 212 49 223 139 435 196 357 208 324 36 124 172 255 49 262 335 450 2 232 198 359 71 338 401 455 181 297 40 417 65 76 133 384 37…
Output: 12

Example 2:

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

Example 3:

Input: 216 988 7 125 140 203 200 205 88 136 15 59 18 212 97 145 102 208 67 152 18 127 10 97 57 72 10 38 99 154 92 178 80 198 116 123 118 166 99 115 166 214 30 172 185 213 70 108 64 174 17 192 76 166 146 169 33 116 27 110 12 95 2 58 95 116 3 185 46 103 98 212 51 66 198 214 88 109 40 177 30 177 88 186 70 183 10 188 41 62 79 190 11 127 3 12 56 184 63 156 84 114 39 139 19 182 91 126 51 201 138 197 158 183 45 59 73 108 30 125 47 134 45 202 96 131 4 48 17 86 25 171 35 205 49 172 57 61 80 91 87 128 30 162 46 141 18 26 9 195 73 82 53 74 21 187 6 94 75 214 58 179 71 155 166 208 80 168 132 145 49 201 12 27 46 152 43 62 62 146 151 178 27 76 49 174 81 180 54 109 10 114 144 196 110 157 63 140 77 212 12 31 15 72 17 130 56 118 88 99 12 202 16 57 29 35 150 158 105 156 105 122 122 182 110 111 159 166 179 205 141 …
Output: 1

Constraints:

1 <= n <= 1306; 0 <= m <= 2612; 1 <= u,v <= n.

Loading...
Test Cases:No test cases
No test cases available.
Last bridges of Mason - MEDIUM Coding Problem | CodeTikki