CT61200

Tanya's Cable Plan Ledger

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

Caravans arrive at the windmill fields of Gusthaven with crates of routes, and Tanya the measurer must account for every last one. 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 <= 1280; 0 <= m <= 3840; 0 <= w <= 1000.

Example 1:

Input: 49 1176 2 43 725 13 33 574 20 34 549 8 31 733 17 24 573 7 8 564 27 42 448 20 38 215 6 25 688 44 47 955 23 38 181 14 26 738 6 29 189 17 29 946 19 27 822 6 40 817 8 19 532 9 11 460 12 43 880 14 22 975 5 32 164 29 38 328 36 41 212 26 29 94 12 46 769 6 14 88 28 37 445 13 49 434 2 37 882 12 15 2 25 26 140 5 8 355 8 23 332 9 30 965 45 49 213 27 40 611 38 40 575 36 45 419 17 18 123 22 41 806 4 28 73 18 42 714 12 36 882 5 48 528 36 37 716 7 10 938 12 20 432 8 48 80 11 44 322 2 48 268 23 49 913 31 36 372 11 16 237 3 13 661 19 37 456 8 39 448 10 36 827 14 29 552 27 29 553 16 24 606 7 49 654 12 19 56 25 32 371 24 40 891 18 37 253 29 48 920 28 43 318 3 8 336 29 37 162 17 30 188 11 37 297 17 47 991 21 39 190 29 40 686 29 39 702 27 47 817 42 48 563 15 44 364 3 44 609 16 28 36 13 43 732 23 24 754 11 38 9…
Output: 1171

Example 2:

Input: 156 1429 3 51 674 37 136 882 9 54 499 14 84 498 17 79 137 5 76 591 24 54 29 22 98 140 27 141 581 39 123 315 8 90 191 1 88 158 55 77 608 58 129 787 38 105 68 62 104 725 70 148 269 17 136 929 96 106 237 51 136 815 47 116 462 31 119 51 122 133 495 71 146 420 86 87 735 34 113 735 27 78 857 96 97 911 18 111 555 126 133 481 40 96 421 14 134 909 31 46 168 133 150 569 32 121 879 111 113 656 34 100 994 100 126 857 30 129 171 104 113 114 33 50 165 74 143 927 107 132 631 16 33 309 69 78 902 8 120 209 15 92 950 65 74 196 17 137 893 100 135 923 91 103 416 99 111 71 82 152 14 62 89 96 14 44 680 62 125 203 79 133 118 4 142 559 37 67 556 14 72 114 56 97 754 15 148 706 24 118 920 47 104 933 41 143 993 59 140 511 21 95 80 27 47 36 141 145 970 117 125 852 8 23 613 4 140 648 71 122 52 87 97 689 29 40 542 28 1…
Output: 11473

Example 3:

Input: 1086 2871 490 561 496 476 630 163 97 259 742 597 934 479 502 1048 157 464 751 539 221 806 591 265 405 27 637 858 794 529 612 550 291 390 624 682 878 606 457 901 846 186 936 431 527 808 823 265 475 55 129 847 518 449 638 436 284 695 477 472 1076 887 20 524 109 370 927 36 592 628 116 81 1080 9 5 981 210 783 786 304 245 794 253 336 911 970 635 646 534 137 700 486 579 763 227 308 347 624 849 858 901 28 146 959 566 768 673 456 823 229 531 1065 594 252 546 819 20 222 786 121 1047 323 834 969 133 446 1041 855 376 844 386 723 911 577 466 683 117 42 1069 11 430 471 3 507 686 485 134 220 973 112 302 648 495 550 930 568 975 117 726 811 24 294 822 56 790 917 976 428 737 2 541 930 614 106 371 753 668 730 722 451 781 777 619 1052 620 655 725 657 960 1045 735 182 295 451 188 1011 395 325 517 865 193 881 …
Output: 242633

Constraints:

1 <= n <= 1280; 0 <= m <= 3840; 0 <= w <= 1000.

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