CT64839

Esha's roads Cable Plan

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

Every season at the lantern district of Glowfen, someone must prepare the expedition manifest. This year the task falls to Esha, armed only with the roads register. 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 <= 1868; 0 <= m <= 5604; 0 <= w <= 10.

Example 1:

Input: 137 1826 47 63 4 20 42 9 93 109 7 49 110 5 58 130 7 11 19 10 76 88 7 8 79 10 21 70 7 87 105 10 120 130 5 28 87 8 26 111 7 132 136 5 53 136 7 3 113 10 56 107 4 2 86 4 26 93 1 110 135 8 1 125 3 6 120 7 9 42 1 37 121 1 20 91 6 29 67 9 89 134 2 4 45 3 14 55 6 31 87 10 18 137 1 56 135 8 95 111 1 7 113 10 29 77 2 1 67 2 18 123 10 8 85 9 106 115 5 45 97 5 19 61 4 57 107 9 15 103 2 61 119 1 45 49 3 5 124 10 79 89 5 77 130 9 73 116 7 54 78 4 102 119 5 9 56 1 90 122 4 44 83 7 7 65 7 65 70 7 9 29 6 86 136 4 35 111 5 3 134 8 42 79 8 69 78 6 42 66 4 41 100 7 26 112 2 47 114 10 55 124 9 30 82 5 48 58 3 10 105 10 5 52 9 31 46 6 113 121 1 7 133 6 45 66 2 15 46 2 34 124 5 2 115 3 83 124 6 45 67 3 9 97 8 34 77 6 98 127 4 25 98 2 18 83 7 45 74 9 33 63 9 27 49 2 81 88 6 74 124 1 15 69 7 44 48 5 28 68 3 37 118…
Output: 145

Example 2:

Input: 1050 4147 59 860 5 132 994 5 109 670 3 354 951 6 283 630 9 137 912 7 434 1028 6 136 822 7 263 761 4 46 693 6 916 953 3 162 584 6 897 966 8 125 864 7 750 893 7 808 867 8 97 825 2 572 875 1 123 291 5 722 726 4 288 306 7 81 634 7 43 932 6 87 970 5 68 605 9 28 270 7 757 877 2 200 391 2 391 1034 8 461 779 1 1 451 7 5 35 2 320 767 4 494 704 6 171 654 2 625 806 4 976 1007 1 463 617 9 181 404 9 246 884 10 150 184 5 156 756 6 60 383 10 218 387 8 321 498 4 88 499 4 617 874 5 446 738 5 281 862 5 596 799 7 40 656 10 194 342 5 717 796 10 161 196 9 26 112 4 46 966 6 246 653 7 108 318 7 551 781 5 163 852 6 640 696 8 457 480 6 485 830 9 305 421 9 116 168 3 514 604 2 249 526 9 182 427 5 279 489 2 528 696 10 700 769 3 444 735 5 152 664 5 168 296 6 170 707 9 696 704 9 46 785 8 287 678 4 780 1036 3 303 563 2 …
Output: 2130

Example 3:

Input: 1622 3631 579 1042 5 210 1592 1 366 565 5 315 1001 2 605 1303 1 1101 1346 8 11 614 7 11 124 5 370 1581 4 486 808 3 219 286 8 96 764 7 185 619 7 85 1208 4 518 872 5 316 928 3 229 1337 9 317 502 10 210 1324 4 303 1481 8 799 1319 8 118 226 8 494 712 1 5 934 1 441 1100 6 648 1602 6 562 1556 7 359 402 10 309 532 7 1033 1314 2 641 682 2 528 588 1 379 1018 5 515 1443 9 98 1390 4 89 512 10 664 1125 3 431 1481 4 202 551 9 94 1243 8 670 984 1 28 40 10 527 852 2 543 933 2 160 368 8 1121 1377 4 103 395 7 171 291 10 837 1243 6 313 1446 1 420 515 3 28 636 10 1070 1506 9 1502 1524 10 197 1432 2 958 1389 6 1103 1391 9 1433 1494 9 70 997 1 282 1241 4 61 1130 1 491 998 5 830 917 6 384 1221 9 291 786 1 299 1486 9 1140 1297 6 347 1017 8 578 1208 4 953 1389 9 10 1498 4 43 736 5 838 1295 6 335 1092 4 483 1555 9…
Output: -1

Constraints:

1 <= n <= 1868; 0 <= m <= 5604; 0 <= w <= 10.

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