CT32093

Wamika's corridors Separate Camps

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Every season at the rookery of Crowhaven, someone must reconcile two mismatched ledgers. This year the task falls to Wamika, armed only with the corridors 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 <= 1335; 0 <= m <= 2670; 1 <= u,v <= n.

Example 1:

Input: 681 2019 89 156 504 558 324 412 113 231 169 261 438 587 119 339 343 626 411 681 250 605 311 565 54 309 333 604 292 677 498 639 2 278 252 482 79 386 105 486 59 96 340 524 12 386 26 391 221 512 319 610 270 475 217 339 392 635 137 158 73 194 218 542 81 307 170 201 193 551 60 262 221 443 67 396 60 301 96 544 200 385 72 462 127 425 61 70 157 296 339 441 191 321 197 392 80 157 34 658 11 494 285 360 135 215 124 370 315 452 80 188 477 571 80 86 335 535 470 572 264 563 148 421 6 319 455 546 434 466 599 629 43 242 184 222 410 412 272 526 514 623 495 557 481 655 280 387 29 410 144 562 107 663 313 381 120 523 195 250 274 559 594 650 549 569 226 269 250 650 327 556 107 152 177 417 20 446 181 516 389 419 141 305 169 572 173 300 257 345 152 223 379 548 323 429 44 674 413 632 88 242 135 139 469 584 646 64…
Output: 4

Example 2:

Input: 67 1469 7 41 39 48 2 50 1 58 28 31 8 58 25 38 14 46 50 56 32 54 29 44 39 43 47 66 44 51 23 55 22 39 8 33 9 51 54 57 24 28 10 58 8 63 24 35 4 6 36 48 47 58 9 31 8 16 6 34 5 37 9 19 42 47 9 13 15 67 52 60 4 38 3 29 35 44 4 7 37 63 43 49 34 46 6 7 29 52 21 64 4 54 33 44 40 57 2 62 17 44 45 54 3 41 43 45 56 65 23 46 49 66 35 49 11 66 49 53 1 50 29 38 10 15 2 12 21 65 2 16 15 34 22 30 48 53 24 66 1 66 8 21 11 38 50 53 42 54 19 62 40 64 11 36 27 33 6 40 53 55 7 48 35 62 8 15 13 63 9 14 17 60 29 32 18 59 52 56 7 32 19 33 3 59 10 35 14 38 6 23 21 24 31 50 36 46 2 40 17 39 2 65 28 32 15 41 29 43 5 47 20 63 16 30 22 66 28 30 13 38 9 11 11 41 7 60 50 51 46 65 6 13 44 59 37 65 17 33 24 26 8 44 11 12 6 39 16 32 21 49 24 29 25 51 44 47 46 58 25 56 20 43 5 46 1 52 3 19 10 47 13 37 1 23 28 42 26 49 41 62 …
Output: 1

Example 3:

Input: 154 1055 30 77 30 62 41 120 144 147 51 101 26 40 89 148 75 114 25 151 17 59 17 126 35 120 3 101 94 122 83 138 59 106 59 146 21 82 87 148 60 76 57 95 7 111 94 151 13 98 13 119 42 141 113 142 75 144 74 152 29 116 25 83 87 119 122 135 12 81 19 23 111 146 4 30 138 140 44 130 92 144 122 129 46 130 91 139 5 16 74 75 65 131 112 116 11 113 25 50 38 103 21 31 122 123 104 138 22 74 12 53 27 139 47 95 46 140 17 67 28 87 41 87 89 152 65 132 37 139 63 110 11 120 12 128 107 154 90 102 53 115 64 132 81 84 4 136 118 120 91 133 11 75 58 83 46 70 61 112 3 4 87 151 78 140 45 67 103 137 12 131 9 137 85 148 26 117 81 131 28 71 63 86 100 111 14 128 41 89 69 149 40 154 24 65 31 65 52 120 17 18 96 107 16 39 60 146 127 152 31 50 24 46 25 113 32 39 10 93 107 139 65 146 52 69 14 39 48 142 5 83 68 96 14 100 75 116 77…
Output: 1

Constraints:

1 <= n <= 1335; 0 <= m <= 2670; 1 <= u,v <= n.

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