CT58752

Captain's Ledger of roads

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

It is audit day at the ember mines of Cindercrag. Captain spreads the roads 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 <= 1950; 0 <= m <= 5850; 0 <= w <= 10.

Example 1:

Input: 480 2794 232 297 1 64 286 8 314 370 5 157 415 9 320 357 1 134 330 6 20 57 8 291 303 4 1 199 1 244 309 6 95 258 7 289 363 6 267 417 4 60 467 3 193 358 1 223 404 3 124 321 1 25 230 6 180 279 4 120 267 1 16 397 5 6 230 1 87 178 7 137 333 4 208 478 3 100 185 9 93 448 1 143 262 6 216 472 1 158 212 8 66 353 6 77 136 5 22 39 4 99 368 9 235 467 7 143 168 10 283 367 7 135 356 7 132 404 8 2 22 8 351 445 1 246 425 9 58 363 9 330 359 5 393 414 9 458 465 10 8 134 7 394 468 1 97 306 8 240 455 5 215 449 5 13 423 1 170 241 6 32 385 6 24 179 1 299 351 5 122 429 8 6 205 10 371 407 6 210 350 7 147 279 9 89 276 9 120 467 7 230 370 2 300 470 10 12 341 7 143 419 4 119 178 5 96 202 8 236 286 5 93 131 4 77 131 9 102 157 5 35 417 6 352 456 3 176 184 9 366 388 6 100 399 2 293 435 3 33 68 9 426 450 2 229 416 10 364 …
Output: 752

Example 2:

Input: 1050 2030 210 710 10 264 817 3 31 776 10 244 754 6 476 604 4 663 809 5 659 821 5 67 396 3 85 221 3 12 893 10 419 797 6 1009 1025 5 122 902 4 256 860 6 528 718 2 785 1043 8 395 1016 10 172 793 1 273 357 1 134 707 6 622 716 5 65 827 4 54 245 4 127 283 6 464 929 5 855 925 9 427 694 2 116 267 8 201 1044 5 68 685 6 305 674 2 80 765 8 134 874 6 836 996 5 304 986 10 321 432 4 630 913 3 65 624 5 492 605 4 65 251 2 121 164 5 59 189 9 290 655 7 467 1005 3 338 453 1 349 977 6 460 788 4 545 787 10 69 578 7 326 933 6 149 550 9 252 882 7 696 721 8 604 825 6 211 605 2 34 353 10 574 1037 4 42 414 10 40 820 2 63 265 8 638 793 9 186 274 5 254 799 1 546 896 8 285 410 1 195 557 3 746 895 7 1 820 8 308 746 1 126 909 2 113 346 9 135 843 9 3 760 6 211 696 5 659 925 6 257 955 8 420 1035 4 583 818 5 455 751 5 37 9…
Output: 3671

Example 3:

Input: 1622 2289 589 849 6 50 93 7 653 887 2 279 965 4 287 1017 8 330 627 1 368 1256 5 293 666 6 106 564 6 274 846 8 241 422 9 121 1409 1 1189 1240 8 1015 1438 6 20 1354 4 479 693 4 107 1180 10 491 1430 7 1285 1579 10 111 581 5 283 1104 1 481 1450 6 161 1493 10 14 1378 1 501 1594 5 1021 1052 5 192 1012 5 1401 1549 5 830 856 6 353 729 6 841 1222 4 62 167 10 55 522 5 383 1535 4 406 1555 5 700 1328 8 1386 1418 1 601 1439 6 1056 1516 7 1396 1575 6 754 1334 2 160 1005 9 169 1559 7 403 538 5 237 350 3 79 1442 6 876 1159 7 589 1616 1 505 1348 6 110 1148 1 904 931 1 510 1417 10 1215 1482 2 734 1443 1 1003 1450 9 1415 1564 7 1159 1608 2 363 1530 5 919 1357 2 27 772 8 717 1184 6 69 1264 10 5 306 5 177 226 5 1192 1599 7 289 920 1 364 860 3 390 1411 10 239 917 3 490 796 7 688 1093 4 499 1339 1 268 934 7 108 …
Output: 7002

Constraints:

1 <= n <= 1950; 0 <= m <= 5850; 0 <= w <= 10.

Loading...
Test Cases:No test cases
No test cases available.
Captain's Ledger of roads - MEDIUM Coding Problem | CodeTikki