CT52367

Last tunnels of Jatin

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the island market of Coralcove; Jatin weighs the day's tunnels manifests and starts the calculations. 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 <= 2056; 0 <= m <= 4112; 1 <= u,v <= n.

Example 1:

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

Example 2:

Input: 1744 3523 527 1545 607 1638 96 1710 536 1180 129 1677 474 1263 386 1715 793 1552 977 1383 180 1611 513 1370 776 989 550 1337 1255 1345 561 723 1243 1385 499 967 380 640 923 1025 686 1444 884 1059 182 1170 122 200 813 1424 137 811 906 1117 1119 1414 339 1030 628 1693 283 759 405 1699 606 1149 240 1713 474 1317 6 850 350 904 113 1163 772 1303 441 461 692 1204 545 671 810 1176 687 1666 664 1461 453 1293 598 717 755 1451 475 1430 391 1506 654 1289 130 1564 476 1621 641 1139 68 337 890 943 987 1061 287 454 547 988 10 590 573 1429 319 560 225 623 461 1563 1037 1451 596 1021 371 1596 1122 1458 939 1376 112 1721 450 764 586 794 417 783 1085 1638 1173 1443 223 511 16 224 1579 1687 1375 1563 306 985 866 1128 1304 1528 58 1431 923 1246 1498 1737 960 990 924 968 1061 1210 201 1172 43 1258 386 732 960 …
Output: 34

Example 3:

Input: 818 2923 360 570 76 127 369 779 116 534 65 274 255 529 529 618 333 420 3 5 128 149 123 238 394 728 216 387 507 654 525 745 61 459 667 684 5 41 748 812 143 411 230 407 623 681 284 798 372 605 189 657 129 348 12 588 121 541 102 773 555 691 446 684 534 647 479 780 217 285 490 706 308 572 712 726 496 818 97 125 275 490 410 780 254 502 79 503 276 477 129 703 122 376 338 467 304 517 566 704 86 101 169 318 347 350 175 721 49 509 537 571 31 627 206 537 530 768 453 502 91 99 269 639 421 635 21 119 21 713 605 611 523 591 491 707 18 122 649 734 358 428 729 759 279 684 325 502 782 792 759 760 14 102 655 796 638 738 697 702 68 416 148 730 33 138 407 701 191 571 284 674 562 704 407 704 370 415 88 326 413 433 221 470 316 673 348 798 210 366 200 801 78 578 246 673 18 287 615 796 156 530 129 130 236 463 10…
Output: 2

Constraints:

1 <= n <= 2056; 0 <= m <= 4112; 1 <= u,v <= n.

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