CT59029

Tempest routes Cable Plan

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

Shepherd runs the bakery at the steppe camp of Horselord Plains. Today the books show a list of routes, and the numbers must be worked out before sundown. 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 <= 1457; 0 <= m <= 4371; 0 <= w <= 10.

Example 1:

Input: 253 3739 4 21 8 18 90 6 102 175 9 46 173 9 113 141 3 74 116 6 183 216 10 103 144 2 125 149 1 41 116 1 114 121 9 80 121 8 120 178 5 147 152 5 116 159 4 82 184 9 72 128 10 186 226 9 4 122 8 58 235 9 140 170 2 112 136 6 119 194 2 112 185 1 84 128 10 81 250 1 71 107 7 35 244 1 17 145 10 6 8 2 13 25 8 67 252 8 110 239 5 35 67 3 4 79 7 94 119 3 195 214 7 182 234 5 76 112 5 107 129 10 51 158 8 202 235 7 40 129 4 43 206 9 72 75 3 2 122 3 68 84 1 6 79 2 98 111 3 177 246 1 54 161 2 103 118 5 38 119 6 101 151 7 197 212 8 120 150 7 204 250 6 37 226 7 3 179 5 111 117 7 139 183 5 111 244 3 120 188 4 36 120 1 60 92 5 43 201 10 90 109 7 22 213 4 121 188 4 25 200 2 114 213 8 7 188 6 95 253 3 130 206 8 165 186 5 25 221 9 8 33 4 135 200 6 167 230 3 88 233 2 72 130 7 35 239 10 128 201 6 49 147 9 131 224 2 1 1…
Output: 270

Example 2:

Input: 1294 3164 127 684 8 208 550 2 686 1289 2 402 811 3 93 549 4 577 1166 4 823 1160 7 158 796 3 739 956 1 1002 1050 9 184 345 9 585 1066 6 77 808 8 186 552 5 126 412 2 393 1199 3 219 981 8 75 405 2 462 721 3 43 259 5 132 396 6 2 300 5 97 1245 3 183 688 9 748 858 9 281 1262 5 107 229 1 104 603 6 144 634 6 5 363 7 599 1272 7 819 1139 7 923 1109 5 362 1006 4 895 1172 8 1136 1264 4 596 657 9 1201 1241 1 170 1166 1 93 337 1 366 439 7 24 678 5 256 1247 7 107 1122 9 853 1122 5 1023 1265 4 86 987 4 386 570 10 211 1017 10 459 1255 1 642 1223 1 314 1061 10 101 1038 5 222 906 10 118 574 9 698 796 4 124 1228 6 14 627 2 80 725 4 258 372 10 231 528 1 437 658 6 1258 1293 8 792 1014 10 876 1265 5 186 929 1 223 1117 3 243 623 8 605 1215 1 115 519 2 577 1101 3 793 1154 2 5 1139 2 102 298 4 37 751 3 90 232 7 993…
Output: -1

Example 3:

Input: 283 981 44 134 9 17 90 9 32 87 1 8 14 3 6 21 5 155 195 7 35 95 3 15 269 9 57 107 4 99 243 1 83 104 7 9 78 5 105 260 3 119 144 7 111 231 1 35 187 3 235 246 9 69 113 7 8 39 2 214 260 1 41 150 3 52 253 7 188 265 9 70 198 9 23 280 2 7 193 1 103 184 4 39 72 10 56 178 10 8 101 3 178 268 4 41 173 6 43 75 7 109 118 7 200 261 2 124 159 6 21 265 5 229 240 10 91 118 8 24 118 5 178 274 5 171 189 5 179 223 3 157 217 2 7 27 7 4 47 8 89 264 6 62 70 8 25 233 7 51 216 9 41 196 9 65 68 8 55 134 10 214 261 2 81 221 3 247 281 8 31 149 9 106 134 2 182 250 10 12 282 2 209 222 7 95 109 7 90 260 9 2 121 7 18 267 2 69 259 5 17 136 10 31 199 1 13 76 5 2 30 10 41 96 2 58 267 2 64 283 9 179 216 4 58 213 2 45 199 3 222 249 1 217 267 6 15 35 5 193 205 7 79 234 3 20 149 10 146 180 9 152 221 7 13 221 5 87 132 6 66 132 5 …
Output: 640

Constraints:

1 <= n <= 1457; 0 <= m <= 4371; 0 <= w <= 10.

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