CT49780

The Topaz Separate Camps

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the fen lights of Will-o-Wisp pays by the answer, and Sarla intends to earn it. First: the full register of tunnels. 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 <= 1482; 0 <= m <= 2964; 1 <= u,v <= n.

Example 1:

Input: 999 1335 717 777 496 544 237 486 205 964 72 796 244 371 85 871 97 726 412 515 58 213 17 456 331 361 726 784 461 745 70 332 254 376 383 403 346 462 748 750 12 124 733 795 716 901 173 190 171 976 402 517 795 861 356 781 469 654 613 991 722 960 38 63 449 686 30 946 824 947 876 913 252 391 731 970 298 824 45 536 10 58 491 750 41 651 98 474 99 430 331 925 392 717 66 584 547 767 589 905 760 786 141 992 260 960 389 795 45 313 729 800 861 992 69 588 186 587 6 309 11 36 66 830 10 415 159 953 11 333 162 951 451 664 324 560 246 992 332 573 715 847 888 890 440 576 617 666 150 248 581 606 80 341 591 749 107 481 647 653 415 925 808 818 637 957 255 519 6 763 15 926 525 832 593 920 580 664 24 328 257 533 176 467 421 930 3 852 726 946 571 634 340 371 139 157 634 734 435 567 62 838 650 866 292 947 196 347 4…
Output: 77

Example 2:

Input: 32 495 1 5 7 9 16 21 16 28 1 17 9 13 13 19 2 20 20 28 3 32 10 27 3 24 4 26 20 24 11 26 1 20 11 28 4 14 5 32 17 28 8 10 1 3 14 28 4 22 5 14 11 23 17 24 8 28 15 24 13 23 9 31 19 31 8 29 12 27 11 17 18 28 11 19 1 29 11 13 17 22 7 32 12 29 6 19 5 13 21 25 25 31 14 19 4 7 10 16 2 12 6 8 23 27 6 16 24 26 10 20 14 22 4 28 3 7 21 28 14 23 19 21 11 16 7 25 9 21 22 24 19 29 8 26 1 19 5 8 22 31 21 29 15 17 5 30 12 32 16 31 27 29 13 31 16 24 15 26 3 11 9 30 18 19 11 12 17 27 6 29 11 25 4 5 1 14 19 30 23 29 12 26 3 10 12 28 9 25 4 25 2 5 15 25 2 25 10 25 7 21 7 14 3 12 7 28 8 27 2 4 3 26 14 30 8 16 7 19 15 29 14 25 6 25 2 9 6 17 24 25 6 27 2 16 25 29 7 22 8 24 13 14 10 24 23 31 7 24 26 30 3 6 1 8 13 28 4 16 8 23 1 6 12 23 3 8 18 24 24 28 4 15 20 22 28 30 4 12 4 19 1 12 1 26 7 20 15 16 10 23 16 20 20 29…
Output: 1

Example 3:

Input: 761 1109 37 261 482 492 382 529 67 137 537 711 118 720 192 531 417 458 201 714 73 200 334 760 178 344 626 744 130 483 597 678 184 354 303 404 69 237 566 622 134 253 43 216 295 724 322 462 600 614 363 653 176 464 257 558 219 741 495 547 320 621 103 205 665 687 559 708 332 411 251 433 315 718 362 651 374 423 205 506 495 677 220 502 147 240 160 341 215 456 426 613 468 681 70 166 71 150 16 198 241 493 256 286 250 330 302 565 103 585 7 754 14 310 256 455 365 635 75 257 187 418 578 731 43 60 351 468 349 681 96 102 366 479 228 435 480 530 624 629 287 327 175 225 416 540 78 204 381 554 110 193 185 629 468 555 636 742 231 260 360 725 152 559 161 692 250 693 146 370 135 620 198 297 452 515 406 587 224 685 468 648 296 672 668 681 74 369 2 544 11 642 181 347 128 217 403 689 168 391 281 397 261 428 106…
Output: 40

Constraints:

1 <= n <= 1482; 0 <= m <= 2964; 1 <= u,v <= n.

Loading...
Test Cases:No test cases
No test cases available.
The Topaz Separate Camps - MEDIUM Coding Problem | CodeTikki