CT61231

The Cable Plan at Leatherwick

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

Before the gates of the tannery row of Leatherwick close for winter, Quin must finish the tunnels ledger - one figure at a time. Task: Print the minimum total weight of a spanning tree, or -1 if the graph is not connected. Input format: First line: n and m. Next m lines: u v w. Output format: Print the MST weight or -1. Constraints: 1 <= n <= 1662; 0 <= m <= 4986; 0 <= w <= 10.

Example 1:

Input: 196 4123 80 169 5 64 177 9 81 167 1 113 138 1 70 180 10 30 180 4 65 194 3 92 181 2 12 114 6 79 85 3 185 192 6 2 11 4 7 52 6 89 97 10 51 125 6 69 81 3 124 126 4 25 98 1 33 42 6 3 14 2 34 119 10 117 152 8 18 71 5 5 153 2 59 87 4 112 161 7 165 193 6 44 107 7 133 169 8 118 152 5 16 34 8 15 42 2 31 143 6 64 165 6 7 134 7 18 63 1 17 73 8 111 176 6 8 124 7 47 92 6 21 145 5 19 63 9 56 116 3 2 133 7 67 101 10 114 170 7 115 122 10 21 100 10 2 73 2 65 72 9 86 125 5 138 163 9 8 171 9 20 84 3 16 75 9 81 89 1 3 38 3 2 170 6 8 85 2 40 60 7 152 178 4 29 178 6 67 186 6 149 191 9 7 165 9 13 80 9 88 180 8 42 158 10 43 164 1 22 80 2 135 156 2 51 81 3 58 141 2 125 154 10 102 112 9 109 161 4 13 186 6 27 52 2 22 58 7 82 183 1 7 141 9 149 193 5 48 92 1 29 124 10 51 83 4 42 192 8 12 164 9 118 136 4 80 171 2 6 40 7…
Output: 202

Example 2:

Input: 1218 3079 380 583 1 193 274 9 526 1028 10 287 987 6 509 1061 10 108 115 3 805 936 2 114 1107 8 60 1003 3 1110 1193 9 538 881 7 198 664 3 406 634 2 232 384 3 176 381 6 70 389 10 31 503 9 2 1051 5 705 930 8 92 719 2 349 791 10 447 688 5 149 1106 2 52 801 7 286 564 4 503 898 4 42 93 8 305 822 7 396 683 4 645 692 10 591 1096 6 538 675 1 808 1112 6 556 1046 1 11 622 9 352 1145 10 817 1008 6 431 483 5 59 642 4 212 383 8 376 1200 4 1026 1088 3 219 474 1 96 408 6 796 858 4 447 937 4 605 1122 4 63 582 9 594 994 8 113 159 5 213 833 8 392 518 8 250 1209 2 413 1193 7 156 614 9 536 1022 8 675 863 6 639 974 8 94 804 1 22 443 9 50 832 9 730 784 1 395 938 3 50 1000 1 738 878 5 1034 1116 5 310 662 3 407 891 5 616 644 9 829 834 1 364 1185 8 20 570 1 144 1054 10 598 941 6 644 1179 4 205 442 10 182 1142 9 273…
Output: 3468

Example 3:

Input: 1031 3900 5 795 4 263 264 8 552 592 1 309 438 5 868 972 3 697 799 3 473 702 9 207 686 8 135 300 9 146 474 10 450 826 1 427 822 4 100 755 5 147 516 8 277 891 3 736 841 1 390 811 3 4 616 10 117 382 8 647 779 3 287 370 3 260 651 7 686 791 7 78 881 9 268 782 6 102 957 2 383 575 4 26 389 2 524 910 2 269 327 3 96 767 2 379 425 9 579 588 6 114 381 4 513 710 6 610 706 2 688 895 10 202 417 8 71 308 6 207 831 9 950 1017 7 604 657 3 354 550 4 158 330 10 255 385 7 528 864 10 135 678 1 157 1006 3 260 385 8 218 481 4 276 717 10 70 624 7 364 876 7 271 751 8 61 664 7 247 338 9 63 437 9 476 818 5 293 735 8 332 924 4 544 773 4 118 199 5 131 315 5 168 905 3 213 568 6 520 525 10 367 808 4 250 996 9 268 808 5 89 823 5 118 479 4 212 297 9 251 833 1 205 822 1 720 947 1 687 961 8 77 453 9 157 743 10 894 987 5 648…
Output: 2154

Constraints:

1 <= n <= 1662; 0 <= m <= 4986; 0 <= w <= 10.

Loading...
Test Cases:No test cases
No test cases available.
The Cable Plan at Leatherwick - MEDIUM Coding Problem | CodeTikki