CT62111

Keeper's Beryl Ledger

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

It is audit day at the temple city of Sunspire. Keeper spreads the corridors records across the table and picks up a sharp pencil. 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 <= 2139; 0 <= m <= 6417; 0 <= w <= 10.

Example 1:

Input: 1124 3267 288 296 8 647 652 5 263 810 6 142 203 5 66 183 4 132 817 7 89 770 3 247 907 7 68 797 1 137 498 2 145 280 1 100 807 6 418 425 9 191 873 10 264 523 2 559 1098 7 165 264 5 53 486 7 379 1095 5 635 666 6 13 94 7 163 869 3 8 951 9 711 961 10 24 487 6 166 209 1 123 257 5 58 929 10 203 401 2 16 65 2 571 1094 4 414 774 6 711 935 7 178 614 1 314 1103 2 843 1066 5 80 1098 2 117 670 7 393 818 8 161 253 8 447 766 2 77 368 7 412 922 10 305 656 10 68 1018 4 402 685 2 308 712 1 313 592 9 633 912 3 33 347 8 811 1107 10 471 659 10 472 612 4 647 772 9 104 803 8 750 1091 4 190 904 3 815 1044 4 106 338 8 706 982 8 369 793 9 970 979 4 509 1064 4 367 400 2 9 267 6 111 207 8 352 921 7 292 778 8 46 510 5 170 928 6 534 1006 6 718 1072 5 451 623 3 194 748 10 62 670 4 708 1089 1 414 452 8 10 478 3 242 511 3…
Output: 2892

Example 2:

Input: 1966 2169 730 1797 8 888 1005 2 995 1052 7 453 1021 5 130 403 4 30 661 2 386 1221 9 1658 1955 7 1129 1256 9 822 1472 6 1818 1848 7 1154 1890 4 989 1525 1 70 526 10 501 1372 1 730 1679 3 721 881 7 520 1265 9 705 1730 3 376 1619 9 173 759 5 97 300 9 455 1196 10 1179 1426 7 616 1078 3 273 1323 2 612 1394 4 1461 1647 4 973 1895 1 968 1017 8 37 1769 8 486 1145 4 56 1155 10 1631 1836 2 1547 1634 7 965 1033 7 85 1931 3 585 1277 9 118 349 4 1128 1467 1 961 1188 2 187 748 7 1474 1737 10 259 327 6 399 825 3 526 1113 4 47 1799 4 1056 1813 10 910 1824 9 70 1802 5 815 1965 2 265 836 5 1114 1381 8 503 1694 4 875 1727 6 137 326 8 331 563 3 864 1106 2 1129 1680 7 824 1922 2 28 780 6 264 469 6 373 1720 1 1092 1644 10 225 1275 1 1765 1822 9 658 681 1 867 1509 4 743 1112 1 497 1448 4 570 1153 1 1121 1551 6 2…
Output: -1

Example 3:

Input: 1507 3428 56 351 9 201 954 7 1238 1369 6 729 1153 9 430 932 6 21 232 1 280 403 5 224 1372 3 595 863 3 34 43 1 162 1162 7 229 314 1 1083 1276 6 298 586 4 188 1122 6 466 587 6 171 303 4 1172 1369 3 1195 1374 2 472 784 5 1143 1148 4 1145 1456 2 563 1424 4 840 1373 7 680 842 5 81 791 7 264 1199 1 350 465 6 206 1401 8 863 1372 5 168 646 8 444 1082 2 1352 1490 2 353 1014 7 491 1376 8 1278 1463 7 167 1128 5 360 1350 8 3 792 1 228 1115 4 461 586 6 450 1298 9 991 1284 10 1037 1457 5 1197 1412 3 676 1353 7 722 828 3 734 899 4 144 1266 4 380 1065 7 136 991 8 293 1197 1 289 1256 9 231 1141 8 504 1161 3 125 1448 4 206 459 8 5 366 6 13 448 1 181 1282 8 651 945 3 503 853 7 504 525 5 202 292 2 150 1267 5 785 1083 2 576 888 10 807 1196 2 678 1248 8 10 1266 9 1142 1201 6 528 1286 10 590 1127 8 473 1323 2 65…
Output: -1

Constraints:

1 <= n <= 2139; 0 <= m <= 6417; 0 <= w <= 10.

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