CT57654

The Wistful roads of Tanner

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

In the saffron fields of Marigold Row, Tanner the accountant keeps careful count of the roads. outscore the rival chapter, every figure matters. 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 <= 1626; 0 <= m <= 4878; 0 <= w <= 10.

Example 1:

Input: 291 2644 163 248 10 19 252 6 5 193 8 120 150 10 100 119 6 123 222 7 172 258 5 234 246 10 14 195 8 133 290 4 70 93 10 201 291 8 81 183 2 20 206 9 90 95 6 92 147 4 10 265 7 61 246 9 68 84 1 8 95 1 42 183 1 109 252 9 23 40 4 1 174 10 114 181 4 192 279 4 162 191 5 205 246 4 131 250 6 134 209 9 42 290 9 94 181 2 54 167 9 200 286 1 75 94 5 136 226 4 172 193 1 36 53 6 107 150 1 36 130 1 119 127 8 4 110 7 24 55 4 122 189 9 61 125 4 8 46 3 28 62 7 115 277 9 139 271 5 43 65 6 151 181 10 23 130 8 6 278 3 44 249 2 278 285 1 30 118 1 2 90 4 3 242 9 195 201 8 141 290 10 14 277 3 210 212 8 167 178 3 141 174 6 89 154 5 127 285 6 232 242 10 131 262 10 146 274 2 93 102 7 30 102 6 22 182 2 145 235 2 82 98 8 64 94 7 172 201 6 75 120 5 209 226 1 28 197 5 233 249 2 46 275 1 80 211 7 164 205 1 160 239 5 169 213 …
Output: 357

Example 2:

Input: 1547 4048 221 1115 5 907 1304 2 923 1082 3 350 787 8 423 479 4 403 1318 5 1460 1533 1 738 1084 5 591 702 8 734 1043 6 765 1447 8 642 1480 8 823 1299 10 193 1176 2 389 1360 4 176 635 8 170 865 7 1146 1371 4 788 842 2 1301 1343 5 985 1209 8 12 1537 6 347 1186 6 258 285 3 587 821 9 1046 1100 2 783 1348 10 1087 1262 10 1492 1508 3 37 854 1 245 390 3 1187 1520 5 1072 1239 3 327 589 1 559 1132 5 147 1398 5 276 1268 5 259 1489 4 550 824 2 145 1024 9 624 1279 8 224 377 4 874 1055 10 773 1198 9 919 1224 3 843 866 8 47 148 4 478 1411 7 546 904 5 239 459 10 481 1339 6 1190 1364 8 228 798 1 578 607 8 823 985 4 101 1353 3 120 890 5 715 736 2 519 829 8 117 1229 5 322 1109 2 1166 1234 4 293 1204 2 1020 1143 9 50 777 9 793 1317 6 376 663 3 857 1093 3 1084 1215 6 173 809 1 69 1389 8 771 1056 2 625 728 1 34…
Output: 4395

Example 3:

Input: 839 4518 177 836 9 330 648 10 353 715 5 154 553 9 531 569 6 20 199 10 247 561 1 323 424 6 196 203 7 746 780 7 229 467 6 529 632 3 240 611 5 246 747 3 61 497 9 714 787 7 432 807 10 570 829 2 324 486 8 106 560 9 237 683 2 415 752 4 372 483 9 309 776 1 56 808 2 19 509 10 17 426 2 97 771 10 158 449 9 434 507 8 653 829 7 656 760 6 175 679 2 214 398 10 106 112 2 137 434 1 72 816 2 479 659 5 453 539 4 456 528 4 521 818 5 235 720 1 192 727 7 310 495 5 278 446 10 36 249 10 4 701 2 306 327 2 328 582 4 70 649 2 770 837 10 489 625 1 617 815 9 419 420 4 635 693 4 112 385 1 282 672 1 509 567 9 430 592 6 57 813 3 119 654 8 216 765 4 376 400 3 260 555 9 233 379 1 157 197 1 111 213 5 314 802 10 617 741 8 16 294 1 26 480 7 112 260 6 23 680 8 5 675 9 220 412 10 440 713 5 103 209 8 201 222 3 18 562 9 465 584 …
Output: 1386

Constraints:

1 <= n <= 1626; 0 <= m <= 4878; 0 <= w <= 10.

Loading...
Test Cases:No test cases
No test cases available.
The Wistful roads of Tanner - MEDIUM Coding Problem | CodeTikki