CT29538

Faye's tunnels Reckoning

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Every season at the ribbon falls of Cascade Vale, someone must audit the season's records. This year the task falls to Faye, armed only with the tunnels register. 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 <= 797; 0 <= m <= 1594; 1 <= u,v <= n.

Example 1:

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

Example 2:

Input: 508 231 44 243 88 121 103 369 250 368 166 276 13 489 34 93 57 497 191 496 310 503 10 258 45 105 180 424 78 486 59 491 227 377 39 248 72 151 143 356 359 384 166 210 109 160 195 261 192 417 107 266 55 321 325 470 25 198 1 271 165 430 236 435 185 454 3 50 57 463 157 282 368 441 485 497 107 352 210 459 426 499 197 416 185 506 48 376 104 142 408 481 20 255 100 232 223 401 265 373 351 462 64 179 198 237 88 211 26 381 196 432 366 476 241 506 179 435 443 486 317 378 270 352 303 473 203 232 105 450 179 357 25 178 206 244 218 299 481 495 124 278 7 184 204 356 28 51 114 154 159 389 87 130 232 247 8 122 292 424 17 78 65 190 291 340 328 380 187 288 14 71 17 386 56 508 311 454 467 474 175 338 241 372 147 218 99 332 165 298 403 494 149 306 111 503 298 323 75 502 55 68 58 326 241 353 311 435 57 445 237 25…
Output: 277

Example 3:

Input: 404 1531 131 132 26 243 95 345 166 311 81 330 158 203 85 387 118 131 183 364 86 91 42 377 131 387 135 319 74 112 162 384 104 247 242 400 66 287 86 144 144 278 80 302 291 362 198 360 2 303 139 144 38 209 68 389 151 209 80 211 218 371 182 386 75 235 7 252 186 358 15 282 103 245 112 185 117 248 32 301 68 131 64 105 80 203 64 171 112 305 153 219 156 269 44 327 328 395 39 254 318 372 136 294 24 278 73 271 70 192 120 315 8 272 349 350 31 344 97 254 235 238 30 389 244 254 88 354 59 247 156 281 73 276 122 337 28 39 63 81 67 137 19 172 209 246 20 215 252 390 72 320 95 283 152 193 188 230 224 267 96 176 31 107 38 310 18 277 75 264 20 172 122 210 20 303 303 332 299 318 176 365 37 187 310 359 68 344 72 238 182 371 241 318 227 369 72 310 106 167 10 209 205 245 20 205 98 113 4 170 25 148 167 304 91 296 …
Output: 2

Constraints:

1 <= n <= 797; 0 <= m <= 1594; 1 <= u,v <= n.

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