CT63116

Smoky roads Cable Plan

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

Caravans arrive at the frontier camp of Duskwood with crates of roads, and Pia the paymaster 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 <= 1713; 0 <= m <= 5139; 0 <= w <= 10.

Example 1:

Input: 807 3238 450 637 4 304 597 10 37 544 2 78 396 2 268 358 2 278 327 2 497 580 10 349 627 7 258 734 7 229 726 6 442 498 4 100 769 8 157 346 8 144 428 8 355 464 6 156 596 10 39 323 7 577 697 1 86 199 10 109 616 6 71 477 4 566 605 6 105 408 10 142 661 5 89 568 9 51 138 10 210 767 3 77 85 10 422 500 5 275 414 3 634 737 6 319 464 4 68 540 1 86 371 8 488 709 7 403 612 9 463 601 9 281 756 4 160 750 5 58 542 1 380 472 7 325 467 7 149 696 9 124 522 4 396 427 1 102 543 10 93 156 5 342 443 4 131 653 10 320 764 6 212 328 10 215 308 8 9 489 5 132 489 9 55 589 6 210 497 2 54 619 5 52 492 2 114 272 6 281 318 10 350 495 8 734 803 1 36 275 8 270 644 4 52 631 6 434 730 6 229 292 4 156 388 9 424 617 7 54 142 1 162 533 6 284 635 10 196 802 8 223 800 1 146 549 10 652 800 5 734 780 7 605 692 2 416 774 5 82 707 8 …
Output: 1697

Example 2:

Input: 550 2475 188 235 2 279 529 8 139 549 4 251 534 3 193 273 3 242 519 5 194 248 1 368 474 10 27 411 7 157 431 7 261 401 6 176 279 5 4 286 7 251 299 1 252 269 10 59 419 8 181 483 2 80 320 5 8 494 4 5 465 3 2 453 2 226 318 8 235 432 3 18 224 7 290 391 7 21 494 4 333 409 6 65 452 10 295 349 5 129 356 10 187 336 10 221 240 2 211 530 8 45 252 9 90 185 7 50 346 6 244 327 8 59 220 9 16 479 10 65 314 2 236 391 8 185 537 10 96 431 2 97 145 10 198 341 3 188 340 3 111 242 6 423 478 4 40 61 8 64 517 2 65 388 1 270 357 8 356 450 7 247 324 3 489 520 6 81 386 6 6 176 10 280 470 10 24 198 1 328 428 2 257 354 3 61 153 7 94 487 2 43 475 7 205 426 5 87 323 7 354 403 4 26 156 10 12 498 1 72 81 4 114 511 2 87 132 7 65 519 9 187 412 4 42 319 2 205 482 3 384 484 4 173 494 6 235 346 8 33 203 4 25 180 4 29 218 6 29 6…
Output: 1081

Example 3:

Input: 92 3827 1 78 8 40 77 6 8 83 8 21 22 10 26 90 4 10 56 3 69 76 8 39 78 1 60 90 9 61 72 9 72 84 4 51 64 6 45 63 1 51 76 2 45 76 1 21 41 10 1 12 2 12 32 4 5 19 10 28 57 7 65 67 9 29 60 1 16 73 1 72 74 4 46 78 10 19 24 2 32 38 8 12 52 7 15 50 3 31 71 3 46 63 10 40 48 5 23 27 7 63 84 2 38 52 4 58 75 10 85 86 1 3 65 3 27 58 6 54 81 2 46 58 8 17 41 10 9 79 7 6 35 5 14 37 9 37 52 2 58 78 1 59 68 5 57 81 8 23 81 6 28 35 6 14 61 5 39 88 9 18 79 7 12 38 2 37 48 8 63 64 10 49 92 10 9 21 8 5 44 8 25 48 8 13 46 3 4 17 10 12 24 6 6 32 2 35 51 2 10 64 9 40 62 8 13 34 4 47 57 5 12 85 4 73 91 8 11 26 2 70 90 9 13 38 5 42 70 1 6 15 8 39 73 5 15 82 7 25 65 4 46 55 2 24 54 2 29 45 2 8 27 6 1 32 8 41 86 9 87 92 5 4 40 8 57 78 3 52 76 3 16 63 2 33 89 10 49 84 4 32 69 1 74 78 9 15 18 2 21 56 6 39 71 6 42 80 5 38 4…
Output: 91

Constraints:

1 <= n <= 1713; 0 <= m <= 5139; 0 <= w <= 10.

Loading...
Test Cases:No test cases
No test cases available.
Smoky roads Cable Plan - MEDIUM Coding Problem | CodeTikki