CT34435

The Solar Separate Camps

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Caravans arrive at the seal rocks of Barking Cove with crates of corridors, and Sage the measurer must account for every last one. 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 <= 536; 0 <= m <= 1072; 1 <= u,v <= n.

Example 1:

Input: 395 716 118 155 127 236 40 298 41 196 8 377 11 343 49 311 164 215 199 358 307 343 43 122 255 269 357 361 199 272 245 288 266 295 82 97 54 158 375 380 52 89 236 389 41 115 143 212 114 356 9 94 232 265 122 150 188 252 208 354 41 382 191 318 284 294 78 304 110 249 178 374 321 339 82 273 142 178 338 369 149 363 199 216 109 299 184 241 5 116 124 216 60 359 75 374 357 382 200 238 192 274 220 372 192 244 12 167 302 376 95 118 65 352 46 364 368 369 58 387 151 385 255 388 73 370 77 269 59 175 317 350 245 393 92 224 25 140 31 221 261 288 4 26 94 165 36 245 161 351 207 270 264 318 50 376 283 346 279 379 84 343 256 289 101 328 160 250 356 372 80 211 44 365 170 353 8 386 234 280 90 259 9 29 321 340 58 128 131 178 107 288 231 282 35 75 186 390 23 221 41 117 32 169 11 47 162 288 87 103 79 281 177 343 1 3…
Output: 7

Example 2:

Input: 134 840 27 67 27 60 74 113 40 101 37 77 1 109 96 102 51 69 4 37 20 32 41 50 68 107 51 105 30 34 51 124 45 85 88 100 70 71 11 73 11 45 42 66 18 133 39 65 27 38 54 117 94 120 40 116 54 113 65 86 60 95 122 130 9 113 42 109 37 99 81 86 96 125 34 92 68 124 36 121 10 39 42 95 56 133 5 57 42 65 16 88 2 116 13 36 43 56 3 41 78 114 35 102 104 109 58 90 67 72 40 112 32 97 85 110 1 3 1 40 79 96 43 46 45 65 78 125 65 104 11 106 5 83 123 126 29 113 85 102 89 107 17 51 67 118 40 66 44 116 15 114 57 65 34 115 102 131 18 69 9 102 56 83 28 53 67 134 19 96 94 111 39 100 57 85 36 37 91 111 14 93 52 124 24 133 37 115 19 74 71 120 11 84 37 100 64 109 16 123 21 66 76 96 70 124 7 109 11 67 5 58 45 130 21 72 37 92 63 89 63 132 60 119 10 16 17 87 55 73 12 22 59 68 76 105 28 102 75 104 17 130 60 94 30 91 73 85 108 …
Output: 1

Example 3:

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

Constraints:

1 <= n <= 536; 0 <= m <= 1072; 1 <= u,v <= n.

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