File size: 222,895 Bytes
aff484f | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 | task_name,problem_type,instruction,instance,solution,obj,instance_variant,solution_variant,context_index,input_format,input_index_base
KMST,KMST,"There’s a planning task where a team must select a predetermined number of city blocks and connect them with newly built streets so those blocks become one connected cluster, with no closed loops of road and no duplicate segments. What separates a good plan from a bad one is how cheap the whole construction comes out: just add up the price of each new street and the smaller that total, the better the plan. The exact blocks, candidate streets, and their costs are shown below.
This instance specifies 16 distinct city blocks, 20 candidate streets, and a requirement to connect exactly 5 blocks.
Candidate street connecting blocks 10 and 11 with construction cost 396.0.
Candidate street connecting blocks 10 and 13 with construction cost 268.0.
Candidate street connecting blocks 10 and 2 with construction cost 2.0.
Candidate street connecting blocks 11 and 14 with construction cost 286.0.
Candidate street connecting blocks 11 and 6 with construction cost 466.0.
Candidate street connecting blocks 12 and 7 with construction cost 367.0.
Candidate street connecting blocks 12 and 5 with construction cost 623.0.
Candidate street connecting blocks 6 and 7 with construction cost 412.0.
Candidate street connecting blocks 7 and 2 with construction cost 466.0.
Candidate street connecting blocks 8 and 4 with construction cost 283557.0.
Candidate street connecting blocks 8 and 0 with construction cost 283557.0.
Candidate street connecting blocks 13 and 14 with construction cost 383.0.
Candidate street connecting blocks 13 and 15 with construction cost 816.0.
Candidate street connecting blocks 15 and 3 with construction cost 93.0.
Candidate street connecting blocks 0 and 1 with construction cost 578.0.
Candidate street connecting blocks 0 and 2 with construction cost 608.0.
Candidate street connecting blocks 0 and 3 with construction cost 846.0.
Candidate street connecting blocks 1 and 9 with construction cost 792.0.
Candidate street connecting blocks 3 and 9 with construction cost 147.0.
Candidate street connecting blocks 4 and 5 with construction cost 290.0.
The team must select 5 blocks and the new streets that connect them so the total construction cost is as small as possible.
If you want, send back the picked street segments in a tiny JSON snippet like this so it's easy to read and process:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
That ""solution"" list is just a set of street segments: each pair like [u1, v1] means ""connect block u1 to block v1"" with a new road. Think of it like filling out a short form — the JSON shows the shape I expect, not the actual answer.
Please use the exact identifiers from the instance input when you fill this in — don't rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 11, 'v': 12, 'w': 396.0}, {'u': 11, 'v': 14, 'w': 268.0}, {'u': 11, 'v': 3, 'w': 2.0}, {'u': 12, 'v': 15, 'w': 286.0}, {'u': 12, 'v': 7, 'w': 466.0}, {'u': 13, 'v': 8, 'w': 367.0}, {'u': 13, 'v': 6, 'w': 623.0}, {'u': 7, 'v': 8, 'w': 412.0}, {'u': 8, 'v': 3, 'w': 466.0}, {'u': 9, 'v': 5, 'w': 283557.0}, {'u': 9, 'v': 1, 'w': 283557.0}, {'u': 14, 'v': 15, 'w': 383.0}, {'u': 14, 'v': 16, 'w': 816.0}, {'u': 16, 'v': 4, 'w': 93.0}, {'u': 1, 'v': 2, 'w': 578.0}, {'u': 1, 'v': 3, 'w': 608.0}, {'u': 1, 'v': 4, 'w': 846.0}, {'u': 2, 'v': 10, 'w': 792.0}, {'u': 4, 'v': 10, 'w': 147.0}, {'u': 5, 'v': 6, 'w': 290.0}], 'k': 5, 'source_file': 'I076.stp', 'density': 0.16666666666666666}","[[11, 14], [3, 11], [12, 15], [14, 15]]",939.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 10, 'v': 11, 'w': 396.0}, {'u': 10, 'v': 13, 'w': 268.0}, {'u': 10, 'v': 2, 'w': 2.0}, {'u': 11, 'v': 14, 'w': 286.0}, {'u': 11, 'v': 6, 'w': 466.0}, {'u': 12, 'v': 7, 'w': 367.0}, {'u': 12, 'v': 5, 'w': 623.0}, {'u': 6, 'v': 7, 'w': 412.0}, {'u': 7, 'v': 2, 'w': 466.0}, {'u': 8, 'v': 4, 'w': 283557.0}, {'u': 8, 'v': 0, 'w': 283557.0}, {'u': 13, 'v': 14, 'w': 383.0}, {'u': 13, 'v': 15, 'w': 816.0}, {'u': 15, 'v': 3, 'w': 93.0}, {'u': 0, 'v': 1, 'w': 578.0}, {'u': 0, 'v': 2, 'w': 608.0}, {'u': 0, 'v': 3, 'w': 846.0}, {'u': 1, 'v': 9, 'w': 792.0}, {'u': 3, 'v': 9, 'w': 147.0}, {'u': 4, 'v': 5, 'w': 290.0}], 'density': 0.16666666666666666, 'source_file': 'I076.stp', 'k': 5}","[[10, 13], [2, 10], [11, 14], [13, 14]]",1,markdown_table,0
KMST,KMST,"We had to lay out a small cluster: choose a set number of racks and wire them together with straight links so every machine in that set can reach every other, without creating redundant loops that would waste cable. Decisions are judged by total cable used — sum the lengths of the chosen links, and the setup with the lowest sum is best. The rule is to include exactly the required number of servers, make sure they’re all connected, and avoid any extra circular wiring. The concrete details are shown below.
{
""total_servers"": 18,
""potential_links"": 20,
""edges"": [
{
""server_u"": ""M"",
""server_v"": ""K"",
""cable_length"": 5927.0
},
{
""server_u"": ""B"",
""server_v"": ""A"",
""cable_length"": 1914.0
},
{
""server_u"": ""B"",
""server_v"": ""G"",
""cable_length"": 2606.0
},
{
""server_u"": ""N"",
""server_v"": ""O"",
""cable_length"": 976.0
},
{
""server_u"": ""N"",
""server_v"": ""G"",
""cable_length"": 105.0
},
{
""server_u"": ""N"",
""server_v"": ""F"",
""cable_length"": 3682.0
},
{
""server_u"": ""C"",
""server_v"": ""A"",
""cable_length"": 2039.0
},
{
""server_u"": ""C"",
""server_v"": ""D"",
""cable_length"": 2095.0
},
{
""server_u"": ""O"",
""server_v"": ""Q"",
""cable_length"": 546.0
},
{
""server_u"": ""O"",
""server_v"": ""H"",
""cable_length"": 1791.0
},
{
""server_u"": ""D"",
""server_v"": ""I"",
""cable_length"": 460.0
},
{
""server_u"": ""P"",
""server_v"": ""G"",
""cable_length"": 681.0
},
{
""server_u"": ""R"",
""server_v"": ""J"",
""cable_length"": 1058.0
},
{
""server_u"": ""R"",
""server_v"": ""K"",
""cable_length"": 227.0
},
{
""server_u"": ""E"",
""server_v"": ""H"",
""cable_length"": 1286.0
},
{
""server_u"": ""E"",
""server_v"": ""F"",
""cable_length"": 1829.0
},
{
""server_u"": ""E"",
""server_v"": ""K"",
""cable_length"": 859.0
},
{
""server_u"": ""H"",
""server_v"": ""L"",
""cable_length"": 4717.0
},
{
""server_u"": ""I"",
""server_v"": ""F"",
""cable_length"": 925.0
},
{
""server_u"": ""I"",
""server_v"": ""J"",
""cable_length"": 626.0
}
],
""servers_to_select"": 9
}
When you send back the wiring plan, just paste the chosen links in this simple JSON shape so it's easy to parse and check:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is a list of the links you picked; each inner pair like [u1, v1] is one straight connection between two racks (order doesn't matter — it's just the two endpoints). Think of it as a little checklist of which cables to lay between which racks.
This JSON is just a sketch of the shape I expect, not the actual answer — fill in the exact pair list for your instance. Also be sure to use the identifiers exactly as they appear in the instance input — do not rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as ""1"" or ""23"", single capital letters like ""A"" or ""B"", or a capital letter followed by digits like ""A1"" or ""X7"".""","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 20, 'edges': [{'u': 13, 'v': 11, 'w': 5927.0}, {'u': 2, 'v': 1, 'w': 1914.0}, {'u': 2, 'v': 7, 'w': 2606.0}, {'u': 14, 'v': 15, 'w': 976.0}, {'u': 14, 'v': 7, 'w': 105.0}, {'u': 14, 'v': 6, 'w': 3682.0}, {'u': 3, 'v': 1, 'w': 2039.0}, {'u': 3, 'v': 4, 'w': 2095.0}, {'u': 15, 'v': 17, 'w': 546.0}, {'u': 15, 'v': 8, 'w': 1791.0}, {'u': 4, 'v': 9, 'w': 460.0}, {'u': 16, 'v': 7, 'w': 681.0}, {'u': 18, 'v': 10, 'w': 1058.0}, {'u': 18, 'v': 11, 'w': 227.0}, {'u': 5, 'v': 8, 'w': 1286.0}, {'u': 5, 'v': 6, 'w': 1829.0}, {'u': 5, 'v': 11, 'w': 859.0}, {'u': 8, 'v': 12, 'w': 4717.0}, {'u': 9, 'v': 6, 'w': 925.0}, {'u': 9, 'v': 10, 'w': 626.0}], 'k': 9, 'source_file': 'I055.stp', 'density': 0.13071895424836602}","[[14, 15], [7, 14], [15, 17], [8, 15], [7, 16], [11, 18], [5, 8], [5, 11]]",6471.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 20, 'edges': [{'u': 'M', 'v': 'K', 'w': 5927.0}, {'u': 'B', 'v': 'A', 'w': 1914.0}, {'u': 'B', 'v': 'G', 'w': 2606.0}, {'u': 'N', 'v': 'O', 'w': 976.0}, {'u': 'N', 'v': 'G', 'w': 105.0}, {'u': 'N', 'v': 'F', 'w': 3682.0}, {'u': 'C', 'v': 'A', 'w': 2039.0}, {'u': 'C', 'v': 'D', 'w': 2095.0}, {'u': 'O', 'v': 'Q', 'w': 546.0}, {'u': 'O', 'v': 'H', 'w': 1791.0}, {'u': 'D', 'v': 'I', 'w': 460.0}, {'u': 'P', 'v': 'G', 'w': 681.0}, {'u': 'R', 'v': 'J', 'w': 1058.0}, {'u': 'R', 'v': 'K', 'w': 227.0}, {'u': 'E', 'v': 'H', 'w': 1286.0}, {'u': 'E', 'v': 'F', 'w': 1829.0}, {'u': 'E', 'v': 'K', 'w': 859.0}, {'u': 'H', 'v': 'L', 'w': 4717.0}, {'u': 'I', 'v': 'F', 'w': 925.0}, {'u': 'I', 'v': 'J', 'w': 626.0}], 'density': 0.13071895424836602, 'source_file': 'I055.stp', 'k': 9}","[['N', 'O'], ['G', 'N'], ['O', 'Q'], ['H', 'O'], ['G', 'P'], ['K', 'R'], ['E', 'H'], ['E', 'K']]",2,json,names
KMST,KMST,"Someone on the planning team has to pick a set number of campsites and sketch paths between them so the selected sites become one connected cluster, and there can’t be any closed loops in the path layout. Better plans are the ones with the least total trail length: just sum all the individual path lengths to compare options. The rule is to use exactly that many campsites, don’t double-count spots, and make sure none of the chosen sites are left isolated. The detailed campsite list and distances appear below.
{
""total_campsites"": 17,
""total_candidate_trails"": 20,
""edges"": [
{
""campsite_endpoint_u"": ""F"",
""campsite_endpoint_v"": ""M"",
""trail_length"": 204.0
},
{
""campsite_endpoint_u"": ""Q"",
""campsite_endpoint_v"": ""O"",
""trail_length"": 1738.0
},
{
""campsite_endpoint_u"": ""H"",
""campsite_endpoint_v"": ""C"",
""trail_length"": 1987.0
},
{
""campsite_endpoint_u"": ""H"",
""campsite_endpoint_v"": ""M"",
""trail_length"": 464.0
},
{
""campsite_endpoint_u"": ""E"",
""campsite_endpoint_v"": ""K"",
""trail_length"": 442.0
},
{
""campsite_endpoint_u"": ""E"",
""campsite_endpoint_v"": ""N"",
""trail_length"": 1463.0
},
{
""campsite_endpoint_u"": ""E"",
""campsite_endpoint_v"": ""G"",
""trail_length"": 1045.0
},
{
""campsite_endpoint_u"": ""K"",
""campsite_endpoint_v"": ""L"",
""trail_length"": 310.0
},
{
""campsite_endpoint_u"": ""K"",
""campsite_endpoint_v"": ""P"",
""trail_length"": 1339.0
},
{
""campsite_endpoint_u"": ""L"",
""campsite_endpoint_v"": ""G"",
""trail_length"": 408.0
},
{
""campsite_endpoint_u"": ""L"",
""campsite_endpoint_v"": ""D"",
""trail_length"": 1991.0
},
{
""campsite_endpoint_u"": ""M"",
""campsite_endpoint_v"": ""D"",
""trail_length"": 1986.0
},
{
""campsite_endpoint_u"": ""O"",
""campsite_endpoint_v"": ""N"",
""trail_length"": 1444.0
},
{
""campsite_endpoint_u"": ""J"",
""campsite_endpoint_v"": ""I"",
""trail_length"": 160.0
},
{
""campsite_endpoint_u"": ""J"",
""campsite_endpoint_v"": ""A"",
""trail_length"": 700.0
},
{
""campsite_endpoint_u"": ""P"",
""campsite_endpoint_v"": ""I"",
""trail_length"": 1245.0
},
{
""campsite_endpoint_u"": ""P"",
""campsite_endpoint_v"": ""N"",
""trail_length"": 1132.0
},
{
""campsite_endpoint_u"": ""B"",
""campsite_endpoint_v"": ""A"",
""trail_length"": 420.0
},
{
""campsite_endpoint_u"": ""B"",
""campsite_endpoint_v"": ""I"",
""trail_length"": 445.0
},
{
""campsite_endpoint_u"": ""C"",
""campsite_endpoint_v"": ""D"",
""trail_length"": 529.0
}
],
""target_campsite_count"": 8
}
When you send back the chosen paths, please stick to a little JSON sketch like this so it's easy to read and parse:
{
""solution"": [[camp1, camp2], [camp3, camp4], ...]
}
Here ""solution"" is a list of the trail segments you picked; each inner pair [A, B] is a path between two campsites A and B. Think of it like filling in a simple form: each line is one selected connection. This block is just a shape example — not the real answer.
Please make sure that in your actual reply you use the exact identifiers given in the instance input — no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 20, 'edges': [{'u': 6, 'v': 13, 'w': 204.0}, {'u': 17, 'v': 15, 'w': 1738.0}, {'u': 8, 'v': 3, 'w': 1987.0}, {'u': 8, 'v': 13, 'w': 464.0}, {'u': 5, 'v': 11, 'w': 442.0}, {'u': 5, 'v': 14, 'w': 1463.0}, {'u': 5, 'v': 7, 'w': 1045.0}, {'u': 11, 'v': 12, 'w': 310.0}, {'u': 11, 'v': 16, 'w': 1339.0}, {'u': 12, 'v': 7, 'w': 408.0}, {'u': 12, 'v': 4, 'w': 1991.0}, {'u': 13, 'v': 4, 'w': 1986.0}, {'u': 15, 'v': 14, 'w': 1444.0}, {'u': 10, 'v': 9, 'w': 160.0}, {'u': 10, 'v': 1, 'w': 700.0}, {'u': 16, 'v': 9, 'w': 1245.0}, {'u': 16, 'v': 14, 'w': 1132.0}, {'u': 2, 'v': 1, 'w': 420.0}, {'u': 2, 'v': 9, 'w': 445.0}, {'u': 3, 'v': 4, 'w': 529.0}], 'k': 8, 'source_file': 'I011.stp', 'density': 0.14705882352941177}","[[11, 12], [11, 16], [7, 12], [9, 10], [9, 16], [1, 2], [2, 9]]",4327.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 20, 'edges': [{'u': 'F', 'v': 'M', 'w': 204.0}, {'u': 'Q', 'v': 'O', 'w': 1738.0}, {'u': 'H', 'v': 'C', 'w': 1987.0}, {'u': 'H', 'v': 'M', 'w': 464.0}, {'u': 'E', 'v': 'K', 'w': 442.0}, {'u': 'E', 'v': 'N', 'w': 1463.0}, {'u': 'E', 'v': 'G', 'w': 1045.0}, {'u': 'K', 'v': 'L', 'w': 310.0}, {'u': 'K', 'v': 'P', 'w': 1339.0}, {'u': 'L', 'v': 'G', 'w': 408.0}, {'u': 'L', 'v': 'D', 'w': 1991.0}, {'u': 'M', 'v': 'D', 'w': 1986.0}, {'u': 'O', 'v': 'N', 'w': 1444.0}, {'u': 'J', 'v': 'I', 'w': 160.0}, {'u': 'J', 'v': 'A', 'w': 700.0}, {'u': 'P', 'v': 'I', 'w': 1245.0}, {'u': 'P', 'v': 'N', 'w': 1132.0}, {'u': 'B', 'v': 'A', 'w': 420.0}, {'u': 'B', 'v': 'I', 'w': 445.0}, {'u': 'C', 'v': 'D', 'w': 529.0}], 'density': 0.14705882352941177, 'source_file': 'I011.stp', 'k': 8}","[['K', 'L'], ['K', 'P'], ['G', 'L'], ['I', 'J'], ['I', 'P'], ['A', 'B'], ['B', 'I']]",3,json,names
KMST,KMST,"We had a one-line brief from the museum director: pick a set number of exhibits and connect them with walkways so visitors can move between any two chosen exhibits, but don’t let the walkways form loops where people might walk in circles. Better layouts were simply those where the sum of the lengths of all built paths was as small as it could be — you literally add up the lengths of the chosen paths and prefer the smallest total. The selection must include exactly the pre-determined number of displays (no leaving some out or doubling up) and each chosen display must be linked so the whole group is connected without circular routes. The specific layout options and distances appear below.
There are 16 exhibit locations and 20 candidate walkways listed below; we must pick exactly 6 exhibits and connect them into a tree (connected, no cycles).
Candidate walkway between exhibit 16 and exhibit 10 with length 1907.0.
Candidate walkway between exhibit 14 and exhibit 8 with length 1534.0.
Candidate walkway between exhibit 1 and exhibit 2 with length 109.0.
Candidate walkway between exhibit 1 and exhibit 3 with length 428.0.
Candidate walkway between exhibit 1 and exhibit 6 with length 345.0.
Candidate walkway between exhibit 2 and exhibit 7 with length 345.0.
Candidate walkway between exhibit 2 and exhibit 15 with length 407.0.
Candidate walkway between exhibit 2 and exhibit 9 with length 424.0.
Candidate walkway between exhibit 3 and exhibit 9 with length 104.0.
Candidate walkway between exhibit 3 and exhibit 8 with length 1649.0.
Candidate walkway between exhibit 4 and exhibit 5 with length 177.0.
Candidate walkway between exhibit 4 and exhibit 6 with length 473.0.
Candidate walkway between exhibit 5 and exhibit 10 with length 1170.0.
Candidate walkway between exhibit 5 and exhibit 11 with length 473.0.
Candidate walkway between exhibit 6 and exhibit 7 with length 96.0.
Candidate walkway between exhibit 6 and exhibit 11 with length 158.0.
Candidate walkway between exhibit 7 and exhibit 12 with length 155.0.
Candidate walkway between exhibit 13 and exhibit 12 with length 2076.0.
Candidate walkway between exhibit 8 and exhibit 10 with length 1057.0.
Candidate walkway between exhibit 11 and exhibit 12 with length 90.0.
We will select the 6 exhibits and their connecting walkways that yield the smallest total path length.
Also, when you send back the chosen walkways, please follow this little JSON sketch so it's easy to read and parse:
{
""solution"": [[""ex1"", ""ex2""], [""ex3"", ""ex4""], ...]
}
Here ""solution"" is a list of the paths you'll build; each inner pair is a walkway connecting the two exhibit IDs (so [""ex1"",""ex2""] means there's a path between exhibit ex1 and exhibit ex2). It's just a template showing the shape I expect — not the actual layout you should submit.
Please make sure to use the exact exhibit IDs from the instance input — do not rename them or invent new labels.
Valid identifiers look like plain numbers such as ""1"" or ""23"", single capital letters like ""A"" or ""B"", or a capital letter followed by digits like ""A1"" or ""X7"".","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 16, 'v': 10, 'w': 1907.0}, {'u': 14, 'v': 8, 'w': 1534.0}, {'u': 1, 'v': 2, 'w': 109.0}, {'u': 1, 'v': 3, 'w': 428.0}, {'u': 1, 'v': 6, 'w': 345.0}, {'u': 2, 'v': 7, 'w': 345.0}, {'u': 2, 'v': 15, 'w': 407.0}, {'u': 2, 'v': 9, 'w': 424.0}, {'u': 3, 'v': 9, 'w': 104.0}, {'u': 3, 'v': 8, 'w': 1649.0}, {'u': 4, 'v': 5, 'w': 177.0}, {'u': 4, 'v': 6, 'w': 473.0}, {'u': 5, 'v': 10, 'w': 1170.0}, {'u': 5, 'v': 11, 'w': 473.0}, {'u': 6, 'v': 7, 'w': 96.0}, {'u': 6, 'v': 11, 'w': 158.0}, {'u': 7, 'v': 12, 'w': 155.0}, {'u': 13, 'v': 12, 'w': 2076.0}, {'u': 8, 'v': 10, 'w': 1057.0}, {'u': 11, 'v': 12, 'w': 90.0}], 'k': 6, 'source_file': 'I024.stp', 'density': 0.16666666666666666}","[[1, 2], [1, 6], [6, 7], [7, 12], [11, 12]]",795.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 16, 'v': 10, 'w': 1907.0}, {'u': 14, 'v': 8, 'w': 1534.0}, {'u': 1, 'v': 2, 'w': 109.0}, {'u': 1, 'v': 3, 'w': 428.0}, {'u': 1, 'v': 6, 'w': 345.0}, {'u': 2, 'v': 7, 'w': 345.0}, {'u': 2, 'v': 15, 'w': 407.0}, {'u': 2, 'v': 9, 'w': 424.0}, {'u': 3, 'v': 9, 'w': 104.0}, {'u': 3, 'v': 8, 'w': 1649.0}, {'u': 4, 'v': 5, 'w': 177.0}, {'u': 4, 'v': 6, 'w': 473.0}, {'u': 5, 'v': 10, 'w': 1170.0}, {'u': 5, 'v': 11, 'w': 473.0}, {'u': 6, 'v': 7, 'w': 96.0}, {'u': 6, 'v': 11, 'w': 158.0}, {'u': 7, 'v': 12, 'w': 155.0}, {'u': 13, 'v': 12, 'w': 2076.0}, {'u': 8, 'v': 10, 'w': 1057.0}, {'u': 11, 'v': 12, 'w': 90.0}], 'density': 0.16666666666666666, 'source_file': 'I024.stp', 'k': 6}","[[1, 2], [1, 6], [6, 7], [7, 12], [11, 12]]",4,nl,1
KMST,KMST,"Many planners run into the same puzzle: select a predetermined count of towers and set up point-to-point connections so the selected towers are all connected, but there are no circular routes among the links. The decision is about picking which towers and which connections; to compare options, add up the price of every link in a plan and favor the plan with the smallest total. The number of towers is fixed, each chosen once, and they must form one continuous, loop-free network. The concrete instance and numbers follow below.
{
""total_towers"": 16,
""total_candidate_links"": 21,
""edges"": [
{
""tower_endpoint_a"": 7,
""tower_endpoint_b"": 8,
""link_cost"": 1339.0
},
{
""tower_endpoint_a"": 7,
""tower_endpoint_b"": 3,
""link_cost"": 784.0
},
{
""tower_endpoint_a"": 7,
""tower_endpoint_b"": 11,
""link_cost"": 7343.0
},
{
""tower_endpoint_a"": 11,
""tower_endpoint_b"": 10,
""link_cost"": 1289.0
},
{
""tower_endpoint_a"": 11,
""tower_endpoint_b"": 14,
""link_cost"": 2271.0
},
{
""tower_endpoint_a"": 12,
""tower_endpoint_b"": 10,
""link_cost"": 28251.0
},
{
""tower_endpoint_a"": 12,
""tower_endpoint_b"": 13,
""link_cost"": 1342.0
},
{
""tower_endpoint_a"": 12,
""tower_endpoint_b"": 9,
""link_cost"": 1069.0
},
{
""tower_endpoint_a"": 8,
""tower_endpoint_b"": 5,
""link_cost"": 1124.0
},
{
""tower_endpoint_a"": 8,
""tower_endpoint_b"": 10,
""link_cost"": 7014.0
},
{
""tower_endpoint_a"": 14,
""tower_endpoint_b"": 13,
""link_cost"": 25628.0
},
{
""tower_endpoint_a"": 14,
""tower_endpoint_b"": 2,
""link_cost"": 739.0
},
{
""tower_endpoint_a"": 13,
""tower_endpoint_b"": 1,
""link_cost"": 794.0
},
{
""tower_endpoint_a"": 3,
""tower_endpoint_b"": 0,
""link_cost"": 880.0
},
{
""tower_endpoint_a"": 3,
""tower_endpoint_b"": 4,
""link_cost"": 7828.0
},
{
""tower_endpoint_a"": 4,
""tower_endpoint_b"": 2,
""link_cost"": 1971.0
},
{
""tower_endpoint_a"": 9,
""tower_endpoint_b"": 5,
""link_cost"": 35282.0
},
{
""tower_endpoint_a"": 9,
""tower_endpoint_b"": 15,
""link_cost"": 1072.0
},
{
""tower_endpoint_a"": 5,
""tower_endpoint_b"": 6,
""link_cost"": 1034.0
},
{
""tower_endpoint_a"": 6,
""tower_endpoint_b"": 15,
""link_cost"": 35293.0
},
{
""tower_endpoint_a"": 1,
""tower_endpoint_b"": 2,
""link_cost"": 25423.0
}
],
""towers_to_connect"": 8
}
Also, when you reply with a candidate wiring plan, please use this simple JSON shape so it's easy to parse and compare:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of that as a little form: ""solution"" is the list of chosen links, and each inner pair like [u1, v1] just means ""connect tower u1 to tower v1"". Pretty informal — it's just a sketch of the shape I expect, not the final answer itself.
All identifiers in your solution must match the instance input exactly — no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 21, 'edges': [{'u': 8, 'v': 9, 'w': 1339.0}, {'u': 8, 'v': 4, 'w': 784.0}, {'u': 8, 'v': 12, 'w': 7343.0}, {'u': 12, 'v': 11, 'w': 1289.0}, {'u': 12, 'v': 15, 'w': 2271.0}, {'u': 13, 'v': 11, 'w': 28251.0}, {'u': 13, 'v': 14, 'w': 1342.0}, {'u': 13, 'v': 10, 'w': 1069.0}, {'u': 9, 'v': 6, 'w': 1124.0}, {'u': 9, 'v': 11, 'w': 7014.0}, {'u': 15, 'v': 14, 'w': 25628.0}, {'u': 15, 'v': 3, 'w': 739.0}, {'u': 14, 'v': 2, 'w': 794.0}, {'u': 4, 'v': 1, 'w': 880.0}, {'u': 4, 'v': 5, 'w': 7828.0}, {'u': 5, 'v': 3, 'w': 1971.0}, {'u': 10, 'v': 6, 'w': 35282.0}, {'u': 10, 'v': 16, 'w': 1072.0}, {'u': 6, 'v': 7, 'w': 1034.0}, {'u': 7, 'v': 16, 'w': 35293.0}, {'u': 2, 'v': 3, 'w': 25423.0}], 'k': 8, 'source_file': 'I007.stp', 'density': 0.175}","[[8, 9], [4, 8], [11, 12], [6, 9], [9, 11], [1, 4], [6, 7]]",13464.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 21, 'edges': [{'u': 7, 'v': 8, 'w': 1339.0}, {'u': 7, 'v': 3, 'w': 784.0}, {'u': 7, 'v': 11, 'w': 7343.0}, {'u': 11, 'v': 10, 'w': 1289.0}, {'u': 11, 'v': 14, 'w': 2271.0}, {'u': 12, 'v': 10, 'w': 28251.0}, {'u': 12, 'v': 13, 'w': 1342.0}, {'u': 12, 'v': 9, 'w': 1069.0}, {'u': 8, 'v': 5, 'w': 1124.0}, {'u': 8, 'v': 10, 'w': 7014.0}, {'u': 14, 'v': 13, 'w': 25628.0}, {'u': 14, 'v': 2, 'w': 739.0}, {'u': 13, 'v': 1, 'w': 794.0}, {'u': 3, 'v': 0, 'w': 880.0}, {'u': 3, 'v': 4, 'w': 7828.0}, {'u': 4, 'v': 2, 'w': 1971.0}, {'u': 9, 'v': 5, 'w': 35282.0}, {'u': 9, 'v': 15, 'w': 1072.0}, {'u': 5, 'v': 6, 'w': 1034.0}, {'u': 6, 'v': 15, 'w': 35293.0}, {'u': 1, 'v': 2, 'w': 25423.0}], 'density': 0.175, 'source_file': 'I007.stp', 'k': 8}","[[7, 8], [3, 7], [10, 11], [5, 8], [8, 10], [0, 3], [5, 6]]",5,json,0
KMST,KMST,"Someone on the disaster team has to decide which supply depots to open and which roads to use so those depots form one tidy, loop-free network. The smarter choice is the one that keeps total driving distance down — calculated by summing the lengths of all roads that end up in the network. The rule is clear: pick the predetermined number of depots, make sure they’re all connected, and don’t create redundant circular routes. The detailed instance with distances and nodes appears below.
# total_locations=19
# total_roads=24
# depots_to_open=10
location_u,location_v,road_distance
13,2,16865.0
17,12,551.0
17,1,1409.0
17,18,452.0
18,11,856.0
18,1,1322.0
10,16,3278.0
10,11,878.0
10,7,1750.0
11,12,474.0
12,8,1500.0
6,7,387.0
6,8,565.0
7,14,2907.0
8,14,3015.0
4,5,789.0
4,16,14477.0
5,9,11191.0
0,2,528104.0
14,3,9989.0
16,15,4387.0
1,2,973.0
1,15,3225.0
9,15,16426.0
Also, to keep things easy for whoever's checking this, please give the picked roads in a tiny JSON sketch like this:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of each pair [uX, vX] as one road you plan to keep open between two depots — the whole ""solution"" list is the final loop-free network of k depots. This block is just the shape I need; don't treat these placeholders as the actual answer.
Please make sure you use the exact depot/node identifiers from the instance input — don't rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 24, 'edges': [{'u': 14, 'v': 3, 'w': 16865.0}, {'u': 18, 'v': 13, 'w': 551.0}, {'u': 18, 'v': 2, 'w': 1409.0}, {'u': 18, 'v': 19, 'w': 452.0}, {'u': 19, 'v': 12, 'w': 856.0}, {'u': 19, 'v': 2, 'w': 1322.0}, {'u': 11, 'v': 17, 'w': 3278.0}, {'u': 11, 'v': 12, 'w': 878.0}, {'u': 11, 'v': 8, 'w': 1750.0}, {'u': 12, 'v': 13, 'w': 474.0}, {'u': 13, 'v': 9, 'w': 1500.0}, {'u': 7, 'v': 8, 'w': 387.0}, {'u': 7, 'v': 9, 'w': 565.0}, {'u': 8, 'v': 15, 'w': 2907.0}, {'u': 9, 'v': 15, 'w': 3015.0}, {'u': 5, 'v': 6, 'w': 789.0}, {'u': 5, 'v': 17, 'w': 14477.0}, {'u': 6, 'v': 10, 'w': 11191.0}, {'u': 1, 'v': 3, 'w': 528104.0}, {'u': 15, 'v': 4, 'w': 9989.0}, {'u': 17, 'v': 16, 'w': 4387.0}, {'u': 2, 'v': 3, 'w': 973.0}, {'u': 2, 'v': 16, 'w': 3225.0}, {'u': 10, 'v': 16, 'w': 16426.0}], 'k': 10, 'source_file': 'I031.stp', 'density': 0.14035087719298245}","[[13, 18], [18, 19], [2, 19], [11, 12], [12, 13], [9, 13], [7, 8], [7, 9], [2, 3]]",7102.0,"{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 24, 'edges': [{'u': 13, 'v': 2, 'w': 16865.0}, {'u': 17, 'v': 12, 'w': 551.0}, {'u': 17, 'v': 1, 'w': 1409.0}, {'u': 17, 'v': 18, 'w': 452.0}, {'u': 18, 'v': 11, 'w': 856.0}, {'u': 18, 'v': 1, 'w': 1322.0}, {'u': 10, 'v': 16, 'w': 3278.0}, {'u': 10, 'v': 11, 'w': 878.0}, {'u': 10, 'v': 7, 'w': 1750.0}, {'u': 11, 'v': 12, 'w': 474.0}, {'u': 12, 'v': 8, 'w': 1500.0}, {'u': 6, 'v': 7, 'w': 387.0}, {'u': 6, 'v': 8, 'w': 565.0}, {'u': 7, 'v': 14, 'w': 2907.0}, {'u': 8, 'v': 14, 'w': 3015.0}, {'u': 4, 'v': 5, 'w': 789.0}, {'u': 4, 'v': 16, 'w': 14477.0}, {'u': 5, 'v': 9, 'w': 11191.0}, {'u': 0, 'v': 2, 'w': 528104.0}, {'u': 14, 'v': 3, 'w': 9989.0}, {'u': 16, 'v': 15, 'w': 4387.0}, {'u': 1, 'v': 2, 'w': 973.0}, {'u': 1, 'v': 15, 'w': 3225.0}, {'u': 9, 'v': 15, 'w': 16426.0}], 'density': 0.14035087719298245, 'source_file': 'I031.stp', 'k': 10}","[[12, 17], [17, 18], [1, 18], [10, 11], [11, 12], [8, 12], [6, 7], [6, 8], [1, 2]]",6,csv,0
KMST,KMST,"Back in the control room the challenge was laid out plainly: we must pick a set number of substations and string power lines so they form one connected grouping with no circular paths. A plan is judged by how little cable and installation cost it requires — total cost equals the sum of the lengths and installation costs of the chosen lines. The selection has to include exactly that many substations, tie them into one network, and avoid any closed circuits or redundancies. The concrete details will be shown below.
There are 16 substations and 20 available line segments; we must select exactly 6 substations to form one connected acyclic network.
We can build a line between substation 1 and 2 for cost 1741.0.
We can build a line between substation 1 and 14 for cost 263.0.
We can build a line between substation 2 and 4 for cost 597.0.
We can build a line between substation 3 and 4 for cost 1869.0.
We can build a line between substation 3 and 11 for cost 219.0.
We can build a line between substation 3 and 15 for cost 59.0.
We can build a line between substation 4 and 7 for cost 1135.0.
We can build a line between substation 5 and 10 for cost 293.0.
We can build a line between substation 6 and 7 for cost 1387.0.
We can build a line between substation 6 and 16 for cost 554.0.
We can build a line between substation 6 and 8 for cost 621.0.
We can build a line between substation 7 and 9 for cost 1832.0.
We can build a line between substation 8 and 13 for cost 563.0.
We can build a line between substation 14 and 11 for cost 285.0.
We can build a line between substation 14 and 10 for cost 105.0.
We can build a line between substation 15 and 12 for cost 523.0.
We can build a line between substation 15 and 16 for cost 498.0.
We can build a line between substation 16 and 13 for cost 598.0.
We can build a line between substation 10 and 11 for cost 246.0.
We can build a line between substation 12 and 13 for cost 485.0.
We will evaluate these candidates to assemble the minimal-cost 6-substation tree.
Oh, and when you send back the plan, just put it in this shape so I can read it automatically:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is a list of the power lines you picked; each little pair like [u1, v1] is one line connecting the two substations named u1 and v1. It's just a quick form — the actual answer should be the real list of edges from the instance.
Please use the exact identifiers from the instance input — don't rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 1, 'v': 2, 'w': 1741.0}, {'u': 1, 'v': 14, 'w': 263.0}, {'u': 2, 'v': 4, 'w': 597.0}, {'u': 3, 'v': 4, 'w': 1869.0}, {'u': 3, 'v': 11, 'w': 219.0}, {'u': 3, 'v': 15, 'w': 59.0}, {'u': 4, 'v': 7, 'w': 1135.0}, {'u': 5, 'v': 10, 'w': 293.0}, {'u': 6, 'v': 7, 'w': 1387.0}, {'u': 6, 'v': 16, 'w': 554.0}, {'u': 6, 'v': 8, 'w': 621.0}, {'u': 7, 'v': 9, 'w': 1832.0}, {'u': 8, 'v': 13, 'w': 563.0}, {'u': 14, 'v': 11, 'w': 285.0}, {'u': 14, 'v': 10, 'w': 105.0}, {'u': 15, 'v': 12, 'w': 523.0}, {'u': 15, 'v': 16, 'w': 498.0}, {'u': 16, 'v': 13, 'w': 598.0}, {'u': 10, 'v': 11, 'w': 246.0}, {'u': 12, 'v': 13, 'w': 485.0}], 'k': 6, 'source_file': 'I052.stp', 'density': 0.16666666666666666}","[[1, 14], [3, 11], [3, 15], [10, 14], [10, 11]]",892.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 1, 'v': 2, 'w': 1741.0}, {'u': 1, 'v': 14, 'w': 263.0}, {'u': 2, 'v': 4, 'w': 597.0}, {'u': 3, 'v': 4, 'w': 1869.0}, {'u': 3, 'v': 11, 'w': 219.0}, {'u': 3, 'v': 15, 'w': 59.0}, {'u': 4, 'v': 7, 'w': 1135.0}, {'u': 5, 'v': 10, 'w': 293.0}, {'u': 6, 'v': 7, 'w': 1387.0}, {'u': 6, 'v': 16, 'w': 554.0}, {'u': 6, 'v': 8, 'w': 621.0}, {'u': 7, 'v': 9, 'w': 1832.0}, {'u': 8, 'v': 13, 'w': 563.0}, {'u': 14, 'v': 11, 'w': 285.0}, {'u': 14, 'v': 10, 'w': 105.0}, {'u': 15, 'v': 12, 'w': 523.0}, {'u': 15, 'v': 16, 'w': 498.0}, {'u': 16, 'v': 13, 'w': 598.0}, {'u': 10, 'v': 11, 'w': 246.0}, {'u': 12, 'v': 13, 'w': 485.0}], 'density': 0.16666666666666666, 'source_file': 'I052.stp', 'k': 6}","[[1, 14], [3, 11], [3, 15], [10, 14], [10, 11]]",7,nl,1
KMST,KMST,"Recently the operations team was asked to pick a specific number of warehouses and sketch shuttle paths between them so they form one continuous network without any loops. What counts as a better sketch is straightforward: measure every route, add those distances together, and the smallest total wins. The chosen number of warehouses must be met exactly and no circular or duplicate routes are allowed. The exact data on warehouses and route lengths appears below.
# total_warehouses_available=17
# total_possible_routes_listed=22
# warehouses_to_select=8
warehouse_endpoint_a,warehouse_endpoint_b,route_distance
6,9,825.0
7,1,485.0
7,8,369.0
7,2,231.0
7,10,339.0
16,9,562.0
16,11,525.0
0,11,302.0
0,12,170.0
0,5,189882.0
1,5,189973.0
1,9,1088.0
3,2,528.0
3,12,326.0
3,13,360.0
2,4,387.0
8,4,230.0
8,10,495.0
14,12,503.0
14,15,1036.0
14,11,937.0
4,13,509.0
Just drop your chosen edges into this simple JSON shape when you're ready — it's just a tiny, predictable form so whatever reads it knows where to look.
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of ""solution"" as the list of shuttle paths you picked. Each inner pair like [u1, v1] is one route connecting two warehouses (the two IDs go in there). This is only a sketch of the shape I need, not the actual answer — you'll replace those placeholders with the real IDs from the instance.
Please make sure to use the exact identifiers from the input, without renaming or inventing new ones.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 22, 'edges': [{'u': 7, 'v': 10, 'w': 825.0}, {'u': 8, 'v': 2, 'w': 485.0}, {'u': 8, 'v': 9, 'w': 369.0}, {'u': 8, 'v': 3, 'w': 231.0}, {'u': 8, 'v': 11, 'w': 339.0}, {'u': 17, 'v': 10, 'w': 562.0}, {'u': 17, 'v': 12, 'w': 525.0}, {'u': 1, 'v': 12, 'w': 302.0}, {'u': 1, 'v': 13, 'w': 170.0}, {'u': 1, 'v': 6, 'w': 189882.0}, {'u': 2, 'v': 6, 'w': 189973.0}, {'u': 2, 'v': 10, 'w': 1088.0}, {'u': 4, 'v': 3, 'w': 528.0}, {'u': 4, 'v': 13, 'w': 326.0}, {'u': 4, 'v': 14, 'w': 360.0}, {'u': 3, 'v': 5, 'w': 387.0}, {'u': 9, 'v': 5, 'w': 230.0}, {'u': 9, 'v': 11, 'w': 495.0}, {'u': 15, 'v': 13, 'w': 503.0}, {'u': 15, 'v': 16, 'w': 1036.0}, {'u': 15, 'v': 12, 'w': 937.0}, {'u': 5, 'v': 14, 'w': 509.0}], 'k': 8, 'source_file': 'I037.stp', 'density': 0.16176470588235295}","[[8, 9], [3, 8], [1, 12], [1, 13], [3, 4], [4, 13], [5, 9]]",2156.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 22, 'edges': [{'u': 6, 'v': 9, 'w': 825.0}, {'u': 7, 'v': 1, 'w': 485.0}, {'u': 7, 'v': 8, 'w': 369.0}, {'u': 7, 'v': 2, 'w': 231.0}, {'u': 7, 'v': 10, 'w': 339.0}, {'u': 16, 'v': 9, 'w': 562.0}, {'u': 16, 'v': 11, 'w': 525.0}, {'u': 0, 'v': 11, 'w': 302.0}, {'u': 0, 'v': 12, 'w': 170.0}, {'u': 0, 'v': 5, 'w': 189882.0}, {'u': 1, 'v': 5, 'w': 189973.0}, {'u': 1, 'v': 9, 'w': 1088.0}, {'u': 3, 'v': 2, 'w': 528.0}, {'u': 3, 'v': 12, 'w': 326.0}, {'u': 3, 'v': 13, 'w': 360.0}, {'u': 2, 'v': 4, 'w': 387.0}, {'u': 8, 'v': 4, 'w': 230.0}, {'u': 8, 'v': 10, 'w': 495.0}, {'u': 14, 'v': 12, 'w': 503.0}, {'u': 14, 'v': 15, 'w': 1036.0}, {'u': 14, 'v': 11, 'w': 937.0}, {'u': 4, 'v': 13, 'w': 509.0}], 'density': 0.16176470588235295, 'source_file': 'I037.stp', 'k': 8}","[[7, 8], [2, 7], [0, 11], [0, 12], [2, 3], [3, 12], [4, 8]]",8,csv,0
KMST,KMST,"Someone on the trail crew needs to pick a handful of scenic spots and connect them with new trails and bridges so the selected spots make a single connected system without any circular detours. The better the choice, the less total track to build — compute that by summing the lengths of every installed connector — and the team must include precisely the set number of viewpoints and avoid leaving gaps or creating duplicate/looping connections. Details for the specific case are shown below.
There are 20 available viewpoints, 26 potential connectors, and the crew must include exactly 6 viewpoints.
Potential connector between viewpoint J and viewpoint K with installation length 1068.0.
Potential connector between viewpoint J and viewpoint P with installation length 6101.0.
Potential connector between viewpoint J and viewpoint N with installation length 540.0.
Potential connector between viewpoint K and viewpoint F with installation length 1190.0.
Potential connector between viewpoint K and viewpoint T with installation length 6164.0.
Potential connector between viewpoint L and viewpoint M with installation length 1088.0.
Potential connector between viewpoint L and viewpoint N with installation length 586.0.
Potential connector between viewpoint L and viewpoint O with installation length 6149.0.
Potential connector between viewpoint M and viewpoint G with installation length 6216.0.
Potential connector between viewpoint S and viewpoint F with installation length 6022.0.
Potential connector between viewpoint S and viewpoint R with installation length 1170.0.
Potential connector between viewpoint S and viewpoint T with installation length 1187.0.
Potential connector between viewpoint T and viewpoint P with installation length 1018.0.
Potential connector between viewpoint N and viewpoint Q with installation length 6053.0.
Potential connector between viewpoint O and viewpoint Q with installation length 595.0.
Potential connector between viewpoint O and viewpoint G with installation length 1137.0.
Potential connector between viewpoint P and viewpoint Q with installation length 505.0.
Potential connector between viewpoint R and viewpoint E with installation length 5393.0.
Potential connector between viewpoint R and viewpoint I with installation length 1726.0.
Potential connector between viewpoint C and viewpoint I with installation length 1349.0.
Potential connector between viewpoint A and viewpoint B with installation length 528.0.
Potential connector between viewpoint A and viewpoint D with installation length 1819.0.
Potential connector between viewpoint B and viewpoint E with installation length 91.0.
Potential connector between viewpoint B and viewpoint F with installation length 1377.0.
Potential connector between viewpoint E and viewpoint H with installation length 1822.0.
Potential connector between viewpoint H and viewpoint I with installation length 5018.0.
Select connectors so the chosen 6 viewpoints form one connected, acyclic trail system minimizing the total installed length.
When you hand the chosen trail segments back, just put them in a tiny JSON snippet so it's easy to read and parse. Something like this will do:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
This ""solution"" field is just the list of connectors you'll build; each pair [u, v] is a single trail or bridge linking two viewpoints (use the exact labels from the instance). The block above is only a sketch of the expected shape — not the actual answer itself.
Please use the identifiers exactly as they appear in the instance input — do not rename them or invent new ones.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 26, 'edges': [{'u': 10, 'v': 11, 'w': 1068.0}, {'u': 10, 'v': 16, 'w': 6101.0}, {'u': 10, 'v': 14, 'w': 540.0}, {'u': 11, 'v': 6, 'w': 1190.0}, {'u': 11, 'v': 20, 'w': 6164.0}, {'u': 12, 'v': 13, 'w': 1088.0}, {'u': 12, 'v': 14, 'w': 586.0}, {'u': 12, 'v': 15, 'w': 6149.0}, {'u': 13, 'v': 7, 'w': 6216.0}, {'u': 19, 'v': 6, 'w': 6022.0}, {'u': 19, 'v': 18, 'w': 1170.0}, {'u': 19, 'v': 20, 'w': 1187.0}, {'u': 20, 'v': 16, 'w': 1018.0}, {'u': 14, 'v': 17, 'w': 6053.0}, {'u': 15, 'v': 17, 'w': 595.0}, {'u': 15, 'v': 7, 'w': 1137.0}, {'u': 16, 'v': 17, 'w': 505.0}, {'u': 18, 'v': 5, 'w': 5393.0}, {'u': 18, 'v': 9, 'w': 1726.0}, {'u': 3, 'v': 9, 'w': 1349.0}, {'u': 1, 'v': 2, 'w': 528.0}, {'u': 1, 'v': 4, 'w': 1819.0}, {'u': 2, 'v': 5, 'w': 91.0}, {'u': 2, 'v': 6, 'w': 1377.0}, {'u': 5, 'v': 8, 'w': 1822.0}, {'u': 8, 'v': 9, 'w': 5018.0}], 'k': 6, 'source_file': 'I050.stp', 'density': 0.1368421052631579}","[[10, 11], [6, 11], [1, 2], [2, 5], [2, 6]]",4254.0,"{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 26, 'edges': [{'u': 'J', 'v': 'K', 'w': 1068.0}, {'u': 'J', 'v': 'P', 'w': 6101.0}, {'u': 'J', 'v': 'N', 'w': 540.0}, {'u': 'K', 'v': 'F', 'w': 1190.0}, {'u': 'K', 'v': 'T', 'w': 6164.0}, {'u': 'L', 'v': 'M', 'w': 1088.0}, {'u': 'L', 'v': 'N', 'w': 586.0}, {'u': 'L', 'v': 'O', 'w': 6149.0}, {'u': 'M', 'v': 'G', 'w': 6216.0}, {'u': 'S', 'v': 'F', 'w': 6022.0}, {'u': 'S', 'v': 'R', 'w': 1170.0}, {'u': 'S', 'v': 'T', 'w': 1187.0}, {'u': 'T', 'v': 'P', 'w': 1018.0}, {'u': 'N', 'v': 'Q', 'w': 6053.0}, {'u': 'O', 'v': 'Q', 'w': 595.0}, {'u': 'O', 'v': 'G', 'w': 1137.0}, {'u': 'P', 'v': 'Q', 'w': 505.0}, {'u': 'R', 'v': 'E', 'w': 5393.0}, {'u': 'R', 'v': 'I', 'w': 1726.0}, {'u': 'C', 'v': 'I', 'w': 1349.0}, {'u': 'A', 'v': 'B', 'w': 528.0}, {'u': 'A', 'v': 'D', 'w': 1819.0}, {'u': 'B', 'v': 'E', 'w': 91.0}, {'u': 'B', 'v': 'F', 'w': 1377.0}, {'u': 'E', 'v': 'H', 'w': 1822.0}, {'u': 'H', 'v': 'I', 'w': 5018.0}], 'density': 0.1368421052631579, 'source_file': 'I050.stp', 'k': 6}","[['J', 'K'], ['F', 'K'], ['A', 'B'], ['B', 'E'], ['B', 'F']]",9,nl,names
KMST,KMST,"Many coastal planners face the same choice: pick exactly a set number of docks and connect them with direct ferry legs so all picked docks are connected together, but never in a loop. The straightforward score for any plan is just the sum of the lengths of its legs — lower is better — and the chosen plan must include exactly that many docks, keep each dock unique in the plan, and avoid closed circuits. The precise figures and map are given below.
# total_docks=16
# total_route_options=20
# docks_to_select=8
dock_u,dock_v,route_distance
H,G,351.0
H,B,547.0
H,L,419.0
H,E,432.0
I,J,562.0
I,A,221.0
I,M,640.0
J,O,45.0
J,N,582.0
L,K,222.0
L,C,638.0
E,F,498.0
F,G,407.0
K,G,318.0
M,C,119.0
M,N,496.0
C,B,553.0
N,P,264.0
P,D,515.0
D,B,902.0
Oh, and when you send back your plan, please stick to this little JSON layout so it's easy to read and check:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of ""solution"" as the list of ferry legs you picked. Each inner pair like [u1, v1] is one direct leg connecting the two dock identifiers u1 and v1. This is just a sketch of the shape I expect — not your final answer.
Please make sure to use the exact dock identifiers from the instance input, with no renaming and no new labels. Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 8, 'v': 7, 'w': 351.0}, {'u': 8, 'v': 2, 'w': 547.0}, {'u': 8, 'v': 12, 'w': 419.0}, {'u': 8, 'v': 5, 'w': 432.0}, {'u': 9, 'v': 10, 'w': 562.0}, {'u': 9, 'v': 1, 'w': 221.0}, {'u': 9, 'v': 13, 'w': 640.0}, {'u': 10, 'v': 15, 'w': 45.0}, {'u': 10, 'v': 14, 'w': 582.0}, {'u': 12, 'v': 11, 'w': 222.0}, {'u': 12, 'v': 3, 'w': 638.0}, {'u': 5, 'v': 6, 'w': 498.0}, {'u': 6, 'v': 7, 'w': 407.0}, {'u': 11, 'v': 7, 'w': 318.0}, {'u': 13, 'v': 3, 'w': 119.0}, {'u': 13, 'v': 14, 'w': 496.0}, {'u': 3, 'v': 2, 'w': 553.0}, {'u': 14, 'v': 16, 'w': 264.0}, {'u': 16, 'v': 4, 'w': 515.0}, {'u': 4, 'v': 2, 'w': 902.0}], 'k': 8, 'source_file': 'I061.stp', 'density': 0.16666666666666666}","[[9, 10], [1, 9], [10, 15], [10, 14], [3, 13], [13, 14], [14, 16]]",2289.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 'H', 'v': 'G', 'w': 351.0}, {'u': 'H', 'v': 'B', 'w': 547.0}, {'u': 'H', 'v': 'L', 'w': 419.0}, {'u': 'H', 'v': 'E', 'w': 432.0}, {'u': 'I', 'v': 'J', 'w': 562.0}, {'u': 'I', 'v': 'A', 'w': 221.0}, {'u': 'I', 'v': 'M', 'w': 640.0}, {'u': 'J', 'v': 'O', 'w': 45.0}, {'u': 'J', 'v': 'N', 'w': 582.0}, {'u': 'L', 'v': 'K', 'w': 222.0}, {'u': 'L', 'v': 'C', 'w': 638.0}, {'u': 'E', 'v': 'F', 'w': 498.0}, {'u': 'F', 'v': 'G', 'w': 407.0}, {'u': 'K', 'v': 'G', 'w': 318.0}, {'u': 'M', 'v': 'C', 'w': 119.0}, {'u': 'M', 'v': 'N', 'w': 496.0}, {'u': 'C', 'v': 'B', 'w': 553.0}, {'u': 'N', 'v': 'P', 'w': 264.0}, {'u': 'P', 'v': 'D', 'w': 515.0}, {'u': 'D', 'v': 'B', 'w': 902.0}], 'density': 0.16666666666666666, 'source_file': 'I061.stp', 'k': 8}","[['I', 'J'], ['A', 'I'], ['J', 'O'], ['J', 'N'], ['C', 'M'], ['M', 'N'], ['N', 'P']]",10,csv,names
KMST,KMST,"Recently a team decided they’d pick a fixed number of habitat patches and create corridors so those patches are all connected, but without extra looping routes that just waste length. Plans are scored by adding up every corridor’s length; the goal is the smallest possible total while including exactly the required number of patches and not duplicating connections. The particular instance and measurements are shown below.
There are 17 habitat patches, 21 candidate corridors measured, and the team must include exactly 8 patches in the connected network.
Corridor connecting patch 0 and patch 9 has length 7847.0.
Corridor connecting patch 0 and patch 1 has length 14629.0.
Corridor connecting patch 1 and patch 11 has length 3151.0.
Corridor connecting patch 1 and patch 7 has length 18411.0.
Corridor connecting patch 2 and patch 3 has length 325.0.
Corridor connecting patch 2 and patch 5 has length 624.0.
Corridor connecting patch 2 and patch 13 has length 11258.0.
Corridor connecting patch 3 and patch 14 has length 11495.0.
Corridor connecting patch 3 and patch 4 has length 629.0.
Corridor connecting patch 4 and patch 5 has length 359.0.
Corridor connecting patch 4 and patch 7 has length 3539.0.
Corridor connecting patch 4 and patch 6 has length 5478.0.
Corridor connecting patch 5 and patch 16 has length 12495.0.
Corridor connecting patch 14 and patch 13 has length 717.0.
Corridor connecting patch 14 and patch 8 has length 186.0.
Corridor connecting patch 13 and patch 12 has length 369.0.
Corridor connecting patch 6 and patch 7 has length 2135.0.
Corridor connecting patch 10 and patch 15 has length 2231.0.
Corridor connecting patch 10 and patch 11 has length 5762.0.
Corridor connecting patch 16 and patch 11 has length 3942.0.
Corridor connecting patch 16 and patch 15 has length 9992.0.
These measurements list the candidate corridors available for the team's selection.
If you want the corridors listed back in a compact way, I usually give them in a tiny JSON sketch like this so it’s easy to parse:
{
""solution"": [[""patch1"", ""patch2""], [""patch3"", ""patch4""], [""patch5"", ""patch6""], ...]
}
Each inner pair is just one corridor linking two habitat patches, and the whole ""solution"" list is the set of corridors you’d build. This block is only a shape example — not the actual chosen corridors.
Please use the exact identifiers from the instance input when you give the real answer — don’t rename patches or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 21, 'edges': [{'u': 1, 'v': 10, 'w': 7847.0}, {'u': 1, 'v': 2, 'w': 14629.0}, {'u': 2, 'v': 12, 'w': 3151.0}, {'u': 2, 'v': 8, 'w': 18411.0}, {'u': 3, 'v': 4, 'w': 325.0}, {'u': 3, 'v': 6, 'w': 624.0}, {'u': 3, 'v': 14, 'w': 11258.0}, {'u': 4, 'v': 15, 'w': 11495.0}, {'u': 4, 'v': 5, 'w': 629.0}, {'u': 5, 'v': 6, 'w': 359.0}, {'u': 5, 'v': 8, 'w': 3539.0}, {'u': 5, 'v': 7, 'w': 5478.0}, {'u': 6, 'v': 17, 'w': 12495.0}, {'u': 15, 'v': 14, 'w': 717.0}, {'u': 15, 'v': 9, 'w': 186.0}, {'u': 14, 'v': 13, 'w': 369.0}, {'u': 7, 'v': 8, 'w': 2135.0}, {'u': 11, 'v': 16, 'w': 2231.0}, {'u': 11, 'v': 12, 'w': 5762.0}, {'u': 17, 'v': 12, 'w': 3942.0}, {'u': 17, 'v': 16, 'w': 9992.0}], 'k': 8, 'source_file': 'I075.stp', 'density': 0.15441176470588236}","[[3, 4], [3, 6], [3, 14], [5, 6], [14, 15], [9, 15], [13, 14]]",13838.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 21, 'edges': [{'u': 0, 'v': 9, 'w': 7847.0}, {'u': 0, 'v': 1, 'w': 14629.0}, {'u': 1, 'v': 11, 'w': 3151.0}, {'u': 1, 'v': 7, 'w': 18411.0}, {'u': 2, 'v': 3, 'w': 325.0}, {'u': 2, 'v': 5, 'w': 624.0}, {'u': 2, 'v': 13, 'w': 11258.0}, {'u': 3, 'v': 14, 'w': 11495.0}, {'u': 3, 'v': 4, 'w': 629.0}, {'u': 4, 'v': 5, 'w': 359.0}, {'u': 4, 'v': 7, 'w': 3539.0}, {'u': 4, 'v': 6, 'w': 5478.0}, {'u': 5, 'v': 16, 'w': 12495.0}, {'u': 14, 'v': 13, 'w': 717.0}, {'u': 14, 'v': 8, 'w': 186.0}, {'u': 13, 'v': 12, 'w': 369.0}, {'u': 6, 'v': 7, 'w': 2135.0}, {'u': 10, 'v': 15, 'w': 2231.0}, {'u': 10, 'v': 11, 'w': 5762.0}, {'u': 16, 'v': 11, 'w': 3942.0}, {'u': 16, 'v': 15, 'w': 9992.0}], 'density': 0.15441176470588236, 'source_file': 'I075.stp', 'k': 8}","[[2, 3], [2, 5], [2, 13], [4, 5], [13, 14], [8, 14], [12, 13]]",11,markdown_table,0
KMST,KMST,"Imagine laying out the festival’s utilities: choose exactly a set number of booths to serve, run lines between them so they’re all linked together with no circular paths, and aim to use the shortest total length of cable possible — just add up the lengths of the connections you’d install to compare layouts. No booth in the chosen set can be left out or connected more than once; they all need to sit in one connected system. The precise layout and distances are below.
# total_booths=20
# total_possible_lines=27
# booths_to_serve=6
booth_u,booth_v,line_length
E,D,11173.0
E,J,932.0
E,K,733.0
G,A,11273.0
G,F,507.0
G,O,1222.0
F,D,728.0
F,K,11384.0
I,H,11018.0
I,O,242.0
I,S,1499.0
H,T,1459.0
H,A,1391.0
O,P,11799.0
P,K,1683.0
P,L,1737.0
B,T,1363.0
B,R,10511.0
L,M,1354.0
L,S,12069.0
M,R,12338.0
M,N,1237.0
R,S,1459.0
A,Q,1467.0
S,T,10822.0
C,D,269.0
C,Q,11565.0
If you want to sketch a candidate layout back to me, just drop it in a tiny JSON blob like this:
{
""solution"": [[""u1"", ""v1""], [""u2"", ""v2""], ...]
}
Think of ""solution"" as a list of the cable runs you’d install — each inner pair is one connection between two booths/nodes. This is just the shape I expect (a simple list of edges), not the actual final answer.
Please make sure to use the exact identifiers from the instance input — don’t rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 27, 'edges': [{'u': 5, 'v': 4, 'w': 11173.0}, {'u': 5, 'v': 10, 'w': 932.0}, {'u': 5, 'v': 11, 'w': 733.0}, {'u': 7, 'v': 1, 'w': 11273.0}, {'u': 7, 'v': 6, 'w': 507.0}, {'u': 7, 'v': 15, 'w': 1222.0}, {'u': 6, 'v': 4, 'w': 728.0}, {'u': 6, 'v': 11, 'w': 11384.0}, {'u': 9, 'v': 8, 'w': 11018.0}, {'u': 9, 'v': 15, 'w': 242.0}, {'u': 9, 'v': 19, 'w': 1499.0}, {'u': 8, 'v': 20, 'w': 1459.0}, {'u': 8, 'v': 1, 'w': 1391.0}, {'u': 15, 'v': 16, 'w': 11799.0}, {'u': 16, 'v': 11, 'w': 1683.0}, {'u': 16, 'v': 12, 'w': 1737.0}, {'u': 2, 'v': 20, 'w': 1363.0}, {'u': 2, 'v': 18, 'w': 10511.0}, {'u': 12, 'v': 13, 'w': 1354.0}, {'u': 12, 'v': 19, 'w': 12069.0}, {'u': 13, 'v': 18, 'w': 12338.0}, {'u': 13, 'v': 14, 'w': 1237.0}, {'u': 18, 'v': 19, 'w': 1459.0}, {'u': 1, 'v': 17, 'w': 1467.0}, {'u': 19, 'v': 20, 'w': 10822.0}, {'u': 3, 'v': 4, 'w': 269.0}, {'u': 3, 'v': 17, 'w': 11565.0}], 'k': 6, 'source_file': 'I023.stp', 'density': 0.14210526315789473}","[[6, 7], [7, 15], [4, 6], [9, 15], [3, 4]]",2968.0,"{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 27, 'edges': [{'u': 'E', 'v': 'D', 'w': 11173.0}, {'u': 'E', 'v': 'J', 'w': 932.0}, {'u': 'E', 'v': 'K', 'w': 733.0}, {'u': 'G', 'v': 'A', 'w': 11273.0}, {'u': 'G', 'v': 'F', 'w': 507.0}, {'u': 'G', 'v': 'O', 'w': 1222.0}, {'u': 'F', 'v': 'D', 'w': 728.0}, {'u': 'F', 'v': 'K', 'w': 11384.0}, {'u': 'I', 'v': 'H', 'w': 11018.0}, {'u': 'I', 'v': 'O', 'w': 242.0}, {'u': 'I', 'v': 'S', 'w': 1499.0}, {'u': 'H', 'v': 'T', 'w': 1459.0}, {'u': 'H', 'v': 'A', 'w': 1391.0}, {'u': 'O', 'v': 'P', 'w': 11799.0}, {'u': 'P', 'v': 'K', 'w': 1683.0}, {'u': 'P', 'v': 'L', 'w': 1737.0}, {'u': 'B', 'v': 'T', 'w': 1363.0}, {'u': 'B', 'v': 'R', 'w': 10511.0}, {'u': 'L', 'v': 'M', 'w': 1354.0}, {'u': 'L', 'v': 'S', 'w': 12069.0}, {'u': 'M', 'v': 'R', 'w': 12338.0}, {'u': 'M', 'v': 'N', 'w': 1237.0}, {'u': 'R', 'v': 'S', 'w': 1459.0}, {'u': 'A', 'v': 'Q', 'w': 1467.0}, {'u': 'S', 'v': 'T', 'w': 10822.0}, {'u': 'C', 'v': 'D', 'w': 269.0}, {'u': 'C', 'v': 'Q', 'w': 11565.0}], 'density': 0.14210526315789473, 'source_file': 'I023.stp', 'k': 6}","[['F', 'G'], ['G', 'O'], ['D', 'F'], ['I', 'O'], ['C', 'D']]",12,csv,names
KMST,KMST,"Around here the job is to choose exactly k stops and lay down sidewalks so the chosen stops become one continuous, loop-free network for students to use. The cost to compare different layouts is the total sidewalk length — just add up the lengths of the chosen links — and the aim is to make that sum as small as possible while including exactly the required stops and not creating any closed loops or double-counted stretches. The precise map and lengths are shown below.
{
""total_bus_stops"": 17,
""candidate_sidewalk_segments"": 21,
""edges"": [
{
""stop_u"": 4,
""stop_v"": 6,
""sidewalk_length"": 2280.0
},
{
""stop_u"": 7,
""stop_v"": 1,
""sidewalk_length"": 2813.0
},
{
""stop_u"": 7,
""stop_v"": 13,
""sidewalk_length"": 1201.0
},
{
""stop_u"": 7,
""stop_v"": 9,
""sidewalk_length"": 3621.0
},
{
""stop_u"": 5,
""stop_v"": 12,
""sidewalk_length"": 4771.0
},
{
""stop_u"": 6,
""stop_v"": 15,
""sidewalk_length"": 7399.0
},
{
""stop_u"": 6,
""stop_v"": 8,
""sidewalk_length"": 1799.0
},
{
""stop_u"": 8,
""stop_v"": 9,
""sidewalk_length"": 7404.0
},
{
""stop_u"": 8,
""stop_v"": 1,
""sidewalk_length"": 5522.0
},
{
""stop_u"": 9,
""stop_v"": 10,
""sidewalk_length"": 2736.0
},
{
""stop_u"": 10,
""stop_v"": 11,
""sidewalk_length"": 2529.0
},
{
""stop_u"": 10,
""stop_v"": 12,
""sidewalk_length"": 2757.0
},
{
""stop_u"": 11,
""stop_v"": 15,
""sidewalk_length"": 230.0
},
{
""stop_u"": 11,
""stop_v"": 12,
""sidewalk_length"": 563.0
},
{
""stop_u"": 13,
""stop_v"": 14,
""sidewalk_length"": 2485.0
},
{
""stop_u"": 13,
""stop_v"": 17,
""sidewalk_length"": 9539.0
},
{
""stop_u"": 14,
""stop_v"": 3,
""sidewalk_length"": 13329.0
},
{
""stop_u"": 14,
""stop_v"": 1,
""sidewalk_length"": 1167.0
},
{
""stop_u"": 12,
""stop_v"": 16,
""sidewalk_length"": 1307.0
},
{
""stop_u"": 15,
""stop_v"": 16,
""sidewalk_length"": 1001.0
},
{
""stop_u"": 1,
""stop_v"": 2,
""sidewalk_length"": 881.0
}
],
""required_stops_count"": 7
}
You can just hand the chosen sidewalk segments over in a tiny JSON snippet like this:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of ""solution"" as the list of sidewalk links you picked — each pair [u, v] is one connection between stop u and stop v. This block is just the shape I expect, not the real answer: replace those u1/v1 placeholders with the actual node identifiers from the instance.
Please use the identifiers exactly as they appear in the input file — no renaming, no made-up labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 21, 'edges': [{'u': 4, 'v': 6, 'w': 2280.0}, {'u': 7, 'v': 1, 'w': 2813.0}, {'u': 7, 'v': 13, 'w': 1201.0}, {'u': 7, 'v': 9, 'w': 3621.0}, {'u': 5, 'v': 12, 'w': 4771.0}, {'u': 6, 'v': 15, 'w': 7399.0}, {'u': 6, 'v': 8, 'w': 1799.0}, {'u': 8, 'v': 9, 'w': 7404.0}, {'u': 8, 'v': 1, 'w': 5522.0}, {'u': 9, 'v': 10, 'w': 2736.0}, {'u': 10, 'v': 11, 'w': 2529.0}, {'u': 10, 'v': 12, 'w': 2757.0}, {'u': 11, 'v': 15, 'w': 230.0}, {'u': 11, 'v': 12, 'w': 563.0}, {'u': 13, 'v': 14, 'w': 2485.0}, {'u': 13, 'v': 17, 'w': 9539.0}, {'u': 14, 'v': 3, 'w': 13329.0}, {'u': 14, 'v': 1, 'w': 1167.0}, {'u': 12, 'v': 16, 'w': 1307.0}, {'u': 15, 'v': 16, 'w': 1001.0}, {'u': 1, 'v': 2, 'w': 881.0}], 'k': 7, 'source_file': 'I045.stp', 'density': 0.15441176470588236}","[[7, 9], [9, 10], [10, 11], [11, 15], [11, 12], [15, 16]]",10680.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 21, 'edges': [{'u': 4, 'v': 6, 'w': 2280.0}, {'u': 7, 'v': 1, 'w': 2813.0}, {'u': 7, 'v': 13, 'w': 1201.0}, {'u': 7, 'v': 9, 'w': 3621.0}, {'u': 5, 'v': 12, 'w': 4771.0}, {'u': 6, 'v': 15, 'w': 7399.0}, {'u': 6, 'v': 8, 'w': 1799.0}, {'u': 8, 'v': 9, 'w': 7404.0}, {'u': 8, 'v': 1, 'w': 5522.0}, {'u': 9, 'v': 10, 'w': 2736.0}, {'u': 10, 'v': 11, 'w': 2529.0}, {'u': 10, 'v': 12, 'w': 2757.0}, {'u': 11, 'v': 15, 'w': 230.0}, {'u': 11, 'v': 12, 'w': 563.0}, {'u': 13, 'v': 14, 'w': 2485.0}, {'u': 13, 'v': 17, 'w': 9539.0}, {'u': 14, 'v': 3, 'w': 13329.0}, {'u': 14, 'v': 1, 'w': 1167.0}, {'u': 12, 'v': 16, 'w': 1307.0}, {'u': 15, 'v': 16, 'w': 1001.0}, {'u': 1, 'v': 2, 'w': 881.0}], 'density': 0.15441176470588236, 'source_file': 'I045.stp', 'k': 7}","[[7, 9], [9, 10], [10, 11], [11, 15], [11, 12], [15, 16]]",13,json,1
KMST,KMST,"Many people imagine a dig where the director just opens every route, but here the task is tighter: choose a set number of sites and link them with pathways that don’t double back into loops. The better choice is the one with the least combined path length — total everything up and choose the smallest total. Exactly the predetermined number of sites must be used, they all need to be connected, and no circular or repeated tracks are allowed. The concrete site list and the path distances follow below.
There are 20 possible sites, 23 candidate tracks, and the director must select exactly 6 sites to interconnect without forming loops.
Candidate access track between site A and site T with length 252.0.
Candidate access track between site A and site J with length 1496.0.
Candidate access track between site A and site P with length 1513.0.
Candidate access track between site S and site N with length 498.0.
Candidate access track between site S and site C with length 360.0.
Candidate access track between site D and site E with length 1682.0.
Candidate access track between site D and site F with length 794.0.
Candidate access track between site D and site K with length 237564.0.
Candidate access track between site E and site L with length 1409.0.
Candidate access track between site F and site M with length 89.0.
Candidate access track between site F and site N with length 646.0.
Candidate access track between site G and site H with length 1539.0.
Candidate access track between site G and site K with length 238057.0.
Candidate access track between site G and site O with length 563.0.
Candidate access track between site B and site R with length 1926.0.
Candidate access track between site B and site C with length 1953.0.
Candidate access track between site H and site T with length 563.0.
Candidate access track between site H and site R with length 854.0.
Candidate access track between site C and site R with length 92.0.
Candidate access track between site J and site I with length 577.0.
Candidate access track between site T and site O with length 1522.0.
Candidate access track between site O and site P with length 298.0.
Candidate access track between site P and site Q with length 222.0.
The director will choose the 6 sites whose connecting tracks produce the smallest combined length.
I'll just show the shape I want back — a tiny JSON snippet so it's clear how to paste the chosen edges. Nothing fancy, just the layout:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
This means ""solution"" should be a list of edges, and each inner pair [u, v] is an edge connecting site u to site v. Think of it like a simple checklist: list the links you picked, one pair per link. It's just a sketch of the shape I expect, not the real answer.
Please use the exact identifiers from the instance input — do not rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 23, 'edges': [{'u': 1, 'v': 20, 'w': 252.0}, {'u': 1, 'v': 10, 'w': 1496.0}, {'u': 1, 'v': 16, 'w': 1513.0}, {'u': 19, 'v': 14, 'w': 498.0}, {'u': 19, 'v': 3, 'w': 360.0}, {'u': 4, 'v': 5, 'w': 1682.0}, {'u': 4, 'v': 6, 'w': 794.0}, {'u': 4, 'v': 11, 'w': 237564.0}, {'u': 5, 'v': 12, 'w': 1409.0}, {'u': 6, 'v': 13, 'w': 89.0}, {'u': 6, 'v': 14, 'w': 646.0}, {'u': 7, 'v': 8, 'w': 1539.0}, {'u': 7, 'v': 11, 'w': 238057.0}, {'u': 7, 'v': 15, 'w': 563.0}, {'u': 2, 'v': 18, 'w': 1926.0}, {'u': 2, 'v': 3, 'w': 1953.0}, {'u': 8, 'v': 20, 'w': 563.0}, {'u': 8, 'v': 18, 'w': 854.0}, {'u': 3, 'v': 18, 'w': 92.0}, {'u': 10, 'v': 9, 'w': 577.0}, {'u': 20, 'v': 15, 'w': 1522.0}, {'u': 15, 'v': 16, 'w': 298.0}, {'u': 16, 'v': 17, 'w': 222.0}], 'k': 6, 'source_file': 'I044.stp', 'density': 0.12105263157894737}","[[14, 19], [3, 19], [6, 13], [6, 14], [3, 18]]",1685.0,"{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 23, 'edges': [{'u': 'A', 'v': 'T', 'w': 252.0}, {'u': 'A', 'v': 'J', 'w': 1496.0}, {'u': 'A', 'v': 'P', 'w': 1513.0}, {'u': 'S', 'v': 'N', 'w': 498.0}, {'u': 'S', 'v': 'C', 'w': 360.0}, {'u': 'D', 'v': 'E', 'w': 1682.0}, {'u': 'D', 'v': 'F', 'w': 794.0}, {'u': 'D', 'v': 'K', 'w': 237564.0}, {'u': 'E', 'v': 'L', 'w': 1409.0}, {'u': 'F', 'v': 'M', 'w': 89.0}, {'u': 'F', 'v': 'N', 'w': 646.0}, {'u': 'G', 'v': 'H', 'w': 1539.0}, {'u': 'G', 'v': 'K', 'w': 238057.0}, {'u': 'G', 'v': 'O', 'w': 563.0}, {'u': 'B', 'v': 'R', 'w': 1926.0}, {'u': 'B', 'v': 'C', 'w': 1953.0}, {'u': 'H', 'v': 'T', 'w': 563.0}, {'u': 'H', 'v': 'R', 'w': 854.0}, {'u': 'C', 'v': 'R', 'w': 92.0}, {'u': 'J', 'v': 'I', 'w': 577.0}, {'u': 'T', 'v': 'O', 'w': 1522.0}, {'u': 'O', 'v': 'P', 'w': 298.0}, {'u': 'P', 'v': 'Q', 'w': 222.0}], 'density': 0.12105263157894737, 'source_file': 'I044.stp', 'k': 6}","[['N', 'S'], ['C', 'S'], ['F', 'M'], ['F', 'N'], ['C', 'R']]",14,nl,names
KMST,KMST,"Someone in the planning office wants a compact bike network: pick exactly k stations, join them so they form one connected structure without any closed loops, and make sure every selected station is included once. Plans are compared by the total length of lanes built — just add the lane distances to see which is shortest. The map and numbers for this task are shown below.
# num_stations_total=16
# num_candidate_links_total=20
# selected_stations_k=8
station_u_id,station_v_id,link_length
H,G,1134.0
H,E,172.0
P,K,9113.0
P,F,3333.0
P,I,1915.0
F,A,3843.0
L,M,6313.0
L,E,1300.0
M,O,7436.0
M,N,4027.0
O,I,7224.0
O,K,10322.0
O,G,3778.0
A,B,470.0
A,I,1457.0
C,D,371.0
C,B,10050.0
D,I,8679.0
D,G,557.0
J,K,7718.0
If you want to send the chosen lanes back to me, please use this little JSON shape so it's easy to read:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is just a list of the lanes you want to build; each lane is a pair [u, v] meaning ""connect station u with station v"". Think of it like filling out a short form — this block is only a sketch of the shape I expect, not the actual answer.
Please be sure to use the exact identifiers from the instance input — no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 8, 'v': 7, 'w': 1134.0}, {'u': 8, 'v': 5, 'w': 172.0}, {'u': 16, 'v': 11, 'w': 9113.0}, {'u': 16, 'v': 6, 'w': 3333.0}, {'u': 16, 'v': 9, 'w': 1915.0}, {'u': 6, 'v': 1, 'w': 3843.0}, {'u': 12, 'v': 13, 'w': 6313.0}, {'u': 12, 'v': 5, 'w': 1300.0}, {'u': 13, 'v': 15, 'w': 7436.0}, {'u': 13, 'v': 14, 'w': 4027.0}, {'u': 15, 'v': 9, 'w': 7224.0}, {'u': 15, 'v': 11, 'w': 10322.0}, {'u': 15, 'v': 7, 'w': 3778.0}, {'u': 1, 'v': 2, 'w': 470.0}, {'u': 1, 'v': 9, 'w': 1457.0}, {'u': 3, 'v': 4, 'w': 371.0}, {'u': 3, 'v': 2, 'w': 10050.0}, {'u': 4, 'v': 9, 'w': 8679.0}, {'u': 4, 'v': 7, 'w': 557.0}, {'u': 10, 'v': 11, 'w': 7718.0}], 'k': 8, 'source_file': 'I019.stp', 'density': 0.16666666666666666}","[[7, 8], [5, 8], [1, 2], [1, 9], [3, 4], [4, 9], [4, 7]]",12840.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 'H', 'v': 'G', 'w': 1134.0}, {'u': 'H', 'v': 'E', 'w': 172.0}, {'u': 'P', 'v': 'K', 'w': 9113.0}, {'u': 'P', 'v': 'F', 'w': 3333.0}, {'u': 'P', 'v': 'I', 'w': 1915.0}, {'u': 'F', 'v': 'A', 'w': 3843.0}, {'u': 'L', 'v': 'M', 'w': 6313.0}, {'u': 'L', 'v': 'E', 'w': 1300.0}, {'u': 'M', 'v': 'O', 'w': 7436.0}, {'u': 'M', 'v': 'N', 'w': 4027.0}, {'u': 'O', 'v': 'I', 'w': 7224.0}, {'u': 'O', 'v': 'K', 'w': 10322.0}, {'u': 'O', 'v': 'G', 'w': 3778.0}, {'u': 'A', 'v': 'B', 'w': 470.0}, {'u': 'A', 'v': 'I', 'w': 1457.0}, {'u': 'C', 'v': 'D', 'w': 371.0}, {'u': 'C', 'v': 'B', 'w': 10050.0}, {'u': 'D', 'v': 'I', 'w': 8679.0}, {'u': 'D', 'v': 'G', 'w': 557.0}, {'u': 'J', 'v': 'K', 'w': 7718.0}], 'density': 0.16666666666666666, 'source_file': 'I019.stp', 'k': 8}","[['G', 'H'], ['E', 'H'], ['A', 'B'], ['A', 'I'], ['C', 'D'], ['D', 'I'], ['D', 'G']]",15,csv,names
KMST,KMST,"We’ve been asked to connect a fixed number of vineyard parcels with irrigation lines so they form one continuous network, but we must avoid creating circular feeder routes. What makes one plan better than another is how little pipe and money it needs — add up the pipe segments you choose and that total length/cost is what matters. Exactly that predetermined number of parcels has to be chosen (no more, no less), each counted once, and all must be linked together without any loops. The exact instance — which parcels and the pipe lengths/costs — appears below.
There are 19 parcels, 21 candidate pipe segments, and we must select exactly 10 parcels to interconnect into one loop-free network.
Candidate pipe connecting parcel I and parcel D with length/cost 639.0.
Candidate pipe connecting parcel I and parcel C with length/cost 2285.0.
Candidate pipe connecting parcel I and parcel A with length/cost 1801.0.
Candidate pipe connecting parcel E and parcel D with length/cost 754.0.
Candidate pipe connecting parcel J and parcel M with length/cost 376.0.
Candidate pipe connecting parcel J and parcel P with length/cost 485.0.
Candidate pipe connecting parcel J and parcel H with length/cost 1449.0.
Candidate pipe connecting parcel P and parcel Q with length/cost 1270.0.
Candidate pipe connecting parcel P and parcel R with length/cost 494.0.
Candidate pipe connecting parcel Q and parcel H with length/cost 452.0.
Candidate pipe connecting parcel Q and parcel S with length/cost 994.0.
Candidate pipe connecting parcel B and parcel K with length/cost 839.0.
Candidate pipe connecting parcel B and parcel L with length/cost 887.0.
Candidate pipe connecting parcel L and parcel R with length/cost 338.0.
Candidate pipe connecting parcel L and parcel N with length/cost 865.0.
Candidate pipe connecting parcel A and parcel O with length/cost 1667.0.
Candidate pipe connecting parcel A and parcel N with length/cost 2080.0.
Candidate pipe connecting parcel M and parcel C with length/cost 181.0.
Candidate pipe connecting parcel M and parcel R with length/cost 1333.0.
Candidate pipe connecting parcel F and parcel G with length/cost 100.0.
Candidate pipe connecting parcel G and parcel H with length/cost 1240.0.
These entries let us evaluate pipe choices to connect exactly 10 parcels with minimum total length/cost while avoiding loops.
I’ll keep the answer in a simple JSON shape so it’s easy to read and parse. Think of it as a little form where each entry is one chosen pipe between two parcels.
{
""solution"": [[""p1"", ""p2""], [""p3"", ""p4""], ...]
}
In plain terms: ""solution"" is the list of irrigation line segments you pick. Each inner pair [""X"", ""Y""] means “connect parcel X to parcel Y.” This is just the expected shape — a sketch of how I’ll present the final plan, not the actual selection.
Please make sure to use the parcel identifiers exactly as they appear in the instance input — no renaming, no new labels.
Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 21, 'edges': [{'u': 9, 'v': 4, 'w': 639.0}, {'u': 9, 'v': 3, 'w': 2285.0}, {'u': 9, 'v': 1, 'w': 1801.0}, {'u': 5, 'v': 4, 'w': 754.0}, {'u': 10, 'v': 13, 'w': 376.0}, {'u': 10, 'v': 16, 'w': 485.0}, {'u': 10, 'v': 8, 'w': 1449.0}, {'u': 16, 'v': 17, 'w': 1270.0}, {'u': 16, 'v': 18, 'w': 494.0}, {'u': 17, 'v': 8, 'w': 452.0}, {'u': 17, 'v': 19, 'w': 994.0}, {'u': 2, 'v': 11, 'w': 839.0}, {'u': 2, 'v': 12, 'w': 887.0}, {'u': 12, 'v': 18, 'w': 338.0}, {'u': 12, 'v': 14, 'w': 865.0}, {'u': 1, 'v': 15, 'w': 1667.0}, {'u': 1, 'v': 14, 'w': 2080.0}, {'u': 13, 'v': 3, 'w': 181.0}, {'u': 13, 'v': 18, 'w': 1333.0}, {'u': 6, 'v': 7, 'w': 100.0}, {'u': 7, 'v': 8, 'w': 1240.0}], 'k': 10, 'source_file': 'I047.stp', 'density': 0.12280701754385964}","[[10, 13], [10, 16], [16, 17], [16, 18], [8, 17], [12, 18], [3, 13], [6, 7], [7, 8]]",4936.0,"{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 21, 'edges': [{'u': 'I', 'v': 'D', 'w': 639.0}, {'u': 'I', 'v': 'C', 'w': 2285.0}, {'u': 'I', 'v': 'A', 'w': 1801.0}, {'u': 'E', 'v': 'D', 'w': 754.0}, {'u': 'J', 'v': 'M', 'w': 376.0}, {'u': 'J', 'v': 'P', 'w': 485.0}, {'u': 'J', 'v': 'H', 'w': 1449.0}, {'u': 'P', 'v': 'Q', 'w': 1270.0}, {'u': 'P', 'v': 'R', 'w': 494.0}, {'u': 'Q', 'v': 'H', 'w': 452.0}, {'u': 'Q', 'v': 'S', 'w': 994.0}, {'u': 'B', 'v': 'K', 'w': 839.0}, {'u': 'B', 'v': 'L', 'w': 887.0}, {'u': 'L', 'v': 'R', 'w': 338.0}, {'u': 'L', 'v': 'N', 'w': 865.0}, {'u': 'A', 'v': 'O', 'w': 1667.0}, {'u': 'A', 'v': 'N', 'w': 2080.0}, {'u': 'M', 'v': 'C', 'w': 181.0}, {'u': 'M', 'v': 'R', 'w': 1333.0}, {'u': 'F', 'v': 'G', 'w': 100.0}, {'u': 'G', 'v': 'H', 'w': 1240.0}], 'density': 0.12280701754385964, 'source_file': 'I047.stp', 'k': 10}","[['J', 'M'], ['J', 'P'], ['P', 'Q'], ['P', 'R'], ['H', 'Q'], ['L', 'R'], ['C', 'M'], ['F', 'G'], ['G', 'H']]",16,nl,names
KMST,KMST,"Someone on the team needs to pick a fixed number of sensors and hook them together with radio connections so they form a single connected web with no loops; the trick is to do this while keeping the sum of all link distances as small as possible. The way to check which choice is best is to add up the lengths of all the links used, and be sure the network contains exactly the chosen number of distinct sensors with no extras. The detailed sensor layout and distances are given below.
# total_sensors=18
# total_link_entries=21
# target_selected_sensors=7
sensor_id_a,sensor_id_b,link_distance
13,17,2124.0
12,10,300.0
12,15,3202.0
1,3,364.0
9,3,574.0
9,4,510.0
9,8,7342.0
3,2,608.0
2,4,663.0
10,14,3185.0
10,11,3358.0
14,8,293.0
14,15,445.0
8,6,716.0
17,18,5172.0
17,7,1439.0
18,5,1756.0
6,5,369.0
6,7,4052.0
15,16,200.0
16,5,668.0
If you want the answer output in a machine-friendly way, just stick to this little JSON shape:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is a list of radio links to include in the final web. Each pair like [u1, v1] is one connection between two sensors (the order inside the pair doesn't matter — it's just the two endpoints). Think of it as a simple form: a list of links that together make the connected, loop-free network of exactly the chosen sensors.
This JSON is only a sketch of the shape I need — not the real answer. When you fill it in, use the exact sensor identifiers from the instance input, with no renaming and no extra labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 21, 'edges': [{'u': 13, 'v': 17, 'w': 2124.0}, {'u': 12, 'v': 10, 'w': 300.0}, {'u': 12, 'v': 15, 'w': 3202.0}, {'u': 1, 'v': 3, 'w': 364.0}, {'u': 9, 'v': 3, 'w': 574.0}, {'u': 9, 'v': 4, 'w': 510.0}, {'u': 9, 'v': 8, 'w': 7342.0}, {'u': 3, 'v': 2, 'w': 608.0}, {'u': 2, 'v': 4, 'w': 663.0}, {'u': 10, 'v': 14, 'w': 3185.0}, {'u': 10, 'v': 11, 'w': 3358.0}, {'u': 14, 'v': 8, 'w': 293.0}, {'u': 14, 'v': 15, 'w': 445.0}, {'u': 8, 'v': 6, 'w': 716.0}, {'u': 17, 'v': 18, 'w': 5172.0}, {'u': 17, 'v': 7, 'w': 1439.0}, {'u': 18, 'v': 5, 'w': 1756.0}, {'u': 6, 'v': 5, 'w': 369.0}, {'u': 6, 'v': 7, 'w': 4052.0}, {'u': 15, 'v': 16, 'w': 200.0}, {'u': 16, 'v': 5, 'w': 668.0}], 'k': 7, 'source_file': 'I017.stp', 'density': 0.13725490196078433}","[[8, 14], [14, 15], [5, 18], [5, 6], [15, 16], [5, 16]]",3731.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 21, 'edges': [{'u': 13, 'v': 17, 'w': 2124.0}, {'u': 12, 'v': 10, 'w': 300.0}, {'u': 12, 'v': 15, 'w': 3202.0}, {'u': 1, 'v': 3, 'w': 364.0}, {'u': 9, 'v': 3, 'w': 574.0}, {'u': 9, 'v': 4, 'w': 510.0}, {'u': 9, 'v': 8, 'w': 7342.0}, {'u': 3, 'v': 2, 'w': 608.0}, {'u': 2, 'v': 4, 'w': 663.0}, {'u': 10, 'v': 14, 'w': 3185.0}, {'u': 10, 'v': 11, 'w': 3358.0}, {'u': 14, 'v': 8, 'w': 293.0}, {'u': 14, 'v': 15, 'w': 445.0}, {'u': 8, 'v': 6, 'w': 716.0}, {'u': 17, 'v': 18, 'w': 5172.0}, {'u': 17, 'v': 7, 'w': 1439.0}, {'u': 18, 'v': 5, 'w': 1756.0}, {'u': 6, 'v': 5, 'w': 369.0}, {'u': 6, 'v': 7, 'w': 4052.0}, {'u': 15, 'v': 16, 'w': 200.0}, {'u': 16, 'v': 5, 'w': 668.0}], 'density': 0.13725490196078433, 'source_file': 'I017.stp', 'k': 7}","[[8, 14], [14, 15], [5, 18], [5, 6], [15, 16], [5, 16]]",17,csv,1
KMST,KMST,"On a quiet afternoon the village engineer drew up plans to connect a fixed number of wells so they all sit on one continuous supply line without any loops or repeated routes. Different connection schemes are compared by simply summing the lengths of the pipes they’d need — the scheme with the smallest sum is the cheapest and therefore best. It’s non-negotiable that exactly that many wells are included, that each is connected, and that piping never forms a circular path. The actual map, distances, and how many wells to connect are given below.
# total_wells=17
# possible_pipe_segments=19
# wells_to_connect=5
well_u_id,well_v_id,pipe_length
2,3,280021.0
2,4,723304.0
11,12,2248.0
11,9,2049.0
12,7,2047.0
12,10,2274.0
3,6,350028.0
3,5,459370.0
4,14,724.0
4,8,1107.0
10,1,5545.0
8,15,2085.0
13,15,2355.0
5,6,258517.0
5,7,384255.0
6,14,378026.0
7,14,617.0
17,16,2046.0
15,16,294.0
If it helps, reply with a tiny JSON snippet in that shape so I can immediately see which wells get connected. Something informal like this works:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
""solution"" should be a list of pipe links; each pair [u1, v1] means there's a single pipe between the two wells whose identifiers are u1 and v1. Think of it as filling out a simple form: each inner pair is one connection. This is just the expected shape — a sketch of the format, not the actual answer.
Please be sure to use the exact identifiers from the input, with no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 19, 'edges': [{'u': 2, 'v': 3, 'w': 280021.0}, {'u': 2, 'v': 4, 'w': 723304.0}, {'u': 11, 'v': 12, 'w': 2248.0}, {'u': 11, 'v': 9, 'w': 2049.0}, {'u': 12, 'v': 7, 'w': 2047.0}, {'u': 12, 'v': 10, 'w': 2274.0}, {'u': 3, 'v': 6, 'w': 350028.0}, {'u': 3, 'v': 5, 'w': 459370.0}, {'u': 4, 'v': 14, 'w': 724.0}, {'u': 4, 'v': 8, 'w': 1107.0}, {'u': 10, 'v': 1, 'w': 5545.0}, {'u': 8, 'v': 15, 'w': 2085.0}, {'u': 13, 'v': 15, 'w': 2355.0}, {'u': 5, 'v': 6, 'w': 258517.0}, {'u': 5, 'v': 7, 'w': 384255.0}, {'u': 6, 'v': 14, 'w': 378026.0}, {'u': 7, 'v': 14, 'w': 617.0}, {'u': 17, 'v': 16, 'w': 2046.0}, {'u': 15, 'v': 16, 'w': 294.0}], 'k': 5, 'source_file': 'I047.stp', 'density': 0.13970588235294118}","[[4, 14], [4, 8], [8, 15], [15, 16]]",4210.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 19, 'edges': [{'u': 2, 'v': 3, 'w': 280021.0}, {'u': 2, 'v': 4, 'w': 723304.0}, {'u': 11, 'v': 12, 'w': 2248.0}, {'u': 11, 'v': 9, 'w': 2049.0}, {'u': 12, 'v': 7, 'w': 2047.0}, {'u': 12, 'v': 10, 'w': 2274.0}, {'u': 3, 'v': 6, 'w': 350028.0}, {'u': 3, 'v': 5, 'w': 459370.0}, {'u': 4, 'v': 14, 'w': 724.0}, {'u': 4, 'v': 8, 'w': 1107.0}, {'u': 10, 'v': 1, 'w': 5545.0}, {'u': 8, 'v': 15, 'w': 2085.0}, {'u': 13, 'v': 15, 'w': 2355.0}, {'u': 5, 'v': 6, 'w': 258517.0}, {'u': 5, 'v': 7, 'w': 384255.0}, {'u': 6, 'v': 14, 'w': 378026.0}, {'u': 7, 'v': 14, 'w': 617.0}, {'u': 17, 'v': 16, 'w': 2046.0}, {'u': 15, 'v': 16, 'w': 294.0}], 'density': 0.13970588235294118, 'source_file': 'I047.stp', 'k': 5}","[[4, 14], [4, 8], [8, 15], [15, 16]]",18,csv,1
KMST,KMST,"There’s a small project to wire a handful of buildings: pick a predetermined number of sites and connect them with fiber so they all reach each other through a single connected layout that doesn’t loop back on itself. What makes one plan better than another is simply the total cable put in — add the lengths of the chosen links and the smaller total wins. Every chosen building has to be one of the fixed number (no extras, no repeats), and the cabling must link them into a single loop-free network. The detailed map and numbers follow below.
The detailed map shows 16 buildings, 20 candidate links, and you must select exactly 8 buildings to connect into one loop-free layout.
Candidate link between 8 and 3, length 865.0.
Candidate link between 8 and 2, length 661.0.
Candidate link between 8 and 1, length 1242.0.
Candidate link between 9 and 15, length 1676.0.
Candidate link between 9 and 10, length 839.0.
Candidate link between 9 and 1, length 4770.0.
Candidate link between 10 and 11, length 609.0.
Candidate link between 10 and 6, length 230.0.
Candidate link between 11 and 7, length 284.0.
Candidate link between 11 and 12, length 1031.0.
Candidate link between 12 and 15, length 580.0.
Candidate link between 0 and 1, length 2555.0.
Candidate link between 0 and 3, length 456.0.
Candidate link between 13 and 14, length 5606.0.
Candidate link between 1 and 14, length 2759.0.
Candidate link between 4 and 5, length 656.0.
Candidate link between 4 and 7, length 291.0.
Candidate link between 5 and 6, length 290.0.
Candidate link between 14 and 15, length 2157.0.
Candidate link between 6 and 7, length 631.0.
Select the 8 buildings (from the 16 sites) and the listed links that yield the smallest total cable length to form the required tree.
If you want to tell me which links you'd pick, just drop them in a tiny JSON snippet like this and I’ll know how to read it:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is just a list of the chosen cable runs, and each pair like [u1, v1] is one link between two sites (use the site identifiers from the instance). Think of it as a simple form: a list of edges that together make the connected, loop-free layout.
This JSON is only a sketch of the expected shape — not the final plan itself.
Please make sure every identifier in your submission matches exactly what appears in the instance input — don’t rename or invent labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 9, 'v': 4, 'w': 865.0}, {'u': 9, 'v': 3, 'w': 661.0}, {'u': 9, 'v': 2, 'w': 1242.0}, {'u': 10, 'v': 16, 'w': 1676.0}, {'u': 10, 'v': 11, 'w': 839.0}, {'u': 10, 'v': 2, 'w': 4770.0}, {'u': 11, 'v': 12, 'w': 609.0}, {'u': 11, 'v': 7, 'w': 230.0}, {'u': 12, 'v': 8, 'w': 284.0}, {'u': 12, 'v': 13, 'w': 1031.0}, {'u': 13, 'v': 16, 'w': 580.0}, {'u': 1, 'v': 2, 'w': 2555.0}, {'u': 1, 'v': 4, 'w': 456.0}, {'u': 14, 'v': 15, 'w': 5606.0}, {'u': 2, 'v': 15, 'w': 2759.0}, {'u': 5, 'v': 6, 'w': 656.0}, {'u': 5, 'v': 8, 'w': 291.0}, {'u': 6, 'v': 7, 'w': 290.0}, {'u': 15, 'v': 16, 'w': 2157.0}, {'u': 7, 'v': 8, 'w': 631.0}], 'k': 8, 'source_file': 'I052.stp', 'density': 0.16666666666666666}","[[11, 12], [7, 11], [8, 12], [12, 13], [13, 16], [5, 8], [6, 7]]",3315.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 8, 'v': 3, 'w': 865.0}, {'u': 8, 'v': 2, 'w': 661.0}, {'u': 8, 'v': 1, 'w': 1242.0}, {'u': 9, 'v': 15, 'w': 1676.0}, {'u': 9, 'v': 10, 'w': 839.0}, {'u': 9, 'v': 1, 'w': 4770.0}, {'u': 10, 'v': 11, 'w': 609.0}, {'u': 10, 'v': 6, 'w': 230.0}, {'u': 11, 'v': 7, 'w': 284.0}, {'u': 11, 'v': 12, 'w': 1031.0}, {'u': 12, 'v': 15, 'w': 580.0}, {'u': 0, 'v': 1, 'w': 2555.0}, {'u': 0, 'v': 3, 'w': 456.0}, {'u': 13, 'v': 14, 'w': 5606.0}, {'u': 1, 'v': 14, 'w': 2759.0}, {'u': 4, 'v': 5, 'w': 656.0}, {'u': 4, 'v': 7, 'w': 291.0}, {'u': 5, 'v': 6, 'w': 290.0}, {'u': 14, 'v': 15, 'w': 2157.0}, {'u': 6, 'v': 7, 'w': 631.0}], 'density': 0.16666666666666666, 'source_file': 'I052.stp', 'k': 8}","[[10, 11], [6, 10], [7, 11], [11, 12], [12, 15], [4, 7], [5, 6]]",19,markdown_table,0
KMST,KMST,"I’m playing the role of the city planner who has to pick a fixed number of utility poles and string cable so that every chosen pole can be reached from any other without making any closed loops. The choice is about which exact poles to include and which connections to run between them; a better choice is simply the one that needs the least amount of new cable overall — add up the length of each cable segment used and that total is what’s being kept as small as possible. It’s important that exactly the given number of poles are included, none are duplicated, and the wiring can’t form circuits (every selected pole must stay reachable from the others through the network). The map and the exact distances and numbers will be shown below.
{
""total_poles"": 19,
""available_cable_segments"": 23,
""edges"": [
{
""pole_u_id"": 5,
""pole_v_id"": 9,
""cable_length"": 563.0
},
{
""pole_u_id"": 6,
""pole_v_id"": 3,
""cable_length"": 999.0
},
{
""pole_u_id"": 7,
""pole_v_id"": 3,
""cable_length"": 385.0
},
{
""pole_u_id"": 7,
""pole_v_id"": 4,
""cable_length"": 530.0
},
{
""pole_u_id"": 7,
""pole_v_id"": 18,
""cable_length"": 1139.0
},
{
""pole_u_id"": 8,
""pole_v_id"": 0,
""cable_length"": 607.0
},
{
""pole_u_id"": 8,
""pole_v_id"": 4,
""cable_length"": 995.0
},
{
""pole_u_id"": 9,
""pole_v_id"": 10,
""cable_length"": 281.0
},
{
""pole_u_id"": 9,
""pole_v_id"": 13,
""cable_length"": 72.0
},
{
""pole_u_id"": 10,
""pole_v_id"": 11,
""cable_length"": 350.0
},
{
""pole_u_id"": 10,
""pole_v_id"": 18,
""cable_length"": 432.0
},
{
""pole_u_id"": 11,
""pole_v_id"": 12,
""cable_length"": 865.0
},
{
""pole_u_id"": 11,
""pole_v_id"": 17,
""cable_length"": 621.0
},
{
""pole_u_id"": 12,
""pole_v_id"": 14,
""cable_length"": 321.0
},
{
""pole_u_id"": 12,
""pole_v_id"": 15,
""cable_length"": 461.0
},
{
""pole_u_id"": 2,
""pole_v_id"": 3,
""cable_length"": 512.0
},
{
""pole_u_id"": 2,
""pole_v_id"": 4,
""cable_length"": 366.0
},
{
""pole_u_id"": 17,
""pole_v_id"": 15,
""cable_length"": 782.0
},
{
""pole_u_id"": 17,
""pole_v_id"": 18,
""cable_length"": 495.0
},
{
""pole_u_id"": 16,
""pole_v_id"": 14,
""cable_length"": 1018.0
},
{
""pole_u_id"": 0,
""pole_v_id"": 1,
""cable_length"": 1268.0
},
{
""pole_u_id"": 0,
""pole_v_id"": 14,
""cable_length"": 493.0
},
{
""pole_u_id"": 0,
""pole_v_id"": 15,
""cable_length"": 400.0
}
],
""poles_to_connect"": 6
}
Oh, and before I give the wiring plan, I’ll show the shape I’ll use for the answer so it’s easy to copy into whatever you’re using. It’s just a tiny JSON sketch of the connections — nothing final, just the format I’ll follow.
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Each inner pair is one cable segment: the two labels are the poles (nodes) that get connected. Think of it like filling out a form where each line says ""connect this pole to that pole."" This block is only an example of the expected shape, not the actual answer.
Reminder: all identifiers must be used exactly as they appear in the instance input — don’t rename any nodes or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 23, 'edges': [{'u': 6, 'v': 10, 'w': 563.0}, {'u': 7, 'v': 4, 'w': 999.0}, {'u': 8, 'v': 4, 'w': 385.0}, {'u': 8, 'v': 5, 'w': 530.0}, {'u': 8, 'v': 19, 'w': 1139.0}, {'u': 9, 'v': 1, 'w': 607.0}, {'u': 9, 'v': 5, 'w': 995.0}, {'u': 10, 'v': 11, 'w': 281.0}, {'u': 10, 'v': 14, 'w': 72.0}, {'u': 11, 'v': 12, 'w': 350.0}, {'u': 11, 'v': 19, 'w': 432.0}, {'u': 12, 'v': 13, 'w': 865.0}, {'u': 12, 'v': 18, 'w': 621.0}, {'u': 13, 'v': 15, 'w': 321.0}, {'u': 13, 'v': 16, 'w': 461.0}, {'u': 3, 'v': 4, 'w': 512.0}, {'u': 3, 'v': 5, 'w': 366.0}, {'u': 18, 'v': 16, 'w': 782.0}, {'u': 18, 'v': 19, 'w': 495.0}, {'u': 17, 'v': 15, 'w': 1018.0}, {'u': 1, 'v': 2, 'w': 1268.0}, {'u': 1, 'v': 15, 'w': 493.0}, {'u': 1, 'v': 16, 'w': 400.0}], 'k': 6, 'source_file': 'I008.stp', 'density': 0.13450292397660818}","[[10, 11], [10, 14], [11, 12], [11, 19], [18, 19]]",1630.0,"{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 23, 'edges': [{'u': 5, 'v': 9, 'w': 563.0}, {'u': 6, 'v': 3, 'w': 999.0}, {'u': 7, 'v': 3, 'w': 385.0}, {'u': 7, 'v': 4, 'w': 530.0}, {'u': 7, 'v': 18, 'w': 1139.0}, {'u': 8, 'v': 0, 'w': 607.0}, {'u': 8, 'v': 4, 'w': 995.0}, {'u': 9, 'v': 10, 'w': 281.0}, {'u': 9, 'v': 13, 'w': 72.0}, {'u': 10, 'v': 11, 'w': 350.0}, {'u': 10, 'v': 18, 'w': 432.0}, {'u': 11, 'v': 12, 'w': 865.0}, {'u': 11, 'v': 17, 'w': 621.0}, {'u': 12, 'v': 14, 'w': 321.0}, {'u': 12, 'v': 15, 'w': 461.0}, {'u': 2, 'v': 3, 'w': 512.0}, {'u': 2, 'v': 4, 'w': 366.0}, {'u': 17, 'v': 15, 'w': 782.0}, {'u': 17, 'v': 18, 'w': 495.0}, {'u': 16, 'v': 14, 'w': 1018.0}, {'u': 0, 'v': 1, 'w': 1268.0}, {'u': 0, 'v': 14, 'w': 493.0}, {'u': 0, 'v': 15, 'w': 400.0}], 'density': 0.13450292397660818, 'source_file': 'I008.stp', 'k': 6}","[[9, 10], [9, 13], [10, 11], [10, 18], [17, 18]]",20,json,0
KMST,KMST,"Someone in charge of park logistics needs to open a set number of ranger posts and connect them so staff can travel between them, but they can’t create any roundabout loops and must stick to exactly k posts. Better setups are judged by how short the combined trail mileage is — you calculate it by adding every trail’s length that’s built. The plan must include every chosen post, keep the network one-piece, and avoid duplicated or circular connections. The concrete instance with distances is shown below.
{
""total_ranger_posts"": 18,
""total_possible_trails"": 21,
""edges"": [
{
""post_u"": ""B"",
""post_v"": ""E"",
""trail_length"": 451.0
},
{
""post_u"": ""B"",
""post_v"": ""H"",
""trail_length"": 624.0
},
{
""post_u"": ""G"",
""post_v"": ""A"",
""trail_length"": 589.0
},
{
""post_u"": ""G"",
""post_v"": ""H"",
""trail_length"": 239.0
},
{
""post_u"": ""G"",
""post_v"": ""I"",
""trail_length"": 661.0
},
{
""post_u"": ""H"",
""post_v"": ""O"",
""trail_length"": 2746.0
},
{
""post_u"": ""P"",
""post_v"": ""Q"",
""trail_length"": 896.0
},
{
""post_u"": ""P"",
""post_v"": ""D"",
""trail_length"": 2437.0
},
{
""post_u"": ""Q"",
""post_v"": ""O"",
""trail_length"": 899.0
},
{
""post_u"": ""Q"",
""post_v"": ""E"",
""trail_length"": 2976.0
},
{
""post_u"": ""J"",
""post_v"": ""I"",
""trail_length"": 414.0
},
{
""post_u"": ""J"",
""post_v"": ""K"",
""trail_length"": 899.0
},
{
""post_u"": ""J"",
""post_v"": ""L"",
""trail_length"": 2274.0
},
{
""post_u"": ""I"",
""post_v"": ""M"",
""trail_length"": 239.0
},
{
""post_u"": ""M"",
""post_v"": ""A"",
""trail_length"": 590.0
},
{
""post_u"": ""R"",
""post_v"": ""F"",
""trail_length"": 405.0
},
{
""post_u"": ""O"",
""post_v"": ""L"",
""trail_length"": 898.0
},
{
""post_u"": ""E"",
""post_v"": ""F"",
""trail_length"": 403.0
},
{
""post_u"": ""N"",
""post_v"": ""L"",
""trail_length"": 897.0
},
{
""post_u"": ""N"",
""post_v"": ""K"",
""trail_length"": 2214.0
},
{
""post_u"": ""N"",
""post_v"": ""C"",
""trail_length"": 900.0
}
],
""target_open_posts"": 9
}
If you want to hand me a candidate layout, just stick to this simple JSON shape so I can read it easily:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
""solution"" should be a list of the trail segments you plan to build. Each inner pair like [u1, v1] is one connection between two ranger posts (use the post IDs from the instance). This is just a sketch of the shape I expect, not the actual final plan.
Please use the exact identifiers from the instance input — don't rename them or invent new ones. Valid identifiers look like plain numbers such as ""1"" or ""23"", single capital letters like ""A"" or ""B"", or a capital letter followed by digits like ""A1"" or ""X7"".","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 21, 'edges': [{'u': 2, 'v': 5, 'w': 451.0}, {'u': 2, 'v': 8, 'w': 624.0}, {'u': 7, 'v': 1, 'w': 589.0}, {'u': 7, 'v': 8, 'w': 239.0}, {'u': 7, 'v': 9, 'w': 661.0}, {'u': 8, 'v': 15, 'w': 2746.0}, {'u': 16, 'v': 17, 'w': 896.0}, {'u': 16, 'v': 4, 'w': 2437.0}, {'u': 17, 'v': 15, 'w': 899.0}, {'u': 17, 'v': 5, 'w': 2976.0}, {'u': 10, 'v': 9, 'w': 414.0}, {'u': 10, 'v': 11, 'w': 899.0}, {'u': 10, 'v': 12, 'w': 2274.0}, {'u': 9, 'v': 13, 'w': 239.0}, {'u': 13, 'v': 1, 'w': 590.0}, {'u': 18, 'v': 6, 'w': 405.0}, {'u': 15, 'v': 12, 'w': 898.0}, {'u': 5, 'v': 6, 'w': 403.0}, {'u': 14, 'v': 12, 'w': 897.0}, {'u': 14, 'v': 11, 'w': 2214.0}, {'u': 14, 'v': 3, 'w': 900.0}], 'k': 9, 'source_file': 'I001.stp', 'density': 0.13725490196078433}","[[2, 5], [2, 8], [7, 8], [7, 9], [9, 10], [9, 13], [6, 18], [5, 6]]",3436.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 21, 'edges': [{'u': 'B', 'v': 'E', 'w': 451.0}, {'u': 'B', 'v': 'H', 'w': 624.0}, {'u': 'G', 'v': 'A', 'w': 589.0}, {'u': 'G', 'v': 'H', 'w': 239.0}, {'u': 'G', 'v': 'I', 'w': 661.0}, {'u': 'H', 'v': 'O', 'w': 2746.0}, {'u': 'P', 'v': 'Q', 'w': 896.0}, {'u': 'P', 'v': 'D', 'w': 2437.0}, {'u': 'Q', 'v': 'O', 'w': 899.0}, {'u': 'Q', 'v': 'E', 'w': 2976.0}, {'u': 'J', 'v': 'I', 'w': 414.0}, {'u': 'J', 'v': 'K', 'w': 899.0}, {'u': 'J', 'v': 'L', 'w': 2274.0}, {'u': 'I', 'v': 'M', 'w': 239.0}, {'u': 'M', 'v': 'A', 'w': 590.0}, {'u': 'R', 'v': 'F', 'w': 405.0}, {'u': 'O', 'v': 'L', 'w': 898.0}, {'u': 'E', 'v': 'F', 'w': 403.0}, {'u': 'N', 'v': 'L', 'w': 897.0}, {'u': 'N', 'v': 'K', 'w': 2214.0}, {'u': 'N', 'v': 'C', 'w': 900.0}], 'density': 0.13725490196078433, 'source_file': 'I001.stp', 'k': 9}","[['B', 'E'], ['B', 'H'], ['G', 'H'], ['G', 'I'], ['I', 'J'], ['I', 'M'], ['F', 'R'], ['E', 'F']]",21,json,names
KMST,KMST,"At a small market the organizers had to pick exactly k vendors to get utilities and plan how to string the cables between them. The cables had to make the chosen vendors part of one connected group without closing any loops, and since every cable segment had a cost, the smart choice was the plan with the smallest overall cable bill — calculated by summing the cost of each segment used. No chosen vendor could be left out or duplicated, and no wiring could create a cycle. The concrete diagram and costs follow below.
{
""total_stalls"": 20,
""total_possible_connectors"": 25,
""edges"": [
{
""stall_endpoint_u"": ""L"",
""stall_endpoint_v"": ""F"",
""connector_cost"": 917.0
},
{
""stall_endpoint_u"": ""M"",
""stall_endpoint_v"": ""F"",
""connector_cost"": 1035.0
},
{
""stall_endpoint_u"": ""M"",
""stall_endpoint_v"": ""N"",
""connector_cost"": 2245.0
},
{
""stall_endpoint_u"": ""M"",
""stall_endpoint_v"": ""B"",
""connector_cost"": 3543.0
},
{
""stall_endpoint_u"": ""M"",
""stall_endpoint_v"": ""Q"",
""connector_cost"": 2207.0
},
{
""stall_endpoint_u"": ""N"",
""stall_endpoint_v"": ""C"",
""connector_cost"": 3539.0
},
{
""stall_endpoint_u"": ""N"",
""stall_endpoint_v"": ""R"",
""connector_cost"": 2125.0
},
{
""stall_endpoint_u"": ""P"",
""stall_endpoint_v"": ""D"",
""connector_cost"": 1091.0
},
{
""stall_endpoint_u"": ""P"",
""stall_endpoint_v"": ""C"",
""connector_cost"": 2997.0
},
{
""stall_endpoint_u"": ""A"",
""stall_endpoint_v"": ""S"",
""connector_cost"": 537.0
},
{
""stall_endpoint_u"": ""Q"",
""stall_endpoint_v"": ""J"",
""connector_cost"": 691.0
},
{
""stall_endpoint_u"": ""Q"",
""stall_endpoint_v"": ""O"",
""connector_cost"": 895.0
},
{
""stall_endpoint_u"": ""R"",
""stall_endpoint_v"": ""J"",
""connector_cost"": 1469.0
},
{
""stall_endpoint_u"": ""R"",
""stall_endpoint_v"": ""I"",
""connector_cost"": 700.0
},
{
""stall_endpoint_u"": ""B"",
""stall_endpoint_v"": ""C"",
""connector_cost"": 2377.0
},
{
""stall_endpoint_u"": ""B"",
""stall_endpoint_v"": ""D"",
""connector_cost"": 3666.0
},
{
""stall_endpoint_u"": ""B"",
""stall_endpoint_v"": ""E"",
""connector_cost"": 3915.0
},
{
""stall_endpoint_u"": ""D"",
""stall_endpoint_v"": ""E"",
""connector_cost"": 1469.0
},
{
""stall_endpoint_u"": ""F"",
""stall_endpoint_v"": ""G"",
""connector_cost"": 2243.0
},
{
""stall_endpoint_u"": ""G"",
""stall_endpoint_v"": ""O"",
""connector_cost"": 192.0
},
{
""stall_endpoint_u"": ""H"",
""stall_endpoint_v"": ""O"",
""connector_cost"": 1914.0
},
{
""stall_endpoint_u"": ""I"",
""stall_endpoint_v"": ""T"",
""connector_cost"": 5820.0
},
{
""stall_endpoint_u"": ""I"",
""stall_endpoint_v"": ""J"",
""connector_cost"": 2089.0
},
{
""stall_endpoint_u"": ""S"",
""stall_endpoint_v"": ""T"",
""connector_cost"": 2506.0
},
{
""stall_endpoint_u"": ""T"",
""stall_endpoint_v"": ""K"",
""connector_cost"": 2679.0
}
],
""stalls_to_supply"": 6
}
Oh, and when you hand me the wiring plan, just put it into this little JSON shape so I can read it easily:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
""solution"" should be a list of the cable segments you plan to use. Each inner pair [u1, v1] is one cable connecting vendor u1 to vendor v1. Think of it like a simple checklist of which stands get linked together — just the structure, not the prices or anything. This is only a sketch of the shape I expect, not the final answer itself.
Please make sure to use the exact identifiers from the instance input — do not rename them and do not invent new labels. For example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 25, 'edges': [{'u': 12, 'v': 6, 'w': 917.0}, {'u': 13, 'v': 6, 'w': 1035.0}, {'u': 13, 'v': 14, 'w': 2245.0}, {'u': 13, 'v': 2, 'w': 3543.0}, {'u': 13, 'v': 17, 'w': 2207.0}, {'u': 14, 'v': 3, 'w': 3539.0}, {'u': 14, 'v': 18, 'w': 2125.0}, {'u': 16, 'v': 4, 'w': 1091.0}, {'u': 16, 'v': 3, 'w': 2997.0}, {'u': 1, 'v': 19, 'w': 537.0}, {'u': 17, 'v': 10, 'w': 691.0}, {'u': 17, 'v': 15, 'w': 895.0}, {'u': 18, 'v': 10, 'w': 1469.0}, {'u': 18, 'v': 9, 'w': 700.0}, {'u': 2, 'v': 3, 'w': 2377.0}, {'u': 2, 'v': 4, 'w': 3666.0}, {'u': 2, 'v': 5, 'w': 3915.0}, {'u': 4, 'v': 5, 'w': 1469.0}, {'u': 6, 'v': 7, 'w': 2243.0}, {'u': 7, 'v': 15, 'w': 192.0}, {'u': 8, 'v': 15, 'w': 1914.0}, {'u': 9, 'v': 20, 'w': 5820.0}, {'u': 9, 'v': 10, 'w': 2089.0}, {'u': 19, 'v': 20, 'w': 2506.0}, {'u': 20, 'v': 11, 'w': 2679.0}], 'k': 6, 'source_file': 'I073.stp', 'density': 0.13157894736842105}","[[10, 17], [15, 17], [10, 18], [9, 18], [7, 15]]",3947.0,"{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 25, 'edges': [{'u': 'L', 'v': 'F', 'w': 917.0}, {'u': 'M', 'v': 'F', 'w': 1035.0}, {'u': 'M', 'v': 'N', 'w': 2245.0}, {'u': 'M', 'v': 'B', 'w': 3543.0}, {'u': 'M', 'v': 'Q', 'w': 2207.0}, {'u': 'N', 'v': 'C', 'w': 3539.0}, {'u': 'N', 'v': 'R', 'w': 2125.0}, {'u': 'P', 'v': 'D', 'w': 1091.0}, {'u': 'P', 'v': 'C', 'w': 2997.0}, {'u': 'A', 'v': 'S', 'w': 537.0}, {'u': 'Q', 'v': 'J', 'w': 691.0}, {'u': 'Q', 'v': 'O', 'w': 895.0}, {'u': 'R', 'v': 'J', 'w': 1469.0}, {'u': 'R', 'v': 'I', 'w': 700.0}, {'u': 'B', 'v': 'C', 'w': 2377.0}, {'u': 'B', 'v': 'D', 'w': 3666.0}, {'u': 'B', 'v': 'E', 'w': 3915.0}, {'u': 'D', 'v': 'E', 'w': 1469.0}, {'u': 'F', 'v': 'G', 'w': 2243.0}, {'u': 'G', 'v': 'O', 'w': 192.0}, {'u': 'H', 'v': 'O', 'w': 1914.0}, {'u': 'I', 'v': 'T', 'w': 5820.0}, {'u': 'I', 'v': 'J', 'w': 2089.0}, {'u': 'S', 'v': 'T', 'w': 2506.0}, {'u': 'T', 'v': 'K', 'w': 2679.0}], 'density': 0.13157894736842105, 'source_file': 'I073.stp', 'k': 6}","[['J', 'Q'], ['O', 'Q'], ['J', 'R'], ['I', 'R'], ['G', 'O']]",22,json,names
KMST,KMST,"At the wildlife trust the brief is to pick exactly a set number of hides and link them with footpaths so the chosen hides make a single connected layout without any circular trails. The practical choices—selecting which hides to use and which connecting footpaths to build—are judged by summing the lengths of those paths, and the smaller that sum, the better the plan. The concrete details and distances follow below.
{
""num_hides_total"": 16,
""num_candidate_paths"": 17,
""edges"": [
{
""hide_u"": 8,
""hide_v"": 2,
""path_length"": 166.0
},
{
""hide_u"": 5,
""hide_v"": 4,
""path_length"": 383.0
},
{
""hide_u"": 5,
""hide_v"": 14,
""path_length"": 1606.0
},
{
""hide_u"": 5,
""hide_v"": 12,
""path_length"": 2410.0
},
{
""hide_u"": 9,
""hide_v"": 3,
""path_length"": 759.0
},
{
""hide_u"": 9,
""hide_v"": 16,
""path_length"": 905.0
},
{
""hide_u"": 1,
""hide_v"": 11,
""path_length"": 166.0
},
{
""hide_u"": 1,
""hide_v"": 6,
""path_length"": 968.0
},
{
""hide_u"": 12,
""hide_v"": 7,
""path_length"": 2960.0
},
{
""hide_u"": 13,
""hide_v"": 11,
""path_length"": 1183.0
},
{
""hide_u"": 13,
""hide_v"": 10,
""path_length"": 1166.0
},
{
""hide_u"": 13,
""hide_v"": 15,
""path_length"": 2364.0
},
{
""hide_u"": 14,
""hide_v"": 15,
""path_length"": 1636.0
},
{
""hide_u"": 6,
""hide_v"": 2,
""path_length"": 64.0
},
{
""hide_u"": 7,
""hide_v"": 3,
""path_length"": 334.0
},
{
""hide_u"": 7,
""hide_v"": 11,
""path_length"": 968.0
},
{
""hide_u"": 3,
""hide_v"": 2,
""path_length"": 940.0
}
],
""hides_to_select"": 8
}
Also, when you send back your choice of paths, please use this simple JSON layout so it's easy to read:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is a list of the footpaths you'd build; each inner pair like [u1, v1] represents a single path connecting two hides (use the hide identifiers exactly as given). This block is just a sketch of the shape I expect — not the final answer itself, just the format to follow.
Please be sure to use the exact identifiers from the instance input, with no renaming and no extra labels.
- Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 17, 'edges': [{'u': 8, 'v': 2, 'w': 166.0}, {'u': 5, 'v': 4, 'w': 383.0}, {'u': 5, 'v': 14, 'w': 1606.0}, {'u': 5, 'v': 12, 'w': 2410.0}, {'u': 9, 'v': 3, 'w': 759.0}, {'u': 9, 'v': 16, 'w': 905.0}, {'u': 1, 'v': 11, 'w': 166.0}, {'u': 1, 'v': 6, 'w': 968.0}, {'u': 12, 'v': 7, 'w': 2960.0}, {'u': 13, 'v': 11, 'w': 1183.0}, {'u': 13, 'v': 10, 'w': 1166.0}, {'u': 13, 'v': 15, 'w': 2364.0}, {'u': 14, 'v': 15, 'w': 1636.0}, {'u': 6, 'v': 2, 'w': 64.0}, {'u': 7, 'v': 3, 'w': 334.0}, {'u': 7, 'v': 11, 'w': 968.0}, {'u': 3, 'v': 2, 'w': 940.0}], 'k': 8, 'source_file': 'I049.stp', 'density': 0.14166666666666666}","[[2, 8], [3, 9], [1, 11], [2, 6], [3, 7], [7, 11], [2, 3]]",3397.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 17, 'edges': [{'u': 8, 'v': 2, 'w': 166.0}, {'u': 5, 'v': 4, 'w': 383.0}, {'u': 5, 'v': 14, 'w': 1606.0}, {'u': 5, 'v': 12, 'w': 2410.0}, {'u': 9, 'v': 3, 'w': 759.0}, {'u': 9, 'v': 16, 'w': 905.0}, {'u': 1, 'v': 11, 'w': 166.0}, {'u': 1, 'v': 6, 'w': 968.0}, {'u': 12, 'v': 7, 'w': 2960.0}, {'u': 13, 'v': 11, 'w': 1183.0}, {'u': 13, 'v': 10, 'w': 1166.0}, {'u': 13, 'v': 15, 'w': 2364.0}, {'u': 14, 'v': 15, 'w': 1636.0}, {'u': 6, 'v': 2, 'w': 64.0}, {'u': 7, 'v': 3, 'w': 334.0}, {'u': 7, 'v': 11, 'w': 968.0}, {'u': 3, 'v': 2, 'w': 940.0}], 'density': 0.14166666666666666, 'source_file': 'I049.stp', 'k': 8}","[[2, 8], [3, 9], [1, 11], [2, 6], [3, 7], [7, 11], [2, 3]]",23,json,1
KMST,KMST,"In town the sewer team needs to select a set number of access points to service and string pipes between them so they become one connected system without any circular detours. Plans are judged by how little pipe they require in total — found by summing all the individual pipe segment lengths — and the team must include exactly the required number of points, connect them all, and avoid creating any loops. The specific nodes and distances will be shown below.
There are 20 candidate access points, 24 candidate pipe segments, and the team must choose exactly 6 points to connect.
Candidate pipe between access points 18 and 9 with length 2407.0.
Candidate pipe between access points 13 and 10 with length 31.0.
Candidate pipe between access points 13 and 14 with length 1865.0.
Candidate pipe between access points 13 and 2 with length 3698.0.
Candidate pipe between access points 14 and 1 with length 3126.0.
Candidate pipe between access points 14 and 9 with length 5699.0.
Candidate pipe between access points 15 and 16 with length 1890.0.
Candidate pipe between access points 15 and 7 with length 1093.0.
Candidate pipe between access points 15 and 4 with length 2744.0.
Candidate pipe between access points 16 and 12 with length 5746.0.
Candidate pipe between access points 16 and 0 with length 2215.0.
Candidate pipe between access points 9 and 8 with length 2232.0.
Candidate pipe between access points 1 and 7 with length 4158.0.
Candidate pipe between access points 2 and 7 with length 1411.0.
Candidate pipe between access points 2 and 19 with length 385706.0.
Candidate pipe between access points 3 and 4 with length 509725.0.
Candidate pipe between access points 3 and 17 with length 510615.0.
Candidate pipe between access points 4 and 11 with length 3156.0.
Candidate pipe between access points 5 and 17 with length 1658.0.
Candidate pipe between access points 5 and 19 with length 2465.0.
Candidate pipe between access points 6 and 10 with length 2839.0.
Candidate pipe between access points 19 and 17 with length 2785.0.
Candidate pipe between access points 10 and 8 with length 5789.0.
Candidate pipe between access points 11 and 12 with length 1642.0.
The team must include exactly 6 access points, connect them into one loop-free system, and minimize the sum of all listed pipe lengths.
When you're ready to hand over the chosen pipe segments, just return them in a little JSON sketch like this:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is a list of pipe pieces to lay down; each inner pair [uX, vX] is just the two access points that get connected by that pipe. Think of it like filling out a simple form: each line says ""connect this point to that point."" This block is only a template showing the shape I expect, not the actual answer.
Please make sure to use the node identifiers exactly as they appear in the instance input — don't rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 24, 'edges': [{'u': 19, 'v': 10, 'w': 2407.0}, {'u': 14, 'v': 11, 'w': 31.0}, {'u': 14, 'v': 15, 'w': 1865.0}, {'u': 14, 'v': 3, 'w': 3698.0}, {'u': 15, 'v': 2, 'w': 3126.0}, {'u': 15, 'v': 10, 'w': 5699.0}, {'u': 16, 'v': 17, 'w': 1890.0}, {'u': 16, 'v': 8, 'w': 1093.0}, {'u': 16, 'v': 5, 'w': 2744.0}, {'u': 17, 'v': 13, 'w': 5746.0}, {'u': 17, 'v': 1, 'w': 2215.0}, {'u': 10, 'v': 9, 'w': 2232.0}, {'u': 2, 'v': 8, 'w': 4158.0}, {'u': 3, 'v': 8, 'w': 1411.0}, {'u': 3, 'v': 20, 'w': 385706.0}, {'u': 4, 'v': 5, 'w': 509725.0}, {'u': 4, 'v': 18, 'w': 510615.0}, {'u': 5, 'v': 12, 'w': 3156.0}, {'u': 6, 'v': 18, 'w': 1658.0}, {'u': 6, 'v': 20, 'w': 2465.0}, {'u': 7, 'v': 11, 'w': 2839.0}, {'u': 20, 'v': 18, 'w': 2785.0}, {'u': 11, 'v': 9, 'w': 5789.0}, {'u': 12, 'v': 13, 'w': 1642.0}], 'k': 6, 'source_file': 'I004.stp', 'density': 0.12631578947368421}","[[11, 14], [14, 15], [3, 14], [8, 16], [3, 8]]",8098.0,"{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 24, 'edges': [{'u': 18, 'v': 9, 'w': 2407.0}, {'u': 13, 'v': 10, 'w': 31.0}, {'u': 13, 'v': 14, 'w': 1865.0}, {'u': 13, 'v': 2, 'w': 3698.0}, {'u': 14, 'v': 1, 'w': 3126.0}, {'u': 14, 'v': 9, 'w': 5699.0}, {'u': 15, 'v': 16, 'w': 1890.0}, {'u': 15, 'v': 7, 'w': 1093.0}, {'u': 15, 'v': 4, 'w': 2744.0}, {'u': 16, 'v': 12, 'w': 5746.0}, {'u': 16, 'v': 0, 'w': 2215.0}, {'u': 9, 'v': 8, 'w': 2232.0}, {'u': 1, 'v': 7, 'w': 4158.0}, {'u': 2, 'v': 7, 'w': 1411.0}, {'u': 2, 'v': 19, 'w': 385706.0}, {'u': 3, 'v': 4, 'w': 509725.0}, {'u': 3, 'v': 17, 'w': 510615.0}, {'u': 4, 'v': 11, 'w': 3156.0}, {'u': 5, 'v': 17, 'w': 1658.0}, {'u': 5, 'v': 19, 'w': 2465.0}, {'u': 6, 'v': 10, 'w': 2839.0}, {'u': 19, 'v': 17, 'w': 2785.0}, {'u': 10, 'v': 8, 'w': 5789.0}, {'u': 11, 'v': 12, 'w': 1642.0}], 'density': 0.12631578947368421, 'source_file': 'I004.stp', 'k': 6}","[[10, 13], [13, 14], [2, 13], [7, 15], [2, 7]]",24,markdown_table,0
KMST,KMST,"Back at the control room the brief was simple: choose a predetermined number of sensor sites and connect them so they form one connected, cycle-free network — nothing duplicated, nothing left hanging. The job is to pick which sites and which links to install; a better plan is the one that keeps the sum of all link costs as low as possible (just total up each chosen link’s cost). The full instance details and cost table appear below.
Instance: 19 potential sensor sites, 26 candidate links; select exactly 10 sites and the links that join them so they form one connected, cycle-free network.
Candidate link joining site 7 and site 8 with cost 772.0.
Candidate link joining site 7 and site 11 with cost 227.0.
Candidate link joining site 7 and site 16 with cost 13350.0.
Candidate link joining site 8 and site 17 with cost 13117.0.
Candidate link joining site 8 and site 13 with cost 333.0.
Candidate link joining site 18 and site 1 with cost 15728.0.
Candidate link joining site 18 and site 15 with cost 767.0.
Candidate link joining site 14 and site 10 with cost 10.0.
Candidate link joining site 14 and site 13 with cost 746.0.
Candidate link joining site 14 and site 0 with cost 15931.0.
Candidate link joining site 13 and site 2 with cost 15809.0.
Candidate link joining site 9 and site 12 with cost 433.0.
Candidate link joining site 9 and site 3 with cost 19096.0.
Candidate link joining site 10 and site 11 with cost 402.0.
Candidate link joining site 10 and site 5 with cost 15746.0.
Candidate link joining site 11 and site 6 with cost 15906.0.
Candidate link joining site 3 and site 4 with cost 469.0.
Candidate link joining site 3 and site 5 with cost 15687.0.
Candidate link joining site 0 and site 1 with cost 471.0.
Candidate link joining site 0 and site 2 with cost 470.0.
Candidate link joining site 0 and site 15 with cost 15651.0.
Candidate link joining site 5 and site 6 with cost 470.0.
Candidate link joining site 6 and site 4 with cost 15579.0.
Candidate link joining site 4 and site 12 with cost 19207.0.
Candidate link joining site 2 and site 1 with cost 10.0.
Candidate link joining site 16 and site 17 with cost 419.0.
Keep the sum of chosen link costs as low as possible while connecting exactly 10 sites into a single tree.
You can just return the selected links in a tiny JSON snippet like this — nice and simple:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of it like a short checklist: ""solution"" holds a list of links, and each [uX, vX] pair is one chosen connection between two sites. It's just the shape we expect, not the actual plan — fill those pairs with the real site identifiers from the instance when you send the answer.
Please make sure to use the identifiers exactly as they appear in the instance input — no renaming and no invented labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 26, 'edges': [{'u': 8, 'v': 9, 'w': 772.0}, {'u': 8, 'v': 12, 'w': 227.0}, {'u': 8, 'v': 17, 'w': 13350.0}, {'u': 9, 'v': 18, 'w': 13117.0}, {'u': 9, 'v': 14, 'w': 333.0}, {'u': 19, 'v': 2, 'w': 15728.0}, {'u': 19, 'v': 16, 'w': 767.0}, {'u': 15, 'v': 11, 'w': 10.0}, {'u': 15, 'v': 14, 'w': 746.0}, {'u': 15, 'v': 1, 'w': 15931.0}, {'u': 14, 'v': 3, 'w': 15809.0}, {'u': 10, 'v': 13, 'w': 433.0}, {'u': 10, 'v': 4, 'w': 19096.0}, {'u': 11, 'v': 12, 'w': 402.0}, {'u': 11, 'v': 6, 'w': 15746.0}, {'u': 12, 'v': 7, 'w': 15906.0}, {'u': 4, 'v': 5, 'w': 469.0}, {'u': 4, 'v': 6, 'w': 15687.0}, {'u': 1, 'v': 2, 'w': 471.0}, {'u': 1, 'v': 3, 'w': 470.0}, {'u': 1, 'v': 16, 'w': 15651.0}, {'u': 6, 'v': 7, 'w': 470.0}, {'u': 7, 'v': 5, 'w': 15579.0}, {'u': 5, 'v': 13, 'w': 19207.0}, {'u': 3, 'v': 2, 'w': 10.0}, {'u': 17, 'v': 18, 'w': 419.0}], 'k': 10, 'source_file': 'I010.stp', 'density': 0.15204678362573099}","[[8, 12], [9, 18], [9, 14], [11, 15], [14, 15], [3, 14], [11, 12], [2, 3], [17, 18]]",31073.0,"{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 26, 'edges': [{'u': 7, 'v': 8, 'w': 772.0}, {'u': 7, 'v': 11, 'w': 227.0}, {'u': 7, 'v': 16, 'w': 13350.0}, {'u': 8, 'v': 17, 'w': 13117.0}, {'u': 8, 'v': 13, 'w': 333.0}, {'u': 18, 'v': 1, 'w': 15728.0}, {'u': 18, 'v': 15, 'w': 767.0}, {'u': 14, 'v': 10, 'w': 10.0}, {'u': 14, 'v': 13, 'w': 746.0}, {'u': 14, 'v': 0, 'w': 15931.0}, {'u': 13, 'v': 2, 'w': 15809.0}, {'u': 9, 'v': 12, 'w': 433.0}, {'u': 9, 'v': 3, 'w': 19096.0}, {'u': 10, 'v': 11, 'w': 402.0}, {'u': 10, 'v': 5, 'w': 15746.0}, {'u': 11, 'v': 6, 'w': 15906.0}, {'u': 3, 'v': 4, 'w': 469.0}, {'u': 3, 'v': 5, 'w': 15687.0}, {'u': 0, 'v': 1, 'w': 471.0}, {'u': 0, 'v': 2, 'w': 470.0}, {'u': 0, 'v': 15, 'w': 15651.0}, {'u': 5, 'v': 6, 'w': 470.0}, {'u': 6, 'v': 4, 'w': 15579.0}, {'u': 4, 'v': 12, 'w': 19207.0}, {'u': 2, 'v': 1, 'w': 10.0}, {'u': 16, 'v': 17, 'w': 419.0}], 'density': 0.15204678362573099, 'source_file': 'I010.stp', 'k': 10}","[[7, 11], [8, 17], [8, 13], [10, 14], [13, 14], [2, 13], [10, 11], [1, 2], [16, 17]]",25,nl,0
KMST,KMST,"At the office they handed over a map and asked for a tight, loop-free connection among a fixed number of stations, and the consultant must decide the layout. The practical decision is picking exactly that many stations and the connecting links that make them one connected set with no circular tracks. The preferred layout is the one with the lowest total length of new track — calculate that by summing all chosen segment lengths, and the plan with the smallest sum wins. All chosen stations have to be included, cycles are not permitted, and segments are counted once; the concrete instance follows below.
# total_stations=20
# total_candidate_segments=23
# stations_to_connect=10
endpoint_station_a,endpoint_station_b,segment_length
Q,R,155.0
P,T,1508.0
P,C,1586.0
P,S,1981.0
I,F,550.0
I,E,2276.0
I,K,3960.0
J,K,1252.0
J,M,3038.0
J,F,2580.0
K,A,2856.0
L,M,1328.0
D,E,2103.0
D,F,3243.0
E,S,2832.0
N,A,394.0
O,A,483.0
B,C,792.0
C,G,1119.0
G,T,803.0
T,H,798.0
H,R,2745.0
H,S,3010.0
When you’re ready to hand back the exact layout, just use this tidy little JSON shape so I can read it automatically:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
This just means: ""solution"" is a list of the track segments you want to build. Each inner pair [u, v] names the two stations that the segment connects — think of each pair as one straight line between two stops. It’s just a sketch of the shape I expect, not the final plan itself.
Please use the station identifiers exactly as they appear in the instance — don’t rename them or invent new ones.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 23, 'edges': [{'u': 17, 'v': 18, 'w': 155.0}, {'u': 16, 'v': 20, 'w': 1508.0}, {'u': 16, 'v': 3, 'w': 1586.0}, {'u': 16, 'v': 19, 'w': 1981.0}, {'u': 9, 'v': 6, 'w': 550.0}, {'u': 9, 'v': 5, 'w': 2276.0}, {'u': 9, 'v': 11, 'w': 3960.0}, {'u': 10, 'v': 11, 'w': 1252.0}, {'u': 10, 'v': 13, 'w': 3038.0}, {'u': 10, 'v': 6, 'w': 2580.0}, {'u': 11, 'v': 1, 'w': 2856.0}, {'u': 12, 'v': 13, 'w': 1328.0}, {'u': 4, 'v': 5, 'w': 2103.0}, {'u': 4, 'v': 6, 'w': 3243.0}, {'u': 5, 'v': 19, 'w': 2832.0}, {'u': 14, 'v': 1, 'w': 394.0}, {'u': 15, 'v': 1, 'w': 483.0}, {'u': 2, 'v': 3, 'w': 792.0}, {'u': 3, 'v': 7, 'w': 1119.0}, {'u': 7, 'v': 20, 'w': 803.0}, {'u': 20, 'v': 8, 'w': 798.0}, {'u': 8, 'v': 18, 'w': 2745.0}, {'u': 8, 'v': 19, 'w': 3010.0}], 'k': 10, 'source_file': 'I042.stp', 'density': 0.12105263157894737}","[[16, 20], [16, 19], [6, 9], [5, 9], [5, 19], [2, 3], [3, 7], [7, 20], [8, 20]]",12659.0,"{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 23, 'edges': [{'u': 'Q', 'v': 'R', 'w': 155.0}, {'u': 'P', 'v': 'T', 'w': 1508.0}, {'u': 'P', 'v': 'C', 'w': 1586.0}, {'u': 'P', 'v': 'S', 'w': 1981.0}, {'u': 'I', 'v': 'F', 'w': 550.0}, {'u': 'I', 'v': 'E', 'w': 2276.0}, {'u': 'I', 'v': 'K', 'w': 3960.0}, {'u': 'J', 'v': 'K', 'w': 1252.0}, {'u': 'J', 'v': 'M', 'w': 3038.0}, {'u': 'J', 'v': 'F', 'w': 2580.0}, {'u': 'K', 'v': 'A', 'w': 2856.0}, {'u': 'L', 'v': 'M', 'w': 1328.0}, {'u': 'D', 'v': 'E', 'w': 2103.0}, {'u': 'D', 'v': 'F', 'w': 3243.0}, {'u': 'E', 'v': 'S', 'w': 2832.0}, {'u': 'N', 'v': 'A', 'w': 394.0}, {'u': 'O', 'v': 'A', 'w': 483.0}, {'u': 'B', 'v': 'C', 'w': 792.0}, {'u': 'C', 'v': 'G', 'w': 1119.0}, {'u': 'G', 'v': 'T', 'w': 803.0}, {'u': 'T', 'v': 'H', 'w': 798.0}, {'u': 'H', 'v': 'R', 'w': 2745.0}, {'u': 'H', 'v': 'S', 'w': 3010.0}], 'density': 0.12105263157894737, 'source_file': 'I042.stp', 'k': 10}","[['P', 'T'], ['P', 'S'], ['F', 'I'], ['E', 'I'], ['E', 'S'], ['B', 'C'], ['C', 'G'], ['G', 'T'], ['H', 'T']]",26,csv,names
KMST,KMST,"We have a mountain range full of potential watch points and a set number of slots to fill. The decision is which specific spots to use and which straight connections to make so the selected spots become one connected, loop-free network. Plans are judged by adding up the lengths of the paths added — the smaller that sum, the better — and the rules are that exactly the given number of distinct lookouts must be chosen and no closed loops are allowed. The concrete map and distances follow below.
# total_watchpoints=20
# total_possible_paths=25
# lookouts_to_select=10
watchpoint_u,watchpoint_v,path_distance
14,1,3385.0
7,8,4834.0
7,5,4030.0
8,20,4306.0
4,5,130.0
4,13,2250.0
4,9,2056.0
5,20,1206.0
1,19,647.0
1,15,5839.0
9,10,1299.0
9,15,644.0
10,13,421.0
10,11,8469.0
11,6,1098.0
11,17,1595.0
12,6,6533.0
12,13,6589.0
12,2,4322.0
3,6,1868.0
2,20,6789.0
15,16,3863.0
16,17,3669.0
16,19,5515.0
17,18,349.0
Quick note on how I'd like the answer formatted — keep it simple and JSON-y, like this:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of ""solution"" as just a list of the straight connections you'll make. Each inner pair is one edge (which two lookout IDs get linked). It's just a sketch of the shape I expect you to follow, not the real final plan.
Please use the exact node identifiers from the instance input — do not rename them or invent new labels. Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 25, 'edges': [{'u': 14, 'v': 1, 'w': 3385.0}, {'u': 7, 'v': 8, 'w': 4834.0}, {'u': 7, 'v': 5, 'w': 4030.0}, {'u': 8, 'v': 20, 'w': 4306.0}, {'u': 4, 'v': 5, 'w': 130.0}, {'u': 4, 'v': 13, 'w': 2250.0}, {'u': 4, 'v': 9, 'w': 2056.0}, {'u': 5, 'v': 20, 'w': 1206.0}, {'u': 1, 'v': 19, 'w': 647.0}, {'u': 1, 'v': 15, 'w': 5839.0}, {'u': 9, 'v': 10, 'w': 1299.0}, {'u': 9, 'v': 15, 'w': 644.0}, {'u': 10, 'v': 13, 'w': 421.0}, {'u': 10, 'v': 11, 'w': 8469.0}, {'u': 11, 'v': 6, 'w': 1098.0}, {'u': 11, 'v': 17, 'w': 1595.0}, {'u': 12, 'v': 6, 'w': 6533.0}, {'u': 12, 'v': 13, 'w': 6589.0}, {'u': 12, 'v': 2, 'w': 4322.0}, {'u': 3, 'v': 6, 'w': 1868.0}, {'u': 2, 'v': 20, 'w': 6789.0}, {'u': 15, 'v': 16, 'w': 3863.0}, {'u': 16, 'v': 17, 'w': 3669.0}, {'u': 16, 'v': 19, 'w': 5515.0}, {'u': 17, 'v': 18, 'w': 349.0}], 'k': 10, 'source_file': 'I014.stp', 'density': 0.13157894736842105}","[[4, 5], [4, 9], [5, 20], [9, 10], [9, 15], [10, 13], [15, 16], [16, 17], [17, 18]]",13637.0,"{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 25, 'edges': [{'u': 14, 'v': 1, 'w': 3385.0}, {'u': 7, 'v': 8, 'w': 4834.0}, {'u': 7, 'v': 5, 'w': 4030.0}, {'u': 8, 'v': 20, 'w': 4306.0}, {'u': 4, 'v': 5, 'w': 130.0}, {'u': 4, 'v': 13, 'w': 2250.0}, {'u': 4, 'v': 9, 'w': 2056.0}, {'u': 5, 'v': 20, 'w': 1206.0}, {'u': 1, 'v': 19, 'w': 647.0}, {'u': 1, 'v': 15, 'w': 5839.0}, {'u': 9, 'v': 10, 'w': 1299.0}, {'u': 9, 'v': 15, 'w': 644.0}, {'u': 10, 'v': 13, 'w': 421.0}, {'u': 10, 'v': 11, 'w': 8469.0}, {'u': 11, 'v': 6, 'w': 1098.0}, {'u': 11, 'v': 17, 'w': 1595.0}, {'u': 12, 'v': 6, 'w': 6533.0}, {'u': 12, 'v': 13, 'w': 6589.0}, {'u': 12, 'v': 2, 'w': 4322.0}, {'u': 3, 'v': 6, 'w': 1868.0}, {'u': 2, 'v': 20, 'w': 6789.0}, {'u': 15, 'v': 16, 'w': 3863.0}, {'u': 16, 'v': 17, 'w': 3669.0}, {'u': 16, 'v': 19, 'w': 5515.0}, {'u': 17, 'v': 18, 'w': 349.0}], 'density': 0.13157894736842105, 'source_file': 'I014.stp', 'k': 10}","[[4, 5], [4, 9], [5, 20], [9, 10], [9, 15], [10, 13], [15, 16], [16, 17], [17, 18]]",27,csv,1
KMST,KMST,"Recently the farm manager had to pick exactly k barns and stitch together sections from the stock of fence parts so the chosen barns are all joined together in one enclosure, without forming any cycles and without selecting a barn more than once. The plan that’s better is simply the one that needs less total fence, which is found by summing the lengths of the pieces used. The concrete layout and pieces are shown below.
{
""total_barns"": 20,
""total_fence_pieces"": 24,
""edges"": [
{
""barn_u"": 12,
""barn_v"": 13,
""fence_length"": 333.0
},
{
""barn_u"": 12,
""barn_v"": 8,
""fence_length"": 12160.0
},
{
""barn_u"": 12,
""barn_v"": 14,
""fence_length"": 1042.0
},
{
""barn_u"": 13,
""barn_v"": 1,
""fence_length"": 8437.0
},
{
""barn_u"": 13,
""barn_v"": 18,
""fence_length"": 1041.0
},
{
""barn_u"": 14,
""barn_v"": 6,
""fence_length"": 140.0
},
{
""barn_u"": 14,
""barn_v"": 15,
""fence_length"": 12232.0
},
{
""barn_u"": 4,
""barn_v"": 5,
""fence_length"": 1276.0
},
{
""barn_u"": 4,
""barn_v"": 2,
""fence_length"": 4268.0
},
{
""barn_u"": 19,
""barn_v"": 9,
""fence_length"": 1153.0
},
{
""barn_u"": 15,
""barn_v"": 8,
""fence_length"": 770.0
},
{
""barn_u"": 0,
""barn_v"": 1,
""fence_length"": 692.0
},
{
""barn_u"": 0,
""barn_v"": 9,
""fence_length"": 3574.0
},
{
""barn_u"": 0,
""barn_v"": 18,
""fence_length"": 8613.0
},
{
""barn_u"": 1,
""barn_v"": 2,
""fence_length"": 5273.0
},
{
""barn_u"": 2,
""barn_v"": 3,
""fence_length"": 588.0
},
{
""barn_u"": 3,
""barn_v"": 10,
""fence_length"": 193.0
},
{
""barn_u"": 3,
""barn_v"": 11,
""fence_length"": 1907.0
},
{
""barn_u"": 16,
""barn_v"": 17,
""fence_length"": 1786.0
},
{
""barn_u"": 16,
""barn_v"": 10,
""fence_length"": 922.0
},
{
""barn_u"": 17,
""barn_v"": 11,
""fence_length"": 1456.0
},
{
""barn_u"": 9,
""barn_v"": 10,
""fence_length"": 1637.0
},
{
""barn_u"": 18,
""barn_v"": 7,
""fence_length"": 40.0
},
{
""barn_u"": 6,
""barn_v"": 7,
""fence_length"": 752.0
}
],
""barns_to_enclose"": 8
}
I'll show the output in a tiny, friendly JSON sketch so it's clear what shape the answer should take.
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of ""solution"" as a list of fence pieces — each pair [u, v] is a chosen connection joining barn u to barn v. This block is just the expected shape, not the actual fenced plan.
Please use the exact identifiers from the instance input — do not rename them or invent new ones.
Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 24, 'edges': [{'u': 13, 'v': 14, 'w': 333.0}, {'u': 13, 'v': 9, 'w': 12160.0}, {'u': 13, 'v': 15, 'w': 1042.0}, {'u': 14, 'v': 2, 'w': 8437.0}, {'u': 14, 'v': 19, 'w': 1041.0}, {'u': 15, 'v': 7, 'w': 140.0}, {'u': 15, 'v': 16, 'w': 12232.0}, {'u': 5, 'v': 6, 'w': 1276.0}, {'u': 5, 'v': 3, 'w': 4268.0}, {'u': 20, 'v': 10, 'w': 1153.0}, {'u': 16, 'v': 9, 'w': 770.0}, {'u': 1, 'v': 2, 'w': 692.0}, {'u': 1, 'v': 10, 'w': 3574.0}, {'u': 1, 'v': 19, 'w': 8613.0}, {'u': 2, 'v': 3, 'w': 5273.0}, {'u': 3, 'v': 4, 'w': 588.0}, {'u': 4, 'v': 11, 'w': 193.0}, {'u': 4, 'v': 12, 'w': 1907.0}, {'u': 17, 'v': 18, 'w': 1786.0}, {'u': 17, 'v': 11, 'w': 922.0}, {'u': 18, 'v': 12, 'w': 1456.0}, {'u': 10, 'v': 11, 'w': 1637.0}, {'u': 19, 'v': 8, 'w': 40.0}, {'u': 7, 'v': 8, 'w': 752.0}], 'k': 8, 'source_file': 'I067.stp', 'density': 0.12631578947368421}","[[10, 20], [3, 4], [4, 11], [17, 18], [11, 17], [12, 18], [10, 11]]",7735.0,"{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 24, 'edges': [{'u': 12, 'v': 13, 'w': 333.0}, {'u': 12, 'v': 8, 'w': 12160.0}, {'u': 12, 'v': 14, 'w': 1042.0}, {'u': 13, 'v': 1, 'w': 8437.0}, {'u': 13, 'v': 18, 'w': 1041.0}, {'u': 14, 'v': 6, 'w': 140.0}, {'u': 14, 'v': 15, 'w': 12232.0}, {'u': 4, 'v': 5, 'w': 1276.0}, {'u': 4, 'v': 2, 'w': 4268.0}, {'u': 19, 'v': 9, 'w': 1153.0}, {'u': 15, 'v': 8, 'w': 770.0}, {'u': 0, 'v': 1, 'w': 692.0}, {'u': 0, 'v': 9, 'w': 3574.0}, {'u': 0, 'v': 18, 'w': 8613.0}, {'u': 1, 'v': 2, 'w': 5273.0}, {'u': 2, 'v': 3, 'w': 588.0}, {'u': 3, 'v': 10, 'w': 193.0}, {'u': 3, 'v': 11, 'w': 1907.0}, {'u': 16, 'v': 17, 'w': 1786.0}, {'u': 16, 'v': 10, 'w': 922.0}, {'u': 17, 'v': 11, 'w': 1456.0}, {'u': 9, 'v': 10, 'w': 1637.0}, {'u': 18, 'v': 7, 'w': 40.0}, {'u': 6, 'v': 7, 'w': 752.0}], 'density': 0.12631578947368421, 'source_file': 'I067.stp', 'k': 8}","[[9, 19], [2, 3], [3, 10], [16, 17], [10, 16], [11, 17], [9, 10]]",28,json,0
KMST,KMST,"There’s a field job where the crew must choose exactly k towers from a set of candidates, then select which microwave connections to build so every chosen tower is reachable from the others, avoiding any redundant circular connections, and judging plans by the sum of the link costs — the smaller that sum, the better. The concrete details are shown below.
# total_candidate_towers=16
# total_candidate_links=19
# required_selected_towers=8
endpoint_u_site,endpoint_v_site,link_cost
D,L,1154.0
E,F,2182.0
E,M,3224.0
E,J,5925.0
N,I,5670.0
A,J,1540.0
A,K,369.0
B,C,16388.0
B,O,5488.0
C,O,18914.0
P,H,7918.0
P,L,2712.0
F,G,1463.0
F,J,4063.0
I,G,11538.0
I,H,5277.0
J,O,9338.0
M,L,744.0
M,G,4743.0
Also, when you send back the chosen links, please use this simple JSON layout so it's easy to parse:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of ""solution"" as a list of the microwave links you'll build; each inner pair like [u1, v1] is one connection between two selected towers. This is just a sketch of the expected shape — not the actual answer — so fill it with the exact edge pairs you pick.
Please don't rename any identifiers or invent new labels; use the node names exactly as they appear in the instance input — no tweaks.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 19, 'edges': [{'u': 4, 'v': 12, 'w': 1154.0}, {'u': 5, 'v': 6, 'w': 2182.0}, {'u': 5, 'v': 13, 'w': 3224.0}, {'u': 5, 'v': 10, 'w': 5925.0}, {'u': 14, 'v': 9, 'w': 5670.0}, {'u': 1, 'v': 10, 'w': 1540.0}, {'u': 1, 'v': 11, 'w': 369.0}, {'u': 2, 'v': 3, 'w': 16388.0}, {'u': 2, 'v': 15, 'w': 5488.0}, {'u': 3, 'v': 15, 'w': 18914.0}, {'u': 16, 'v': 8, 'w': 7918.0}, {'u': 16, 'v': 12, 'w': 2712.0}, {'u': 6, 'v': 7, 'w': 1463.0}, {'u': 6, 'v': 10, 'w': 4063.0}, {'u': 9, 'v': 7, 'w': 11538.0}, {'u': 9, 'v': 8, 'w': 5277.0}, {'u': 10, 'v': 15, 'w': 9338.0}, {'u': 13, 'v': 12, 'w': 744.0}, {'u': 13, 'v': 7, 'w': 4743.0}], 'k': 8, 'source_file': 'I012.stp', 'density': 0.15833333333333333}","[[4, 12], [5, 6], [5, 13], [1, 10], [1, 11], [6, 10], [12, 13]]",13276.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 19, 'edges': [{'u': 'D', 'v': 'L', 'w': 1154.0}, {'u': 'E', 'v': 'F', 'w': 2182.0}, {'u': 'E', 'v': 'M', 'w': 3224.0}, {'u': 'E', 'v': 'J', 'w': 5925.0}, {'u': 'N', 'v': 'I', 'w': 5670.0}, {'u': 'A', 'v': 'J', 'w': 1540.0}, {'u': 'A', 'v': 'K', 'w': 369.0}, {'u': 'B', 'v': 'C', 'w': 16388.0}, {'u': 'B', 'v': 'O', 'w': 5488.0}, {'u': 'C', 'v': 'O', 'w': 18914.0}, {'u': 'P', 'v': 'H', 'w': 7918.0}, {'u': 'P', 'v': 'L', 'w': 2712.0}, {'u': 'F', 'v': 'G', 'w': 1463.0}, {'u': 'F', 'v': 'J', 'w': 4063.0}, {'u': 'I', 'v': 'G', 'w': 11538.0}, {'u': 'I', 'v': 'H', 'w': 5277.0}, {'u': 'J', 'v': 'O', 'w': 9338.0}, {'u': 'M', 'v': 'L', 'w': 744.0}, {'u': 'M', 'v': 'G', 'w': 4743.0}], 'density': 0.15833333333333333, 'source_file': 'I012.stp', 'k': 8}","[['D', 'L'], ['E', 'F'], ['E', 'M'], ['A', 'J'], ['A', 'K'], ['F', 'J'], ['L', 'M']]",29,csv,names
KMST,KMST,"There’s a curator’s puzzle on the table: choose exactly k items from the gallery and link them together using permitted passageways so the group is all connected, but don’t let those passages form a circle. The way to judge a plan is simple — add up the lengths of the selected corridors and pick the plan with the smallest total. Every chosen exhibit must be included once, nothing extra, and the concrete map and distances appear below.
The gallery shows 17 exhibits and 21 permitted corridors; select exactly 8 exhibits.
Permitted corridor between exhibits E and Q with length 1427.0.
Permitted corridor between exhibits E and F with length 1076.0.
Permitted corridor between exhibits E and G with length 355.0.
Permitted corridor between exhibits A and B with length 1395.0.
Permitted corridor between exhibits A and C with length 1062.0.
Permitted corridor between exhibits B and I with length 837.0.
Permitted corridor between exhibits I and C with length 1232.0.
Permitted corridor between exhibits I and K with length 528.0.
Permitted corridor between exhibits C and F with length 1805.0.
Permitted corridor between exhibits P and Q with length 1371.0.
Permitted corridor between exhibits P and L with length 1783.0.
Permitted corridor between exhibits P and N with length 2093.0.
Permitted corridor between exhibits G and H with length 1258.0.
Permitted corridor between exhibits G and N with length 1066.0.
Permitted corridor between exhibits O and L with length 6761.0.
Permitted corridor between exhibits K and L with length 1780.0.
Permitted corridor between exhibits K and Q with length 1584.0.
Permitted corridor between exhibits J and H with length 426.0.
Permitted corridor between exhibits J and M with length 4001.0.
Permitted corridor between exhibits M and N with length 3601.0.
Permitted corridor between exhibits D and F with length 10.0.
Pick a connected, acyclic selection of exactly 8 exhibits that minimizes the sum of chosen corridor lengths.
You can just hand me the chosen corridors in a tiny JSON snip — nice and simple. Something like this will do:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
This ""solution"" array is just a list of the passageways you pick, each pair [u, v] meaning ""connect exhibit u to exhibit v"" in the curator’s plan. Think of it like filling in a form: list the corridor pairs you want. The block above is only a sketch of the shape I expect, not the actual answer — replace those placeholders with the real labels from the instance.
Please use the identifiers exactly as they appear in the instance input — don’t rename them and don’t invent new labels.
for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 21, 'edges': [{'u': 5, 'v': 17, 'w': 1427.0}, {'u': 5, 'v': 6, 'w': 1076.0}, {'u': 5, 'v': 7, 'w': 355.0}, {'u': 1, 'v': 2, 'w': 1395.0}, {'u': 1, 'v': 3, 'w': 1062.0}, {'u': 2, 'v': 9, 'w': 837.0}, {'u': 9, 'v': 3, 'w': 1232.0}, {'u': 9, 'v': 11, 'w': 528.0}, {'u': 3, 'v': 6, 'w': 1805.0}, {'u': 16, 'v': 17, 'w': 1371.0}, {'u': 16, 'v': 12, 'w': 1783.0}, {'u': 16, 'v': 14, 'w': 2093.0}, {'u': 7, 'v': 8, 'w': 1258.0}, {'u': 7, 'v': 14, 'w': 1066.0}, {'u': 15, 'v': 12, 'w': 6761.0}, {'u': 11, 'v': 12, 'w': 1780.0}, {'u': 11, 'v': 17, 'w': 1584.0}, {'u': 10, 'v': 8, 'w': 426.0}, {'u': 10, 'v': 13, 'w': 4001.0}, {'u': 13, 'v': 14, 'w': 3601.0}, {'u': 4, 'v': 6, 'w': 10.0}], 'k': 8, 'source_file': 'I042.stp', 'density': 0.15441176470588236}","[[5, 17], [5, 6], [5, 7], [7, 8], [7, 14], [8, 10], [4, 6]]",5618.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 21, 'edges': [{'u': 'E', 'v': 'Q', 'w': 1427.0}, {'u': 'E', 'v': 'F', 'w': 1076.0}, {'u': 'E', 'v': 'G', 'w': 355.0}, {'u': 'A', 'v': 'B', 'w': 1395.0}, {'u': 'A', 'v': 'C', 'w': 1062.0}, {'u': 'B', 'v': 'I', 'w': 837.0}, {'u': 'I', 'v': 'C', 'w': 1232.0}, {'u': 'I', 'v': 'K', 'w': 528.0}, {'u': 'C', 'v': 'F', 'w': 1805.0}, {'u': 'P', 'v': 'Q', 'w': 1371.0}, {'u': 'P', 'v': 'L', 'w': 1783.0}, {'u': 'P', 'v': 'N', 'w': 2093.0}, {'u': 'G', 'v': 'H', 'w': 1258.0}, {'u': 'G', 'v': 'N', 'w': 1066.0}, {'u': 'O', 'v': 'L', 'w': 6761.0}, {'u': 'K', 'v': 'L', 'w': 1780.0}, {'u': 'K', 'v': 'Q', 'w': 1584.0}, {'u': 'J', 'v': 'H', 'w': 426.0}, {'u': 'J', 'v': 'M', 'w': 4001.0}, {'u': 'M', 'v': 'N', 'w': 3601.0}, {'u': 'D', 'v': 'F', 'w': 10.0}], 'density': 0.15441176470588236, 'source_file': 'I042.stp', 'k': 8}","[['E', 'Q'], ['E', 'F'], ['E', 'G'], ['G', 'H'], ['G', 'N'], ['H', 'J'], ['D', 'F']]",30,markdown_table,names
KMST,KMST,"Many people imagine wiring is just about running wire from A to B, but this job was different: only k homes should be picked to interconnect, and the electrician must choose which homes and which available segments make up the network so the selected homes are all connected, without forming any loops or repeating segments. The best choice is the one with the lowest total installation cost, obtained by adding up the costs of the installed segments. The candidate segments, house list, and prices are listed below.
Below are the 18 available segments among the 16 candidate houses; the electrician must select exactly 6 houses to interconnect into a loop-free network.
Candidate segment between house 5 and house 10: installation cost 233.0.
Candidate segment between house 5 and house 14: installation cost 5721.0.
Candidate segment between house 3 and house 4: installation cost 1367.0.
Candidate segment between house 3 and house 6: installation cost 5206.0.
Candidate segment between house 3 and house 7: installation cost 5154.0.
Candidate segment between house 4 and house 11: installation cost 7156.0.
Candidate segment between house 4 and house 12: installation cost 849.0.
Candidate segment between house 14 and house 13: installation cost 3048.0.
Candidate segment between house 14 and house 16: installation cost 668.0.
Candidate segment between house 15 and house 6: installation cost 11526.0.
Candidate segment between house 15 and house 8: installation cost 661.0.
Candidate segment between house 15 and house 2: installation cost 3245.0.
Candidate segment between house 6 and house 11: installation cost 2936.0.
Candidate segment between house 11 and house 16: installation cost 6278.0.
Candidate segment between house 16 and house 10: installation cost 5366.0.
Candidate segment between house 10 and house 1: installation cost 8493.0.
Candidate segment between house 12 and house 1: installation cost 5213.0.
Candidate segment between house 12 and house 9: installation cost 637.0.
The electrician will choose the set of 6 houses and segments that gives the lowest total installation cost.
When you give the final answer, just use this simple JSON layout so it's easy to check automatically:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is a list of the chosen wire segments. Each inner pair [u1, v1] is one installed segment connecting two homes (use the exact home identifiers from the instance). Think of it like filling out a short list of which connections you picked — no need for anything else in the file.
This JSON is just a sketch of the shape I expect, not the actual answer — replace the placeholders with the real edges from the instance.
Please make sure all identifiers are used exactly as they appear in the instance input — do not rename them or invent new labels. For example: Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 18, 'edges': [{'u': 5, 'v': 10, 'w': 233.0}, {'u': 5, 'v': 14, 'w': 5721.0}, {'u': 3, 'v': 4, 'w': 1367.0}, {'u': 3, 'v': 6, 'w': 5206.0}, {'u': 3, 'v': 7, 'w': 5154.0}, {'u': 4, 'v': 11, 'w': 7156.0}, {'u': 4, 'v': 12, 'w': 849.0}, {'u': 14, 'v': 13, 'w': 3048.0}, {'u': 14, 'v': 16, 'w': 668.0}, {'u': 15, 'v': 6, 'w': 11526.0}, {'u': 15, 'v': 8, 'w': 661.0}, {'u': 15, 'v': 2, 'w': 3245.0}, {'u': 6, 'v': 11, 'w': 2936.0}, {'u': 11, 'v': 16, 'w': 6278.0}, {'u': 16, 'v': 10, 'w': 5366.0}, {'u': 10, 'v': 1, 'w': 8493.0}, {'u': 12, 'v': 1, 'w': 5213.0}, {'u': 12, 'v': 9, 'w': 637.0}], 'k': 6, 'source_file': 'I037.stp', 'density': 0.15}","[[3, 4], [3, 6], [4, 12], [6, 11], [9, 12]]",10995.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 18, 'edges': [{'u': 5, 'v': 10, 'w': 233.0}, {'u': 5, 'v': 14, 'w': 5721.0}, {'u': 3, 'v': 4, 'w': 1367.0}, {'u': 3, 'v': 6, 'w': 5206.0}, {'u': 3, 'v': 7, 'w': 5154.0}, {'u': 4, 'v': 11, 'w': 7156.0}, {'u': 4, 'v': 12, 'w': 849.0}, {'u': 14, 'v': 13, 'w': 3048.0}, {'u': 14, 'v': 16, 'w': 668.0}, {'u': 15, 'v': 6, 'w': 11526.0}, {'u': 15, 'v': 8, 'w': 661.0}, {'u': 15, 'v': 2, 'w': 3245.0}, {'u': 6, 'v': 11, 'w': 2936.0}, {'u': 11, 'v': 16, 'w': 6278.0}, {'u': 16, 'v': 10, 'w': 5366.0}, {'u': 10, 'v': 1, 'w': 8493.0}, {'u': 12, 'v': 1, 'w': 5213.0}, {'u': 12, 'v': 9, 'w': 637.0}], 'density': 0.15, 'source_file': 'I037.stp', 'k': 6}","[[3, 4], [3, 6], [4, 12], [6, 11], [9, 12]]",31,nl,1
KMST,KMST,"We’ve got to set up a compact aid network: decide on exactly k places to serve as aid stations and pick the roads that tie those spots together so anyone can get from one chosen station to another using only those roads, with no circular routes allowed. The preferred setup is the one whose roads add up to the smallest possible travel time — calculated by adding the travel time of each chosen road. It’s important that exactly k stations are selected and each road is included only as part of that connecting system. The specific stations and road times are listed below.
{
""total_locations"": 16,
""total_roads"": 20,
""edges"": [
{
""road_endpoint_a"": ""D"",
""road_endpoint_b"": ""E"",
""travel_time"": 521.0
},
{
""road_endpoint_a"": ""D"",
""road_endpoint_b"": ""F"",
""travel_time"": 558.0
},
{
""road_endpoint_a"": ""D"",
""road_endpoint_b"": ""H"",
""travel_time"": 10.0
},
{
""road_endpoint_a"": ""D"",
""road_endpoint_b"": ""J"",
""travel_time"": 2202.0
},
{
""road_endpoint_a"": ""F"",
""road_endpoint_b"": ""E"",
""travel_time"": 69.0
},
{
""road_endpoint_a"": ""A"",
""road_endpoint_b"": ""B"",
""travel_time"": 2083.0
},
{
""road_endpoint_a"": ""A"",
""road_endpoint_b"": ""M"",
""travel_time"": 8983.0
},
{
""road_endpoint_a"": ""M"",
""road_endpoint_b"": ""I"",
""travel_time"": 1806.0
},
{
""road_endpoint_a"": ""M"",
""road_endpoint_b"": ""O"",
""travel_time"": 972.0
},
{
""road_endpoint_a"": ""B"",
""road_endpoint_b"": ""G"",
""travel_time"": 354.0
},
{
""road_endpoint_a"": ""B"",
""road_endpoint_b"": ""K"",
""travel_time"": 5437.0
},
{
""road_endpoint_a"": ""C"",
""road_endpoint_b"": ""G"",
""travel_time"": 9546.0
},
{
""road_endpoint_a"": ""P"",
""road_endpoint_b"": ""J"",
""travel_time"": 8943.0
},
{
""road_endpoint_a"": ""H"",
""road_endpoint_b"": ""I"",
""travel_time"": 597.0
},
{
""road_endpoint_a"": ""H"",
""road_endpoint_b"": ""O"",
""travel_time"": 2088.0
},
{
""road_endpoint_a"": ""J"",
""road_endpoint_b"": ""L"",
""travel_time"": 664.0
},
{
""road_endpoint_a"": ""K"",
""road_endpoint_b"": ""L"",
""travel_time"": 1281.0
},
{
""road_endpoint_a"": ""K"",
""road_endpoint_b"": ""N"",
""travel_time"": 1369.0
},
{
""road_endpoint_a"": ""L"",
""road_endpoint_b"": ""N"",
""travel_time"": 460.0
},
{
""road_endpoint_a"": ""N"",
""road_endpoint_b"": ""O"",
""travel_time"": 322.0
}
],
""stations_required"": 6
}
Just send the chosen tree as a small JSON snippet so it's easy to check automatically. Something like this works fine:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is the list of roads you'll pick for the aid network. Each pair like [u1, v1] is one road connecting station u1 to station v1. Think of it as a simple form: one pair per chosen road, and together the pairs should connect exactly k stations without any loops.
This JSON is only a sketch of the shape I expect — it's not the actual answer. Please make sure to use the exact identifiers from the instance input, with no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 4, 'v': 5, 'w': 521.0}, {'u': 4, 'v': 6, 'w': 558.0}, {'u': 4, 'v': 8, 'w': 10.0}, {'u': 4, 'v': 10, 'w': 2202.0}, {'u': 6, 'v': 5, 'w': 69.0}, {'u': 1, 'v': 2, 'w': 2083.0}, {'u': 1, 'v': 13, 'w': 8983.0}, {'u': 13, 'v': 9, 'w': 1806.0}, {'u': 13, 'v': 15, 'w': 972.0}, {'u': 2, 'v': 7, 'w': 354.0}, {'u': 2, 'v': 11, 'w': 5437.0}, {'u': 3, 'v': 7, 'w': 9546.0}, {'u': 16, 'v': 10, 'w': 8943.0}, {'u': 8, 'v': 9, 'w': 597.0}, {'u': 8, 'v': 15, 'w': 2088.0}, {'u': 10, 'v': 12, 'w': 664.0}, {'u': 11, 'v': 12, 'w': 1281.0}, {'u': 11, 'v': 14, 'w': 1369.0}, {'u': 12, 'v': 14, 'w': 460.0}, {'u': 14, 'v': 15, 'w': 322.0}], 'k': 6, 'source_file': 'I040.stp', 'density': 0.16666666666666666}","[[4, 5], [4, 8], [5, 6], [9, 13], [8, 9]]",3003.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 20, 'edges': [{'u': 'D', 'v': 'E', 'w': 521.0}, {'u': 'D', 'v': 'F', 'w': 558.0}, {'u': 'D', 'v': 'H', 'w': 10.0}, {'u': 'D', 'v': 'J', 'w': 2202.0}, {'u': 'F', 'v': 'E', 'w': 69.0}, {'u': 'A', 'v': 'B', 'w': 2083.0}, {'u': 'A', 'v': 'M', 'w': 8983.0}, {'u': 'M', 'v': 'I', 'w': 1806.0}, {'u': 'M', 'v': 'O', 'w': 972.0}, {'u': 'B', 'v': 'G', 'w': 354.0}, {'u': 'B', 'v': 'K', 'w': 5437.0}, {'u': 'C', 'v': 'G', 'w': 9546.0}, {'u': 'P', 'v': 'J', 'w': 8943.0}, {'u': 'H', 'v': 'I', 'w': 597.0}, {'u': 'H', 'v': 'O', 'w': 2088.0}, {'u': 'J', 'v': 'L', 'w': 664.0}, {'u': 'K', 'v': 'L', 'w': 1281.0}, {'u': 'K', 'v': 'N', 'w': 1369.0}, {'u': 'L', 'v': 'N', 'w': 460.0}, {'u': 'N', 'v': 'O', 'w': 322.0}], 'density': 0.16666666666666666, 'source_file': 'I040.stp', 'k': 6}","[['D', 'E'], ['D', 'H'], ['E', 'F'], ['I', 'M'], ['H', 'I']]",32,json,names
KMST,KMST,"We’re trying to build a tight little leadership circle of exactly k local leaders. That means choosing the k leaders first, then arranging specific pairwise introductions so that all chosen leaders are linked together into a single connected group, while avoiding any redundant, loop-forming introductions. Every introduction has an effort score; add those scores for the introductions that are scheduled to get the total effort, and a better choice is the one with a lower total. The actual people, possible introductions, and their effort values are listed below.
# total_local_leaders_available=18
# total_possible_introductions=22
# target_leader_count=7
leader_u,leader_v,introduction_effort
I,Q,884.0
A,K,3177.0
J,G,4792.0
J,K,4266.0
J,R,2544.0
K,F,6065.0
Q,H,1652.0
Q,R,1647.0
R,C,7061.0
O,N,4150.0
O,E,5922.0
O,B,1547.0
D,E,6978.0
D,L,5664.0
D,N,4303.0
E,C,4599.0
C,G,5675.0
G,F,3911.0
F,L,2106.0
N,P,16.0
L,M,790.0
M,P,8733.0
Also, when you send back the scheduled introductions, please use this simple JSON shape so it's easy to check:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of ""solution"" as a list of the pairwise intros we'll schedule; each [u, v] is one introduction linking leader u with leader v. This snippet is just a sketch of the shape I expect — not the actual answer.
Please make sure to use the identifiers exactly as they appear in the instance input — no renaming and no new labels.
For example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 22, 'edges': [{'u': 9, 'v': 17, 'w': 884.0}, {'u': 1, 'v': 11, 'w': 3177.0}, {'u': 10, 'v': 7, 'w': 4792.0}, {'u': 10, 'v': 11, 'w': 4266.0}, {'u': 10, 'v': 18, 'w': 2544.0}, {'u': 11, 'v': 6, 'w': 6065.0}, {'u': 17, 'v': 8, 'w': 1652.0}, {'u': 17, 'v': 18, 'w': 1647.0}, {'u': 18, 'v': 3, 'w': 7061.0}, {'u': 15, 'v': 14, 'w': 4150.0}, {'u': 15, 'v': 5, 'w': 5922.0}, {'u': 15, 'v': 2, 'w': 1547.0}, {'u': 4, 'v': 5, 'w': 6978.0}, {'u': 4, 'v': 12, 'w': 5664.0}, {'u': 4, 'v': 14, 'w': 4303.0}, {'u': 5, 'v': 3, 'w': 4599.0}, {'u': 3, 'v': 7, 'w': 5675.0}, {'u': 7, 'v': 6, 'w': 3911.0}, {'u': 6, 'v': 12, 'w': 2106.0}, {'u': 14, 'v': 16, 'w': 16.0}, {'u': 12, 'v': 13, 'w': 790.0}, {'u': 13, 'v': 16, 'w': 8733.0}], 'k': 7, 'source_file': 'I049.stp', 'density': 0.1437908496732026}","[[9, 17], [1, 11], [10, 11], [10, 18], [8, 17], [17, 18]]",14170.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 22, 'edges': [{'u': 'I', 'v': 'Q', 'w': 884.0}, {'u': 'A', 'v': 'K', 'w': 3177.0}, {'u': 'J', 'v': 'G', 'w': 4792.0}, {'u': 'J', 'v': 'K', 'w': 4266.0}, {'u': 'J', 'v': 'R', 'w': 2544.0}, {'u': 'K', 'v': 'F', 'w': 6065.0}, {'u': 'Q', 'v': 'H', 'w': 1652.0}, {'u': 'Q', 'v': 'R', 'w': 1647.0}, {'u': 'R', 'v': 'C', 'w': 7061.0}, {'u': 'O', 'v': 'N', 'w': 4150.0}, {'u': 'O', 'v': 'E', 'w': 5922.0}, {'u': 'O', 'v': 'B', 'w': 1547.0}, {'u': 'D', 'v': 'E', 'w': 6978.0}, {'u': 'D', 'v': 'L', 'w': 5664.0}, {'u': 'D', 'v': 'N', 'w': 4303.0}, {'u': 'E', 'v': 'C', 'w': 4599.0}, {'u': 'C', 'v': 'G', 'w': 5675.0}, {'u': 'G', 'v': 'F', 'w': 3911.0}, {'u': 'F', 'v': 'L', 'w': 2106.0}, {'u': 'N', 'v': 'P', 'w': 16.0}, {'u': 'L', 'v': 'M', 'w': 790.0}, {'u': 'M', 'v': 'P', 'w': 8733.0}], 'density': 0.1437908496732026, 'source_file': 'I049.stp', 'k': 7}","[['I', 'Q'], ['A', 'K'], ['J', 'K'], ['J', 'R'], ['H', 'Q'], ['Q', 'R']]",33,csv,names
KMST,KMST,"Back when the team reviewed the garden project, the brief was clear: pick exactly k ponds to showcase and use the pipe segments on hand to link them into a single, loop-free water system — no extra ponds, no duplicated connections, and every chosen pond must be part of that one network. Plans are compared by totaling the lengths of the pipes used, and the plan with the smallest total length is preferred; the concrete layout and segment lengths follow below.
# total_ponds=18
# total_pipe_segments=23
# ponds_to_select=5
pond_endpoint_u,pond_endpoint_v,pipe_length
10,7,3652.0
10,4,7440.0
10,3,4657.0
1,2,14112.0
2,5,10806.0
2,8,3070.0
2,13,1218.0
14,5,3270.0
14,15,931.0
14,8,10799.0
15,9,3994.0
15,7,10768.0
16,9,1160.0
16,17,774.0
16,18,5547.0
5,6,1562.0
18,11,827.0
18,4,904.0
17,11,5514.0
7,8,653.0
4,9,5197.0
3,11,12252.0
12,13,880.0
Also, when you send your plan back, keep it in this simple JSON shape so I can read it easily:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
""solution"" is just a list of pipe segments: each inner pair [u, v] means ""connect pond u to pond v"" in the final loop-free layout. Think of it like filling out a short form — one line per pipe. This is only a sketch of the shape I expect, not the actual answer.
Please use the exact identifiers from the instance input — don't rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 23, 'edges': [{'u': 10, 'v': 7, 'w': 3652.0}, {'u': 10, 'v': 4, 'w': 7440.0}, {'u': 10, 'v': 3, 'w': 4657.0}, {'u': 1, 'v': 2, 'w': 14112.0}, {'u': 2, 'v': 5, 'w': 10806.0}, {'u': 2, 'v': 8, 'w': 3070.0}, {'u': 2, 'v': 13, 'w': 1218.0}, {'u': 14, 'v': 5, 'w': 3270.0}, {'u': 14, 'v': 15, 'w': 931.0}, {'u': 14, 'v': 8, 'w': 10799.0}, {'u': 15, 'v': 9, 'w': 3994.0}, {'u': 15, 'v': 7, 'w': 10768.0}, {'u': 16, 'v': 9, 'w': 1160.0}, {'u': 16, 'v': 17, 'w': 774.0}, {'u': 16, 'v': 18, 'w': 5547.0}, {'u': 5, 'v': 6, 'w': 1562.0}, {'u': 18, 'v': 11, 'w': 827.0}, {'u': 18, 'v': 4, 'w': 904.0}, {'u': 17, 'v': 11, 'w': 5514.0}, {'u': 7, 'v': 8, 'w': 653.0}, {'u': 4, 'v': 9, 'w': 5197.0}, {'u': 3, 'v': 11, 'w': 12252.0}, {'u': 12, 'v': 13, 'w': 880.0}], 'k': 5, 'source_file': 'I019.stp', 'density': 0.1503267973856209}","[[2, 8], [2, 13], [7, 8], [12, 13]]",5821.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 23, 'edges': [{'u': 10, 'v': 7, 'w': 3652.0}, {'u': 10, 'v': 4, 'w': 7440.0}, {'u': 10, 'v': 3, 'w': 4657.0}, {'u': 1, 'v': 2, 'w': 14112.0}, {'u': 2, 'v': 5, 'w': 10806.0}, {'u': 2, 'v': 8, 'w': 3070.0}, {'u': 2, 'v': 13, 'w': 1218.0}, {'u': 14, 'v': 5, 'w': 3270.0}, {'u': 14, 'v': 15, 'w': 931.0}, {'u': 14, 'v': 8, 'w': 10799.0}, {'u': 15, 'v': 9, 'w': 3994.0}, {'u': 15, 'v': 7, 'w': 10768.0}, {'u': 16, 'v': 9, 'w': 1160.0}, {'u': 16, 'v': 17, 'w': 774.0}, {'u': 16, 'v': 18, 'w': 5547.0}, {'u': 5, 'v': 6, 'w': 1562.0}, {'u': 18, 'v': 11, 'w': 827.0}, {'u': 18, 'v': 4, 'w': 904.0}, {'u': 17, 'v': 11, 'w': 5514.0}, {'u': 7, 'v': 8, 'w': 653.0}, {'u': 4, 'v': 9, 'w': 5197.0}, {'u': 3, 'v': 11, 'w': 12252.0}, {'u': 12, 'v': 13, 'w': 880.0}], 'density': 0.1503267973856209, 'source_file': 'I019.stp', 'k': 5}","[[2, 8], [2, 13], [7, 8], [12, 13]]",34,csv,1
KMST,KMST,"On a typical planning shift the duty is to choose exactly k landing pads from the available sites, assign allowed corridors between them so the selected pads form one connected system with no circular flight loops, and try to keep the sum of all corridor lengths as small as it can be. The sum of the corridor lengths is how the plan’s cost is measured. The full map and numbers are shown below.
# total_landing_pads=18
# total_aerial_corridors=22
# target_pads_to_select=7
pad_u,pad_v,corridor_length
E,D,497.0
E,J,381.0
E,N,251.0
F,D,143.0
F,N,539.0
G,J,141.0
G,H,245092.0
I,D,387.0
Q,R,1019.0
Q,P,397.0
R,O,509.0
R,N,1640.0
R,M,1925.0
L,K,681.0
L,O,2550.0
M,C,593.0
M,B,46.0
O,P,1169.0
A,K,304.0
B,K,285.0
B,C,612.0
C,J,551.0
When you send the plan back, please stick to this simple JSON layout so I can read it automatically:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
This shows a list of corridor pairs — each pair is an edge between two chosen pads (so [u1, v1] means a corridor connecting pad u1 and pad v1). Think of it like a little form: the ""solution"" field holds all the chosen corridors that make up your connected, loop-free system. This JSON is just a sketch of the shape I need, not the actual answer — replace those placeholders with the real pad identifiers from the instance.
Please be careful to use the identifiers exactly as they appear in the instance input — no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 22, 'edges': [{'u': 5, 'v': 4, 'w': 497.0}, {'u': 5, 'v': 10, 'w': 381.0}, {'u': 5, 'v': 14, 'w': 251.0}, {'u': 6, 'v': 4, 'w': 143.0}, {'u': 6, 'v': 14, 'w': 539.0}, {'u': 7, 'v': 10, 'w': 141.0}, {'u': 7, 'v': 8, 'w': 245092.0}, {'u': 9, 'v': 4, 'w': 387.0}, {'u': 17, 'v': 18, 'w': 1019.0}, {'u': 17, 'v': 16, 'w': 397.0}, {'u': 18, 'v': 15, 'w': 509.0}, {'u': 18, 'v': 14, 'w': 1640.0}, {'u': 18, 'v': 13, 'w': 1925.0}, {'u': 12, 'v': 11, 'w': 681.0}, {'u': 12, 'v': 15, 'w': 2550.0}, {'u': 13, 'v': 3, 'w': 593.0}, {'u': 13, 'v': 2, 'w': 46.0}, {'u': 15, 'v': 16, 'w': 1169.0}, {'u': 1, 'v': 11, 'w': 304.0}, {'u': 2, 'v': 11, 'w': 285.0}, {'u': 2, 'v': 3, 'w': 612.0}, {'u': 3, 'v': 10, 'w': 551.0}], 'k': 7, 'source_file': 'I082.stp', 'density': 0.1437908496732026}","[[4, 5], [5, 10], [5, 14], [4, 6], [7, 10], [4, 9]]",1800.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 22, 'edges': [{'u': 'E', 'v': 'D', 'w': 497.0}, {'u': 'E', 'v': 'J', 'w': 381.0}, {'u': 'E', 'v': 'N', 'w': 251.0}, {'u': 'F', 'v': 'D', 'w': 143.0}, {'u': 'F', 'v': 'N', 'w': 539.0}, {'u': 'G', 'v': 'J', 'w': 141.0}, {'u': 'G', 'v': 'H', 'w': 245092.0}, {'u': 'I', 'v': 'D', 'w': 387.0}, {'u': 'Q', 'v': 'R', 'w': 1019.0}, {'u': 'Q', 'v': 'P', 'w': 397.0}, {'u': 'R', 'v': 'O', 'w': 509.0}, {'u': 'R', 'v': 'N', 'w': 1640.0}, {'u': 'R', 'v': 'M', 'w': 1925.0}, {'u': 'L', 'v': 'K', 'w': 681.0}, {'u': 'L', 'v': 'O', 'w': 2550.0}, {'u': 'M', 'v': 'C', 'w': 593.0}, {'u': 'M', 'v': 'B', 'w': 46.0}, {'u': 'O', 'v': 'P', 'w': 1169.0}, {'u': 'A', 'v': 'K', 'w': 304.0}, {'u': 'B', 'v': 'K', 'w': 285.0}, {'u': 'B', 'v': 'C', 'w': 612.0}, {'u': 'C', 'v': 'J', 'w': 551.0}], 'density': 0.1437908496732026, 'source_file': 'I082.stp', 'k': 7}","[['D', 'E'], ['E', 'J'], ['E', 'N'], ['D', 'F'], ['G', 'J'], ['D', 'I']]",35,csv,names
KMST,KMST,"Many people on campus want faster links, so the task is to select exactly k buildings to interconnect with new conduit using only the available routes, ensure those chosen buildings form a single connected group, and avoid any redundant circular runs. A plan is better if the sum of its conduit segments is smaller — total length is the straightforward sum of the chosen route lengths. The specific instance information is shown below.
There are 17 buildings and 22 available routes; exactly 7 buildings must be selected and interconnected.
Route between building M and building E with length 1836.0.
Route between building M and building P with length 459.0.
Route between building M and building B with length 44.0.
Route between building C and building E with length 334.0.
Route between building C and building N with length 5960.0.
Route between building E and building D with length 576.0.
Route between building H and building F with length 118.0.
Route between building H and building I with length 2682.0.
Route between building H and building Q with length 450.0.
Route between building I and building J with length 3161.0.
Route between building I and building B with length 754.0.
Route between building J and building K with length 3701.0.
Route between building J and building N with length 2834.0.
Route between building F and building G with length 339.0.
Route between building F and building L with length 1443.0.
Route between building A and building B with length 533.0.
Route between building A and building O with length 580.0.
Route between building A and building Q with length 3155.0.
Route between building K and building L with length 729.0.
Route between building P and building D with length 1874.0.
Route between building P and building O with length 172.0.
Route between building Q and building G with length 554.0.
Prefer solutions that connect exactly 7 buildings into a single acyclic group with minimal total route length.
Also, when you send back the actual plan, please follow this little JSON layout so it's easy to check automatically:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of ""solution"" as a short list of conduit runs to lay down. Each inner pair like [u1, v1] is one route between two chosen buildings (use the building IDs from the instance). This block is just a sketch of the shape I expect you to return — not the actual wiring plan.
Please be sure to use the exact identifiers from the instance input — don't rename them and don't invent new labels.
Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 22, 'edges': [{'u': 13, 'v': 5, 'w': 1836.0}, {'u': 13, 'v': 16, 'w': 459.0}, {'u': 13, 'v': 2, 'w': 44.0}, {'u': 3, 'v': 5, 'w': 334.0}, {'u': 3, 'v': 14, 'w': 5960.0}, {'u': 5, 'v': 4, 'w': 576.0}, {'u': 8, 'v': 6, 'w': 118.0}, {'u': 8, 'v': 9, 'w': 2682.0}, {'u': 8, 'v': 17, 'w': 450.0}, {'u': 9, 'v': 10, 'w': 3161.0}, {'u': 9, 'v': 2, 'w': 754.0}, {'u': 10, 'v': 11, 'w': 3701.0}, {'u': 10, 'v': 14, 'w': 2834.0}, {'u': 6, 'v': 7, 'w': 339.0}, {'u': 6, 'v': 12, 'w': 1443.0}, {'u': 1, 'v': 2, 'w': 533.0}, {'u': 1, 'v': 15, 'w': 580.0}, {'u': 1, 'v': 17, 'w': 3155.0}, {'u': 11, 'v': 12, 'w': 729.0}, {'u': 16, 'v': 4, 'w': 1874.0}, {'u': 16, 'v': 15, 'w': 172.0}, {'u': 17, 'v': 7, 'w': 554.0}], 'k': 7, 'source_file': 'I020.stp', 'density': 0.16176470588235295}","[[5, 13], [13, 16], [2, 13], [3, 5], [1, 2], [15, 16]]",3378.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 22, 'edges': [{'u': 'M', 'v': 'E', 'w': 1836.0}, {'u': 'M', 'v': 'P', 'w': 459.0}, {'u': 'M', 'v': 'B', 'w': 44.0}, {'u': 'C', 'v': 'E', 'w': 334.0}, {'u': 'C', 'v': 'N', 'w': 5960.0}, {'u': 'E', 'v': 'D', 'w': 576.0}, {'u': 'H', 'v': 'F', 'w': 118.0}, {'u': 'H', 'v': 'I', 'w': 2682.0}, {'u': 'H', 'v': 'Q', 'w': 450.0}, {'u': 'I', 'v': 'J', 'w': 3161.0}, {'u': 'I', 'v': 'B', 'w': 754.0}, {'u': 'J', 'v': 'K', 'w': 3701.0}, {'u': 'J', 'v': 'N', 'w': 2834.0}, {'u': 'F', 'v': 'G', 'w': 339.0}, {'u': 'F', 'v': 'L', 'w': 1443.0}, {'u': 'A', 'v': 'B', 'w': 533.0}, {'u': 'A', 'v': 'O', 'w': 580.0}, {'u': 'A', 'v': 'Q', 'w': 3155.0}, {'u': 'K', 'v': 'L', 'w': 729.0}, {'u': 'P', 'v': 'D', 'w': 1874.0}, {'u': 'P', 'v': 'O', 'w': 172.0}, {'u': 'Q', 'v': 'G', 'w': 554.0}], 'density': 0.16176470588235295, 'source_file': 'I020.stp', 'k': 7}","[['E', 'M'], ['M', 'P'], ['B', 'M'], ['C', 'E'], ['A', 'B'], ['O', 'P']]",36,nl,names
KMST,KMST,"Backstage, the coordinator has to decide which exact k sets will be active and which approved walkway pieces to install so the chosen sets form one connected layout with no circular paths. The choices must be k distinct sets, only approved segments may be used, and the way to compare layouts is to sum the costs of the chosen segments — the lower that sum, the better the setup. The concrete details will be shown below.
# total_available_sets=16
# total_approved_walkways=17
# sets_to_activate=5
set_endpoint_u,set_endpoint_v,walkway_installation_cost
6,14,1033.0
15,13,1165.0
12,9,1026.0
12,5,346.0
12,11,951.0
13,5,528.0
13,4,949.0
14,4,1311.0
7,1,316930.0
3,4,549.0
3,5,961.0
3,11,347.0
10,11,1194.0
10,0,325.0
11,1,1728.0
8,9,2037.0
1,2,1232.0
If you want to give me the chosen layout, just drop it in this simple JSON shape so it's easy to check programmatically:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is just a list of the approved walkway pieces you're going to install; each inner pair [u, v] means ""connect set u to set v"". Super informal: it's just a list of edges to make the final connected, loop-free layout. The block above is only a sketch of the shape I expect, not the actual answer.
Please make sure to use the exact identifiers from the instance input — don't rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”. ""","{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 17, 'edges': [{'u': 7, 'v': 15, 'w': 1033.0}, {'u': 16, 'v': 14, 'w': 1165.0}, {'u': 13, 'v': 10, 'w': 1026.0}, {'u': 13, 'v': 6, 'w': 346.0}, {'u': 13, 'v': 12, 'w': 951.0}, {'u': 14, 'v': 6, 'w': 528.0}, {'u': 14, 'v': 5, 'w': 949.0}, {'u': 15, 'v': 5, 'w': 1311.0}, {'u': 8, 'v': 2, 'w': 316930.0}, {'u': 4, 'v': 5, 'w': 549.0}, {'u': 4, 'v': 6, 'w': 961.0}, {'u': 4, 'v': 12, 'w': 347.0}, {'u': 11, 'v': 12, 'w': 1194.0}, {'u': 11, 'v': 1, 'w': 325.0}, {'u': 12, 'v': 2, 'w': 1728.0}, {'u': 9, 'v': 10, 'w': 2037.0}, {'u': 2, 'v': 3, 'w': 1232.0}], 'k': 5, 'source_file': 'I050.stp', 'density': 0.14166666666666666}","[[6, 13], [12, 13], [6, 14], [4, 12]]",2172.0,"{'problem_type': 'KMST', 'num_nodes': 16, 'num_edges': 17, 'edges': [{'u': 6, 'v': 14, 'w': 1033.0}, {'u': 15, 'v': 13, 'w': 1165.0}, {'u': 12, 'v': 9, 'w': 1026.0}, {'u': 12, 'v': 5, 'w': 346.0}, {'u': 12, 'v': 11, 'w': 951.0}, {'u': 13, 'v': 5, 'w': 528.0}, {'u': 13, 'v': 4, 'w': 949.0}, {'u': 14, 'v': 4, 'w': 1311.0}, {'u': 7, 'v': 1, 'w': 316930.0}, {'u': 3, 'v': 4, 'w': 549.0}, {'u': 3, 'v': 5, 'w': 961.0}, {'u': 3, 'v': 11, 'w': 347.0}, {'u': 10, 'v': 11, 'w': 1194.0}, {'u': 10, 'v': 0, 'w': 325.0}, {'u': 11, 'v': 1, 'w': 1728.0}, {'u': 8, 'v': 9, 'w': 2037.0}, {'u': 1, 'v': 2, 'w': 1232.0}], 'density': 0.14166666666666666, 'source_file': 'I050.stp', 'k': 5}","[[5, 12], [11, 12], [5, 13], [3, 11]]",37,csv,0
KMST,KMST,"On a busy morning the coordinator needs to lock in exactly k supplier locations and route deliveries along certain roads so the chosen locations become a single, non-repeating network. Plans are judged by total route length — add up the distances of the roads chosen and pick the layout with the least total. There can’t be duplicate stops and every one of the k must be connected without any circular detours. The concrete map and distances are provided below.
# total_supplier_locations=17
# total_candidate_roads=20
# target_supplier_count=7
road_endpoint_u,road_endpoint_v,road_distance
13,4,619.0
13,3,1141.0
13,14,1594.0
13,11,912.0
6,3,515.0
7,14,1406.0
5,14,647.0
5,15,1136.0
16,14,853.0
16,11,1624.0
16,17,1737.0
17,15,677.0
4,2,1140.0
4,1,300.0
8,10,1807.0
8,11,1727.0
9,2,523.0
1,12,631.0
2,3,618.0
10,12,968.0
When you send back the chosen roads, please put them in a simple JSON shape like this:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Each pair [u1, v1] is just one road connecting two supplier locations in the final locked-in network — list every road you’re using so that the k locations become one connected, non-repeating layout. Think of the JSON as a quick form: ""solution"" holds a list of edges (each edge is a two-item list).
This JSON is only a sketch of the expected shape, not the actual answer — replace the placeholders with the real node identifiers from the instance input. Please use those identifiers exactly as they appear in the input — do not rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 20, 'edges': [{'u': 13, 'v': 4, 'w': 619.0}, {'u': 13, 'v': 3, 'w': 1141.0}, {'u': 13, 'v': 14, 'w': 1594.0}, {'u': 13, 'v': 11, 'w': 912.0}, {'u': 6, 'v': 3, 'w': 515.0}, {'u': 7, 'v': 14, 'w': 1406.0}, {'u': 5, 'v': 14, 'w': 647.0}, {'u': 5, 'v': 15, 'w': 1136.0}, {'u': 16, 'v': 14, 'w': 853.0}, {'u': 16, 'v': 11, 'w': 1624.0}, {'u': 16, 'v': 17, 'w': 1737.0}, {'u': 17, 'v': 15, 'w': 677.0}, {'u': 4, 'v': 2, 'w': 1140.0}, {'u': 4, 'v': 1, 'w': 300.0}, {'u': 8, 'v': 10, 'w': 1807.0}, {'u': 8, 'v': 11, 'w': 1727.0}, {'u': 9, 'v': 2, 'w': 523.0}, {'u': 1, 'v': 12, 'w': 631.0}, {'u': 2, 'v': 3, 'w': 618.0}, {'u': 10, 'v': 12, 'w': 968.0}], 'k': 7, 'source_file': 'I006.stp', 'density': 0.14705882352941177}","[[4, 13], [3, 6], [2, 4], [1, 4], [2, 9], [2, 3]]",3715.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 20, 'edges': [{'u': 13, 'v': 4, 'w': 619.0}, {'u': 13, 'v': 3, 'w': 1141.0}, {'u': 13, 'v': 14, 'w': 1594.0}, {'u': 13, 'v': 11, 'w': 912.0}, {'u': 6, 'v': 3, 'w': 515.0}, {'u': 7, 'v': 14, 'w': 1406.0}, {'u': 5, 'v': 14, 'w': 647.0}, {'u': 5, 'v': 15, 'w': 1136.0}, {'u': 16, 'v': 14, 'w': 853.0}, {'u': 16, 'v': 11, 'w': 1624.0}, {'u': 16, 'v': 17, 'w': 1737.0}, {'u': 17, 'v': 15, 'w': 677.0}, {'u': 4, 'v': 2, 'w': 1140.0}, {'u': 4, 'v': 1, 'w': 300.0}, {'u': 8, 'v': 10, 'w': 1807.0}, {'u': 8, 'v': 11, 'w': 1727.0}, {'u': 9, 'v': 2, 'w': 523.0}, {'u': 1, 'v': 12, 'w': 631.0}, {'u': 2, 'v': 3, 'w': 618.0}, {'u': 10, 'v': 12, 'w': 968.0}], 'density': 0.14705882352941177, 'source_file': 'I006.stp', 'k': 7}","[[4, 13], [3, 6], [2, 4], [1, 4], [2, 9], [2, 3]]",38,csv,1
KMST,KMST,"We’ve been handed a floor plan and told to choose exactly k hubs to link up, picking from the available fiber options so the chosen hubs form a single, loop-free network; the better layouts are simply the ones with the lowest total bill, calculated by summing the cost of the cables used. The specific instance and costs are listed below.
There are 17 hubs and 21 candidate fiber runs; we must select exactly 7 hubs and interconnect them into a single, loop-free tree.
We can install a fiber run between 7 and 8 for 390.0.
We can install a fiber run between 7 and 9 for 2646.0.
We can install a fiber run between 7 and 1 for 5292.0.
We can install a fiber run between 8 and 4 for 2944.0.
We can install a fiber run between 8 and 12 for 27562.0.
We can install a fiber run between 14 and 10 for 598.0.
We can install a fiber run between 14 and 3 for 330.0.
We can install a fiber run between 14 and 16 for 226.0.
We can install a fiber run between 1 and 0 for 773.0.
We can install a fiber run between 1 and 15 for 1839.0.
We can install a fiber run between 2 and 0 for 1164.0.
We can install a fiber run between 2 and 11 for 1205.0.
We can install a fiber run between 2 and 5 for 5980.0.
We can install a fiber run between 6 and 3 for 6821.0.
We can install a fiber run between 5 and 3 for 1507.0.
We can install a fiber run between 5 and 9 for 476.0.
We can install a fiber run between 15 and 11 for 1493.0.
We can install a fiber run between 16 and 13 for 411.0.
We can install a fiber run between 4 and 10 for 173.0.
We can install a fiber run between 4 and 13 for 470.0.
We can install a fiber run between 9 and 10 for 412.0.
We’ll use the 21 options among the 17 hubs to compute the total bill for any chosen set of 7 hubs.
When you send the chosen cabling back, just drop it into this simple JSON shape so I can read it easily:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
This is just a sketch of the shape I expect: ""solution"" is a list of the cables you picked, and each inner pair like [u1, v1] is an edge connecting hub u1 to hub v1. Think of each pair as one cable between two hubs — nothing fancy, just the list.
Please make sure to use the exact identifiers from the instance input — don't rename them or invent new labels.
- For example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 21, 'edges': [{'u': 8, 'v': 9, 'w': 390.0}, {'u': 8, 'v': 10, 'w': 2646.0}, {'u': 8, 'v': 2, 'w': 5292.0}, {'u': 9, 'v': 5, 'w': 2944.0}, {'u': 9, 'v': 13, 'w': 27562.0}, {'u': 15, 'v': 11, 'w': 598.0}, {'u': 15, 'v': 4, 'w': 330.0}, {'u': 15, 'v': 17, 'w': 226.0}, {'u': 2, 'v': 1, 'w': 773.0}, {'u': 2, 'v': 16, 'w': 1839.0}, {'u': 3, 'v': 1, 'w': 1164.0}, {'u': 3, 'v': 12, 'w': 1205.0}, {'u': 3, 'v': 6, 'w': 5980.0}, {'u': 7, 'v': 4, 'w': 6821.0}, {'u': 6, 'v': 4, 'w': 1507.0}, {'u': 6, 'v': 10, 'w': 476.0}, {'u': 16, 'v': 12, 'w': 1493.0}, {'u': 17, 'v': 14, 'w': 411.0}, {'u': 5, 'v': 11, 'w': 173.0}, {'u': 5, 'v': 14, 'w': 470.0}, {'u': 10, 'v': 11, 'w': 412.0}], 'k': 7, 'source_file': 'I019.stp', 'density': 0.15441176470588236}","[[4, 15], [15, 17], [14, 17], [5, 11], [5, 14], [10, 11]]",2022.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 21, 'edges': [{'u': 7, 'v': 8, 'w': 390.0}, {'u': 7, 'v': 9, 'w': 2646.0}, {'u': 7, 'v': 1, 'w': 5292.0}, {'u': 8, 'v': 4, 'w': 2944.0}, {'u': 8, 'v': 12, 'w': 27562.0}, {'u': 14, 'v': 10, 'w': 598.0}, {'u': 14, 'v': 3, 'w': 330.0}, {'u': 14, 'v': 16, 'w': 226.0}, {'u': 1, 'v': 0, 'w': 773.0}, {'u': 1, 'v': 15, 'w': 1839.0}, {'u': 2, 'v': 0, 'w': 1164.0}, {'u': 2, 'v': 11, 'w': 1205.0}, {'u': 2, 'v': 5, 'w': 5980.0}, {'u': 6, 'v': 3, 'w': 6821.0}, {'u': 5, 'v': 3, 'w': 1507.0}, {'u': 5, 'v': 9, 'w': 476.0}, {'u': 15, 'v': 11, 'w': 1493.0}, {'u': 16, 'v': 13, 'w': 411.0}, {'u': 4, 'v': 10, 'w': 173.0}, {'u': 4, 'v': 13, 'w': 470.0}, {'u': 9, 'v': 10, 'w': 412.0}], 'density': 0.15441176470588236, 'source_file': 'I019.stp', 'k': 7}","[[3, 14], [14, 16], [13, 16], [4, 10], [4, 13], [9, 10]]",39,markdown_table,0
KMST,KMST,"Many folks assume wiring is just plug-and-play, but this time the task was to select exactly k vendor stalls and link them with approved trunk lines so they form a single connected setup without any circular circuits — a straightforward branching feed. What makes one selection better than another is simply the total length of trunk wiring required: add up every chosen trunk segment and pick the setup with the smallest total. No extra stalls, no duplicate feeds, and no loops are allowed. The concrete stall list and trunk measurements appear below.
# total_vendor_stalls=19
# total_trunk_segments=23
# target_stalls_to_power=6
trunk_endpoint_stall_u,trunk_endpoint_stall_v,trunk_length_meters
11,12,1508.0
11,19,244.0
11,18,1936.0
18,7,837.0
18,9,1958.0
13,14,402.0
13,4,498.0
13,15,72.0
14,6,497.0
14,16,40.0
3,17,1200.0
4,5,1383.0
4,6,442.0
5,17,441.0
6,17,1383.0
1,2,1107.0
2,15,296.0
7,17,756.0
8,9,363.0
8,10,363.0
9,10,156.0
10,16,671.0
15,16,398.0
If you want to hand back the chosen wiring, just pop it into this tiny JSON shape so I can read it easily:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is a list of trunk segments to be used. Each inner pair like [u1, v1] is one approved trunk connecting stall u1 to stall v1. Think of it like filling out a simple form: each line is a single connection you picked.
This JSON is just a sketch of the shape I expect — not the actual answer. Please make sure every stall identifier you use matches the instance input exactly — no renaming, no inventing new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 23, 'edges': [{'u': 11, 'v': 12, 'w': 1508.0}, {'u': 11, 'v': 19, 'w': 244.0}, {'u': 11, 'v': 18, 'w': 1936.0}, {'u': 18, 'v': 7, 'w': 837.0}, {'u': 18, 'v': 9, 'w': 1958.0}, {'u': 13, 'v': 14, 'w': 402.0}, {'u': 13, 'v': 4, 'w': 498.0}, {'u': 13, 'v': 15, 'w': 72.0}, {'u': 14, 'v': 6, 'w': 497.0}, {'u': 14, 'v': 16, 'w': 40.0}, {'u': 3, 'v': 17, 'w': 1200.0}, {'u': 4, 'v': 5, 'w': 1383.0}, {'u': 4, 'v': 6, 'w': 442.0}, {'u': 5, 'v': 17, 'w': 441.0}, {'u': 6, 'v': 17, 'w': 1383.0}, {'u': 1, 'v': 2, 'w': 1107.0}, {'u': 2, 'v': 15, 'w': 296.0}, {'u': 7, 'v': 17, 'w': 756.0}, {'u': 8, 'v': 9, 'w': 363.0}, {'u': 8, 'v': 10, 'w': 363.0}, {'u': 9, 'v': 10, 'w': 156.0}, {'u': 10, 'v': 16, 'w': 671.0}, {'u': 15, 'v': 16, 'w': 398.0}], 'k': 6, 'source_file': 'I040.stp', 'density': 0.13450292397660818}","[[13, 15], [6, 14], [14, 16], [2, 15], [15, 16]]",1303.0,"{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 23, 'edges': [{'u': 11, 'v': 12, 'w': 1508.0}, {'u': 11, 'v': 19, 'w': 244.0}, {'u': 11, 'v': 18, 'w': 1936.0}, {'u': 18, 'v': 7, 'w': 837.0}, {'u': 18, 'v': 9, 'w': 1958.0}, {'u': 13, 'v': 14, 'w': 402.0}, {'u': 13, 'v': 4, 'w': 498.0}, {'u': 13, 'v': 15, 'w': 72.0}, {'u': 14, 'v': 6, 'w': 497.0}, {'u': 14, 'v': 16, 'w': 40.0}, {'u': 3, 'v': 17, 'w': 1200.0}, {'u': 4, 'v': 5, 'w': 1383.0}, {'u': 4, 'v': 6, 'w': 442.0}, {'u': 5, 'v': 17, 'w': 441.0}, {'u': 6, 'v': 17, 'w': 1383.0}, {'u': 1, 'v': 2, 'w': 1107.0}, {'u': 2, 'v': 15, 'w': 296.0}, {'u': 7, 'v': 17, 'w': 756.0}, {'u': 8, 'v': 9, 'w': 363.0}, {'u': 8, 'v': 10, 'w': 363.0}, {'u': 9, 'v': 10, 'w': 156.0}, {'u': 10, 'v': 16, 'w': 671.0}, {'u': 15, 'v': 16, 'w': 398.0}], 'density': 0.13450292397660818, 'source_file': 'I040.stp', 'k': 6}","[[13, 15], [6, 14], [14, 16], [2, 15], [15, 16]]",40,csv,1
KMST,KMST,"Many people on the field crew have been debating where to put a fixed number of sensor stations and which tracks to use so everything ties into one connected route without any loops. The smarter choice is the one with the lowest total distance traveled — you get that by summing the distances of the tracks that get opened. Requirements: pick exactly the given number of distinct sites, make sure they are all connected in a single route, and avoid any closed circuits or repeating sites. The particular site coordinates and distances follow below.
There are 18 available sensor sites and 21 potential tracks; you must choose exactly 7 sites so they form one connected, acyclic route with minimum total distance.
Candidate track between site 7 and site 18 with distance 1673.0.
Candidate track between site 4 and site 9 with distance 1619.0.
Candidate track between site 1 and site 2 with distance 1535.0.
Candidate track between site 1 and site 15 with distance 2616.0.
Candidate track between site 1 and site 14 with distance 1511.0.
Candidate track between site 12 and site 6 with distance 2635.0.
Candidate track between site 2 and site 11 with distance 2167.0.
Candidate track between site 2 and site 3 with distance 882.0.
Candidate track between site 2 and site 10 with distance 978.0.
Candidate track between site 5 and site 6 with distance 3230.0.
Candidate track between site 5 and site 13 with distance 224.0.
Candidate track between site 5 and site 16 with distance 1049.0.
Candidate track between site 9 and site 6 with distance 2700.0.
Candidate track between site 9 and site 8 with distance 2000.0.
Candidate track between site 11 and site 17 with distance 764.0.
Candidate track between site 11 and site 18 with distance 4891.0.
Candidate track between site 15 and site 13 with distance 1126.0.
Candidate track between site 15 and site 17 with distance 1671.0.
Candidate track between site 13 and site 14 with distance 2594.0.
Candidate track between site 18 and site 8 with distance 3841.0.
Candidate track between site 17 and site 8 with distance 336.0.
Use the listed tracks to pick the 7 sites that yield the smallest total travel distance without creating any loops.
Also, when you send back the chosen tracks, just stick to this simple JSON shape so I can read it easily:
{
""solution"": [[""u1"", ""v1""], [""u2"", ""v2""], ...]
}
Think of ""solution"" as the list of tracks we're opening; each inner pair [uX, vX] is one track between two sites (the order in the pair doesn't matter — it's just saying those two sites are connected). This block is only a sketch of the shape I need, not the final answer itself.
Please make sure to use the exact identifiers from the instance input — don't rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 21, 'edges': [{'u': 7, 'v': 18, 'w': 1673.0}, {'u': 4, 'v': 9, 'w': 1619.0}, {'u': 1, 'v': 2, 'w': 1535.0}, {'u': 1, 'v': 15, 'w': 2616.0}, {'u': 1, 'v': 14, 'w': 1511.0}, {'u': 12, 'v': 6, 'w': 2635.0}, {'u': 2, 'v': 11, 'w': 2167.0}, {'u': 2, 'v': 3, 'w': 882.0}, {'u': 2, 'v': 10, 'w': 978.0}, {'u': 5, 'v': 6, 'w': 3230.0}, {'u': 5, 'v': 13, 'w': 224.0}, {'u': 5, 'v': 16, 'w': 1049.0}, {'u': 9, 'v': 6, 'w': 2700.0}, {'u': 9, 'v': 8, 'w': 2000.0}, {'u': 11, 'v': 17, 'w': 764.0}, {'u': 11, 'v': 18, 'w': 4891.0}, {'u': 15, 'v': 13, 'w': 1126.0}, {'u': 15, 'v': 17, 'w': 1671.0}, {'u': 13, 'v': 14, 'w': 2594.0}, {'u': 18, 'v': 8, 'w': 3841.0}, {'u': 17, 'v': 8, 'w': 336.0}], 'k': 7, 'source_file': 'I002.stp', 'density': 0.13725490196078433}","[[5, 13], [5, 16], [11, 17], [13, 15], [15, 17], [8, 17]]",5170.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 21, 'edges': [{'u': 7, 'v': 18, 'w': 1673.0}, {'u': 4, 'v': 9, 'w': 1619.0}, {'u': 1, 'v': 2, 'w': 1535.0}, {'u': 1, 'v': 15, 'w': 2616.0}, {'u': 1, 'v': 14, 'w': 1511.0}, {'u': 12, 'v': 6, 'w': 2635.0}, {'u': 2, 'v': 11, 'w': 2167.0}, {'u': 2, 'v': 3, 'w': 882.0}, {'u': 2, 'v': 10, 'w': 978.0}, {'u': 5, 'v': 6, 'w': 3230.0}, {'u': 5, 'v': 13, 'w': 224.0}, {'u': 5, 'v': 16, 'w': 1049.0}, {'u': 9, 'v': 6, 'w': 2700.0}, {'u': 9, 'v': 8, 'w': 2000.0}, {'u': 11, 'v': 17, 'w': 764.0}, {'u': 11, 'v': 18, 'w': 4891.0}, {'u': 15, 'v': 13, 'w': 1126.0}, {'u': 15, 'v': 17, 'w': 1671.0}, {'u': 13, 'v': 14, 'w': 2594.0}, {'u': 18, 'v': 8, 'w': 3841.0}, {'u': 17, 'v': 8, 'w': 336.0}], 'density': 0.13725490196078433, 'source_file': 'I002.stp', 'k': 7}","[[5, 13], [5, 16], [11, 17], [13, 15], [15, 17], [8, 17]]",41,markdown_table,1
KMST,KMST,"Once the planning team fixes how many community centers will be served, the next step is picking the exact streets that will connect those centers into one continuous route without any unnecessary loops or doubles. The plan that’s preferred is the one with the lowest total distance, found by summing the lengths of the chosen roads, and the specific centers and road measurements appear below.
There are 20 total locations and 25 available road segments; the planning team must select exactly 8 centers to connect.
Segment connecting 12 and 17 has length 3683.0.
Segment connecting 12 and 4 has length 10057.0.
Segment connecting 11 and 3 has length 205164.0.
Segment connecting 11 and 6 has length 205433.0.
Segment connecting 13 and 18 has length 3175.0.
Segment connecting 13 and 14 has length 2258.0.
Segment connecting 13 and 5 has length 1923.0.
Segment connecting 19 and 5 has length 5768.0.
Segment connecting 19 and 18 has length 3568.0.
Segment connecting 19 and 17 has length 106.0.
Segment connecting 1 and 4 has length 555.0.
Segment connecting 1 and 2 has length 2295.0.
Segment connecting 2 and 6 has length 828.0.
Segment connecting 3 and 4 has length 2421.0.
Segment connecting 3 and 5 has length 2423.0.
Segment connecting 6 and 14 has length 1588.0.
Segment connecting 20 and 9 has length 2516.0.
Segment connecting 14 and 15 has length 7729.0.
Segment connecting 17 and 16 has length 9136.0.
Segment connecting 15 and 10 has length 1742.0.
Segment connecting 15 and 9 has length 799.0.
Segment connecting 15 and 18 has length 8696.0.
Segment connecting 7 and 10 has length 686.0.
Segment connecting 8 and 9 has length 2828.0.
Segment connecting 8 and 10 has length 2581.0.
These measurements let the planning team determine the tree of 8 centers with minimum total distance.
When you send back the chosen streets, a simple JSON layout like this works great — keep it relaxed and just list the edges you picked.
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of ""solution"" as the form field where you list each road to keep. Each pair like [u1, v1] is one street connecting two centers (use the exact node identifiers from the instance). This JSON is just a sketch of the shape I expect, not the actual answer—fill in the real pairs when you submit.
Please use the identifiers exactly as they appear in the instance input — no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 25, 'edges': [{'u': 12, 'v': 17, 'w': 3683.0}, {'u': 12, 'v': 4, 'w': 10057.0}, {'u': 11, 'v': 3, 'w': 205164.0}, {'u': 11, 'v': 6, 'w': 205433.0}, {'u': 13, 'v': 18, 'w': 3175.0}, {'u': 13, 'v': 14, 'w': 2258.0}, {'u': 13, 'v': 5, 'w': 1923.0}, {'u': 19, 'v': 5, 'w': 5768.0}, {'u': 19, 'v': 18, 'w': 3568.0}, {'u': 19, 'v': 17, 'w': 106.0}, {'u': 1, 'v': 4, 'w': 555.0}, {'u': 1, 'v': 2, 'w': 2295.0}, {'u': 2, 'v': 6, 'w': 828.0}, {'u': 3, 'v': 4, 'w': 2421.0}, {'u': 3, 'v': 5, 'w': 2423.0}, {'u': 6, 'v': 14, 'w': 1588.0}, {'u': 20, 'v': 9, 'w': 2516.0}, {'u': 14, 'v': 15, 'w': 7729.0}, {'u': 17, 'v': 16, 'w': 9136.0}, {'u': 15, 'v': 10, 'w': 1742.0}, {'u': 15, 'v': 9, 'w': 799.0}, {'u': 15, 'v': 18, 'w': 8696.0}, {'u': 7, 'v': 10, 'w': 686.0}, {'u': 8, 'v': 9, 'w': 2828.0}, {'u': 8, 'v': 10, 'w': 2581.0}], 'k': 8, 'source_file': 'I025.stp', 'density': 0.13157894736842105}","[[13, 14], [5, 13], [1, 4], [1, 2], [2, 6], [3, 4], [6, 14]]",11868.0,"{'problem_type': 'KMST', 'num_nodes': 20, 'num_edges': 25, 'edges': [{'u': 12, 'v': 17, 'w': 3683.0}, {'u': 12, 'v': 4, 'w': 10057.0}, {'u': 11, 'v': 3, 'w': 205164.0}, {'u': 11, 'v': 6, 'w': 205433.0}, {'u': 13, 'v': 18, 'w': 3175.0}, {'u': 13, 'v': 14, 'w': 2258.0}, {'u': 13, 'v': 5, 'w': 1923.0}, {'u': 19, 'v': 5, 'w': 5768.0}, {'u': 19, 'v': 18, 'w': 3568.0}, {'u': 19, 'v': 17, 'w': 106.0}, {'u': 1, 'v': 4, 'w': 555.0}, {'u': 1, 'v': 2, 'w': 2295.0}, {'u': 2, 'v': 6, 'w': 828.0}, {'u': 3, 'v': 4, 'w': 2421.0}, {'u': 3, 'v': 5, 'w': 2423.0}, {'u': 6, 'v': 14, 'w': 1588.0}, {'u': 20, 'v': 9, 'w': 2516.0}, {'u': 14, 'v': 15, 'w': 7729.0}, {'u': 17, 'v': 16, 'w': 9136.0}, {'u': 15, 'v': 10, 'w': 1742.0}, {'u': 15, 'v': 9, 'w': 799.0}, {'u': 15, 'v': 18, 'w': 8696.0}, {'u': 7, 'v': 10, 'w': 686.0}, {'u': 8, 'v': 9, 'w': 2828.0}, {'u': 8, 'v': 10, 'w': 2581.0}], 'density': 0.13157894736842105, 'source_file': 'I025.stp', 'k': 8}","[[13, 14], [5, 13], [1, 4], [1, 2], [2, 6], [3, 4], [6, 14]]",42,nl,1
KMST,KMST,"Someone on the logistics floor has to pick a handful of hubs and schedule one-way or two-way transfer lanes so those hubs form a single, loop-free network. The choice is about which hubs make the cut and which direct lanes to open; the way to tell which choice is better is to add up all the lane distances — the smaller that total, the better the plan. Practical ground rules: include exactly the required number of hubs, ensure each chosen hub can reach the others through the lanes, and avoid creating circular routes or repeating hubs. The concrete details are shown below.
From 18 hubs and 22 candidate lanes, they must choose exactly 5 hubs and open lanes so those hubs form a single, loop-free connected network.
Candidate lane between hub 9 and hub 7 with distance 451.0.
Candidate lane between hub 9 and hub 16 with distance 2048.0.
Candidate lane between hub 9 and hub 10 with distance 747.0.
Candidate lane between hub 10 and hub 18 with distance 434.0.
Candidate lane between hub 10 and hub 8 with distance 1335.0.
Candidate lane between hub 6 and hub 11 with distance 111.0.
Candidate lane between hub 11 and hub 8 with distance 469.0.
Candidate lane between hub 11 and hub 2 with distance 681.0.
Candidate lane between hub 14 and hub 12 with distance 1916.0.
Candidate lane between hub 14 and hub 16 with distance 355.0.
Candidate lane between hub 14 and hub 17 with distance 1613.0.
Candidate lane between hub 15 and hub 16 with distance 336.0.
Candidate lane between hub 15 and hub 7 with distance 2181.0.
Candidate lane between hub 12 and hub 3 with distance 42.0.
Candidate lane between hub 12 and hub 18 with distance 33.0.
Candidate lane between hub 18 and hub 2 with distance 607.0.
Candidate lane between hub 13 and hub 3 with distance 745.0.
Candidate lane between hub 1 and hub 2 with distance 295.0.
Candidate lane between hub 1 and hub 3 with distance 777.0.
Candidate lane between hub 1 and hub 4 with distance 756.0.
Candidate lane between hub 5 and hub 8 with distance 58.0.
Candidate lane between hub 5 and hub 7 with distance 1191.0.
They must include exactly 5 hubs, ensure every chosen hub can reach the others, avoid cycles, and minimize the sum of lane distances.
If you want to send the plan back, just pop it into a tiny JSON snippet like this — I find it easiest to think of it as ""a list of lanes, each lane is a pair of hubs.""
{
""solution"": [[u1, v1], [u2, v2], ...]
}
In plain terms: ""solution"" is the list, and each [u, v] pair is a lane from hub u to hub v. Think of it like filling out a simple form: one line per lane, with the two hubs that the lane connects. This JSON is just a sketch of the shape I expect — you'll replace the placeholders with the actual hubs from the instance.
Please use the identifiers exactly as they appear in the instance input — do not rename them or invent new labels.
Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 22, 'edges': [{'u': 9, 'v': 7, 'w': 451.0}, {'u': 9, 'v': 16, 'w': 2048.0}, {'u': 9, 'v': 10, 'w': 747.0}, {'u': 10, 'v': 18, 'w': 434.0}, {'u': 10, 'v': 8, 'w': 1335.0}, {'u': 6, 'v': 11, 'w': 111.0}, {'u': 11, 'v': 8, 'w': 469.0}, {'u': 11, 'v': 2, 'w': 681.0}, {'u': 14, 'v': 12, 'w': 1916.0}, {'u': 14, 'v': 16, 'w': 355.0}, {'u': 14, 'v': 17, 'w': 1613.0}, {'u': 15, 'v': 16, 'w': 336.0}, {'u': 15, 'v': 7, 'w': 2181.0}, {'u': 12, 'v': 3, 'w': 42.0}, {'u': 12, 'v': 18, 'w': 33.0}, {'u': 18, 'v': 2, 'w': 607.0}, {'u': 13, 'v': 3, 'w': 745.0}, {'u': 1, 'v': 2, 'w': 295.0}, {'u': 1, 'v': 3, 'w': 777.0}, {'u': 1, 'v': 4, 'w': 756.0}, {'u': 5, 'v': 8, 'w': 58.0}, {'u': 5, 'v': 7, 'w': 1191.0}], 'k': 5, 'source_file': 'I060.stp', 'density': 0.1437908496732026}","[[3, 12], [12, 18], [2, 18], [1, 2]]",977.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 22, 'edges': [{'u': 9, 'v': 7, 'w': 451.0}, {'u': 9, 'v': 16, 'w': 2048.0}, {'u': 9, 'v': 10, 'w': 747.0}, {'u': 10, 'v': 18, 'w': 434.0}, {'u': 10, 'v': 8, 'w': 1335.0}, {'u': 6, 'v': 11, 'w': 111.0}, {'u': 11, 'v': 8, 'w': 469.0}, {'u': 11, 'v': 2, 'w': 681.0}, {'u': 14, 'v': 12, 'w': 1916.0}, {'u': 14, 'v': 16, 'w': 355.0}, {'u': 14, 'v': 17, 'w': 1613.0}, {'u': 15, 'v': 16, 'w': 336.0}, {'u': 15, 'v': 7, 'w': 2181.0}, {'u': 12, 'v': 3, 'w': 42.0}, {'u': 12, 'v': 18, 'w': 33.0}, {'u': 18, 'v': 2, 'w': 607.0}, {'u': 13, 'v': 3, 'w': 745.0}, {'u': 1, 'v': 2, 'w': 295.0}, {'u': 1, 'v': 3, 'w': 777.0}, {'u': 1, 'v': 4, 'w': 756.0}, {'u': 5, 'v': 8, 'w': 58.0}, {'u': 5, 'v': 7, 'w': 1191.0}], 'density': 0.1437908496732026, 'source_file': 'I060.stp', 'k': 5}","[[3, 12], [12, 18], [2, 18], [1, 2]]",43,markdown_table,1
KMST,KMST,"Recently the crew got instructions to wire a precise number of lamps along a neighborhood and make them one cohesive circuit. The plan must pick exactly that many different lights, join them using the available conduit paths so they’re all connected, and avoid creating any closed loops; the cost of a plan is simply the sum of the conduit run costs used, and the aim is to keep that sum as low as possible. No duplicates or missing lights are allowed — each selected fixture is part of the single, loop-free network. The specific layout and numbers are shown below.
{
""total_fixtures"": 17,
""available_conduit_runs"": 21,
""edges"": [
{
""fixture_endpoint_a"": ""L"",
""fixture_endpoint_b"": ""B"",
""conduit_cost"": 168.0
},
{
""fixture_endpoint_a"": ""L"",
""fixture_endpoint_b"": ""F"",
""conduit_cost"": 729.0
},
{
""fixture_endpoint_a"": ""L"",
""fixture_endpoint_b"": ""G"",
""conduit_cost"": 163.0
},
{
""fixture_endpoint_a"": ""M"",
""fixture_endpoint_b"": ""O"",
""conduit_cost"": 2337.0
},
{
""fixture_endpoint_a"": ""C"",
""fixture_endpoint_b"": ""J"",
""conduit_cost"": 221.0
},
{
""fixture_endpoint_a"": ""C"",
""fixture_endpoint_b"": ""E"",
""conduit_cost"": 547.0
},
{
""fixture_endpoint_a"": ""D"",
""fixture_endpoint_b"": ""J"",
""conduit_cost"": 1055.0
},
{
""fixture_endpoint_a"": ""E"",
""fixture_endpoint_b"": ""K"",
""conduit_cost"": 274.0
},
{
""fixture_endpoint_a"": ""A"",
""fixture_endpoint_b"": ""B"",
""conduit_cost"": 2351.0
},
{
""fixture_endpoint_a"": ""A"",
""fixture_endpoint_b"": ""F"",
""conduit_cost"": 1684.0
},
{
""fixture_endpoint_a"": ""A"",
""fixture_endpoint_b"": ""N"",
""conduit_cost"": 376.0
},
{
""fixture_endpoint_a"": ""A"",
""fixture_endpoint_b"": ""O"",
""conduit_cost"": 425.0
},
{
""fixture_endpoint_a"": ""A"",
""fixture_endpoint_b"": ""P"",
""conduit_cost"": 3326.0
},
{
""fixture_endpoint_a"": ""B"",
""fixture_endpoint_b"": ""Q"",
""conduit_cost"": 4965.0
},
{
""fixture_endpoint_a"": ""F"",
""fixture_endpoint_b"": ""G"",
""conduit_cost"": 669.0
},
{
""fixture_endpoint_a"": ""F"",
""fixture_endpoint_b"": ""H"",
""conduit_cost"": 1415.0
},
{
""fixture_endpoint_a"": ""G"",
""fixture_endpoint_b"": ""I"",
""conduit_cost"": 1873.0
},
{
""fixture_endpoint_a"": ""H"",
""fixture_endpoint_b"": ""I"",
""conduit_cost"": 3292.0
},
{
""fixture_endpoint_a"": ""H"",
""fixture_endpoint_b"": ""N"",
""conduit_cost"": 128.0
},
{
""fixture_endpoint_a"": ""Q"",
""fixture_endpoint_b"": ""J"",
""conduit_cost"": 2601.0
},
{
""fixture_endpoint_a"": ""Q"",
""fixture_endpoint_b"": ""K"",
""conduit_cost"": 1780.0
}
],
""target_fixtures"": 5
}
Oh, and when you send back your wiring plan, please stick to this little JSON layout so it’s easy to read and check:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is just the list of conduit runs you picked — each inner pair [u1, v1] is one connection joining two lamps. Think of it like filling out a form: give a list of the edges you want in the final loop-free circuit. This JSON is only a sketch of the shape I need, not the actual answer.
Please make sure you use the exact identifiers from the instance input — don’t rename them or invent new ones.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 21, 'edges': [{'u': 12, 'v': 2, 'w': 168.0}, {'u': 12, 'v': 6, 'w': 729.0}, {'u': 12, 'v': 7, 'w': 163.0}, {'u': 13, 'v': 15, 'w': 2337.0}, {'u': 3, 'v': 10, 'w': 221.0}, {'u': 3, 'v': 5, 'w': 547.0}, {'u': 4, 'v': 10, 'w': 1055.0}, {'u': 5, 'v': 11, 'w': 274.0}, {'u': 1, 'v': 2, 'w': 2351.0}, {'u': 1, 'v': 6, 'w': 1684.0}, {'u': 1, 'v': 14, 'w': 376.0}, {'u': 1, 'v': 15, 'w': 425.0}, {'u': 1, 'v': 16, 'w': 3326.0}, {'u': 2, 'v': 17, 'w': 4965.0}, {'u': 6, 'v': 7, 'w': 669.0}, {'u': 6, 'v': 8, 'w': 1415.0}, {'u': 7, 'v': 9, 'w': 1873.0}, {'u': 8, 'v': 9, 'w': 3292.0}, {'u': 8, 'v': 14, 'w': 128.0}, {'u': 17, 'v': 10, 'w': 2601.0}, {'u': 17, 'v': 11, 'w': 1780.0}], 'k': 5, 'source_file': 'I031.stp', 'density': 0.15441176470588236}","[[3, 10], [3, 5], [4, 10], [5, 11]]",2097.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 21, 'edges': [{'u': 'L', 'v': 'B', 'w': 168.0}, {'u': 'L', 'v': 'F', 'w': 729.0}, {'u': 'L', 'v': 'G', 'w': 163.0}, {'u': 'M', 'v': 'O', 'w': 2337.0}, {'u': 'C', 'v': 'J', 'w': 221.0}, {'u': 'C', 'v': 'E', 'w': 547.0}, {'u': 'D', 'v': 'J', 'w': 1055.0}, {'u': 'E', 'v': 'K', 'w': 274.0}, {'u': 'A', 'v': 'B', 'w': 2351.0}, {'u': 'A', 'v': 'F', 'w': 1684.0}, {'u': 'A', 'v': 'N', 'w': 376.0}, {'u': 'A', 'v': 'O', 'w': 425.0}, {'u': 'A', 'v': 'P', 'w': 3326.0}, {'u': 'B', 'v': 'Q', 'w': 4965.0}, {'u': 'F', 'v': 'G', 'w': 669.0}, {'u': 'F', 'v': 'H', 'w': 1415.0}, {'u': 'G', 'v': 'I', 'w': 1873.0}, {'u': 'H', 'v': 'I', 'w': 3292.0}, {'u': 'H', 'v': 'N', 'w': 128.0}, {'u': 'Q', 'v': 'J', 'w': 2601.0}, {'u': 'Q', 'v': 'K', 'w': 1780.0}], 'density': 0.15441176470588236, 'source_file': 'I031.stp', 'k': 5}","[['C', 'J'], ['C', 'E'], ['D', 'J'], ['E', 'K']]",44,json,names
KMST,KMST,"Recently the municipality asked for a compact pump layout: settle on a target number of pump stations and select the pipe segments that join them into one connected, cycle-free structure. The plan that uses the smallest total pipe length wins — the total is just the sum of the lengths of the pipes chosen. Practically, the design must include exactly that many stations, keep every chosen station connected, avoid any closed loops, and not repeat segments. Concrete instance information appears below.
Instance: 18 candidate sites, 21 candidate pipes, required 7 pump stations.
Candidate pipe between site E and site K, length 721.0.
Candidate pipe between site H and site I, length 339.0.
Candidate pipe between site H and site G, length 194.0.
Candidate pipe between site H and site A, length 13967.0.
Candidate pipe between site F and site G, length 1072.0.
Candidate pipe between site F and site O, length 633.0.
Candidate pipe between site F and site B, length 2196.0.
Candidate pipe between site I and site M, length 229.0.
Candidate pipe between site I and site A, length 13807.0.
Candidate pipe between site R and site Q, length 9358.0.
Candidate pipe between site N and site K, length 149.0.
Candidate pipe between site N and site D, length 7404.0.
Candidate pipe between site N and site L, length 1091.0.
Candidate pipe between site O and site D, length 6460.0.
Candidate pipe between site O and site M, length 1099.0.
Candidate pipe between site D and site C, length 1166.0.
Candidate pipe between site C and site M, length 6544.0.
Candidate pipe between site C and site Q, length 5629.0.
Candidate pipe between site Q and site L, length 1666.0.
Candidate pipe between site P and site K, length 3892.0.
Candidate pipe between site J and site L, length 388.0.
Select segments that connect the 7 chosen sites into one cycle-free network while minimizing total pipe length.
When you’re ready to hand in the chosen pipe segments, please use a simple JSON shape so it’s easy to read and validate. Here’s the little sketch I’m expecting:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of this as a form: the ""solution"" field is a list of the pipe segments you picked, and each [u1, v1] pair is one segment connecting two station identifiers. Super casual — just a list of the edges that make up the final connected, loop-free layout. This is just the shape I want you to follow, not the actual answer.
Please make sure every identifier you use matches the instance input exactly — don’t rename stations or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 21, 'edges': [{'u': 5, 'v': 11, 'w': 721.0}, {'u': 8, 'v': 9, 'w': 339.0}, {'u': 8, 'v': 7, 'w': 194.0}, {'u': 8, 'v': 1, 'w': 13967.0}, {'u': 6, 'v': 7, 'w': 1072.0}, {'u': 6, 'v': 15, 'w': 633.0}, {'u': 6, 'v': 2, 'w': 2196.0}, {'u': 9, 'v': 13, 'w': 229.0}, {'u': 9, 'v': 1, 'w': 13807.0}, {'u': 18, 'v': 17, 'w': 9358.0}, {'u': 14, 'v': 11, 'w': 149.0}, {'u': 14, 'v': 4, 'w': 7404.0}, {'u': 14, 'v': 12, 'w': 1091.0}, {'u': 15, 'v': 4, 'w': 6460.0}, {'u': 15, 'v': 13, 'w': 1099.0}, {'u': 4, 'v': 3, 'w': 1166.0}, {'u': 3, 'v': 13, 'w': 6544.0}, {'u': 3, 'v': 17, 'w': 5629.0}, {'u': 17, 'v': 12, 'w': 1666.0}, {'u': 16, 'v': 11, 'w': 3892.0}, {'u': 10, 'v': 12, 'w': 388.0}], 'k': 7, 'source_file': 'I080.stp', 'density': 0.13725490196078433}","[[8, 9], [7, 8], [6, 7], [6, 15], [2, 6], [9, 13]]",4663.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 21, 'edges': [{'u': 'E', 'v': 'K', 'w': 721.0}, {'u': 'H', 'v': 'I', 'w': 339.0}, {'u': 'H', 'v': 'G', 'w': 194.0}, {'u': 'H', 'v': 'A', 'w': 13967.0}, {'u': 'F', 'v': 'G', 'w': 1072.0}, {'u': 'F', 'v': 'O', 'w': 633.0}, {'u': 'F', 'v': 'B', 'w': 2196.0}, {'u': 'I', 'v': 'M', 'w': 229.0}, {'u': 'I', 'v': 'A', 'w': 13807.0}, {'u': 'R', 'v': 'Q', 'w': 9358.0}, {'u': 'N', 'v': 'K', 'w': 149.0}, {'u': 'N', 'v': 'D', 'w': 7404.0}, {'u': 'N', 'v': 'L', 'w': 1091.0}, {'u': 'O', 'v': 'D', 'w': 6460.0}, {'u': 'O', 'v': 'M', 'w': 1099.0}, {'u': 'D', 'v': 'C', 'w': 1166.0}, {'u': 'C', 'v': 'M', 'w': 6544.0}, {'u': 'C', 'v': 'Q', 'w': 5629.0}, {'u': 'Q', 'v': 'L', 'w': 1666.0}, {'u': 'P', 'v': 'K', 'w': 3892.0}, {'u': 'J', 'v': 'L', 'w': 388.0}], 'density': 0.13725490196078433, 'source_file': 'I080.stp', 'k': 7}","[['H', 'I'], ['G', 'H'], ['F', 'G'], ['F', 'O'], ['B', 'F'], ['I', 'M']]",45,nl,names
KMST,KMST,"I’m planning a shoot and need to pick a fixed number of locations for different scenes, then lay down service roads so every chosen site can be driven between without any breaks. The choice is which exact spots to include and which roads to build so that all the picked sites are connected in one continuous layout with no loops or redundant backtracking. A better choice is the one that uses the fewest road miles overall — count the length of each service road you include and add them up, and the sum should be as small as possible. The rules are strict: pick exactly the given number of sites, don’t duplicate sites, make sure every chosen site is reachable from any other via the roads, and avoid creating circular routes. The concrete details are shown below.
There are 18 candidate filming sites, 23 potential direct roads, and I must pick exactly 9 sites.
A possible service road between site D and site Q is 206.0 miles long.
A possible service road between site D and site O is 553.0 miles long.
A possible service road between site E and site K is 1172.0 miles long.
A possible service road between site E and site H is 1419.0 miles long.
A possible service road between site J and site I is 627.0 miles long.
A possible service road between site J and site B is 1508.0 miles long.
A possible service road between site J and site O is 1435.0 miles long.
A possible service road between site F and site A is 257857.0 miles long.
A possible service road between site F and site N is 258973.0 miles long.
A possible service road between site A and site B is 147.0 miles long.
A possible service road between site A and site M is 309.0 miles long.
A possible service road between site L and site M is 215.0 miles long.
A possible service road between site L and site P is 130.0 miles long.
A possible service road between site L and site G is 1700.0 miles long.
A possible service road between site B and site R is 309.0 miles long.
A possible service road between site K and site G is 2331.0 miles long.
A possible service road between site K and site C is 399.0 miles long.
A possible service road between site N and site O is 277.0 miles long.
A possible service road between site N and site Q is 510.0 miles long.
A possible service road between site M and site R is 136.0 miles long.
A possible service road between site P and site R is 210.0 miles long.
A possible service road between site Q and site G is 1083.0 miles long.
A possible service road between site G and site H is 896.0 miles long.
I'll use these entries to pick the exact 9 sites and build the minimum-mileage layout that connects them without loops.
Also, a quick format note — when you send back the roads you pick, it'd be great if you put them in a little JSON snippet like this:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
This just means ""solution"" is the list of roads you'll build. Each pair like [u1, v1] is a road connecting the two chosen sites. Think of it like filling out a short form: one line per road, listing the two endpoints. It's only a sketch of the shape I want, not the actual answer you should compute.
Please use the identifiers exactly as they appear in the instance input — no renaming and no new labels.
Valid identifiers look like plain numbers such as ""1"" or ""23"", single capital letters like ""A"" or ""B"", or a capital letter followed by digits like ""A1"" or ""X7"".","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 23, 'edges': [{'u': 4, 'v': 17, 'w': 206.0}, {'u': 4, 'v': 15, 'w': 553.0}, {'u': 5, 'v': 11, 'w': 1172.0}, {'u': 5, 'v': 8, 'w': 1419.0}, {'u': 10, 'v': 9, 'w': 627.0}, {'u': 10, 'v': 2, 'w': 1508.0}, {'u': 10, 'v': 15, 'w': 1435.0}, {'u': 6, 'v': 1, 'w': 257857.0}, {'u': 6, 'v': 14, 'w': 258973.0}, {'u': 1, 'v': 2, 'w': 147.0}, {'u': 1, 'v': 13, 'w': 309.0}, {'u': 12, 'v': 13, 'w': 215.0}, {'u': 12, 'v': 16, 'w': 130.0}, {'u': 12, 'v': 7, 'w': 1700.0}, {'u': 2, 'v': 18, 'w': 309.0}, {'u': 11, 'v': 7, 'w': 2331.0}, {'u': 11, 'v': 3, 'w': 399.0}, {'u': 14, 'v': 15, 'w': 277.0}, {'u': 14, 'v': 17, 'w': 510.0}, {'u': 13, 'v': 18, 'w': 136.0}, {'u': 16, 'v': 18, 'w': 210.0}, {'u': 17, 'v': 7, 'w': 1083.0}, {'u': 7, 'v': 8, 'w': 896.0}], 'k': 9, 'source_file': 'I032.stp', 'density': 0.1503267973856209}","[[4, 17], [1, 2], [1, 13], [12, 16], [7, 12], [13, 18], [16, 18], [7, 17]]",3921.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 23, 'edges': [{'u': 'D', 'v': 'Q', 'w': 206.0}, {'u': 'D', 'v': 'O', 'w': 553.0}, {'u': 'E', 'v': 'K', 'w': 1172.0}, {'u': 'E', 'v': 'H', 'w': 1419.0}, {'u': 'J', 'v': 'I', 'w': 627.0}, {'u': 'J', 'v': 'B', 'w': 1508.0}, {'u': 'J', 'v': 'O', 'w': 1435.0}, {'u': 'F', 'v': 'A', 'w': 257857.0}, {'u': 'F', 'v': 'N', 'w': 258973.0}, {'u': 'A', 'v': 'B', 'w': 147.0}, {'u': 'A', 'v': 'M', 'w': 309.0}, {'u': 'L', 'v': 'M', 'w': 215.0}, {'u': 'L', 'v': 'P', 'w': 130.0}, {'u': 'L', 'v': 'G', 'w': 1700.0}, {'u': 'B', 'v': 'R', 'w': 309.0}, {'u': 'K', 'v': 'G', 'w': 2331.0}, {'u': 'K', 'v': 'C', 'w': 399.0}, {'u': 'N', 'v': 'O', 'w': 277.0}, {'u': 'N', 'v': 'Q', 'w': 510.0}, {'u': 'M', 'v': 'R', 'w': 136.0}, {'u': 'P', 'v': 'R', 'w': 210.0}, {'u': 'Q', 'v': 'G', 'w': 1083.0}, {'u': 'G', 'v': 'H', 'w': 896.0}], 'density': 0.1503267973856209, 'source_file': 'I032.stp', 'k': 9}","[['D', 'Q'], ['A', 'B'], ['A', 'M'], ['L', 'P'], ['G', 'L'], ['M', 'R'], ['P', 'R'], ['G', 'Q']]",46,nl,names
KMST,KMST,"Recently the cable company got a brief to wire up a handful of junctions: they must choose an exact number of those junctions and link them with coax so the chosen set is all connected together, with no closed loops. Plans are judged by how little cable they require — simply total the lengths of all the links you’d place. The practical constraints are straightforward: exactly that many junctions, each included only once, everything connected, and no looped paths. The specific data is given below.
There are 17 junctions and 19 possible links; they must choose exactly 5 junctions to wire into a single loop-free network.
Potential coax link joining junction 4 and junction 3, length 459.0 meters.
Potential coax link joining junction 4 and junction 15, length 926.0 meters.
Potential coax link joining junction 4 and junction 16, length 577.0 meters.
Potential coax link joining junction 9 and junction 10, length 3722.0 meters.
Potential coax link joining junction 9 and junction 2, length 157.0 meters.
Potential coax link joining junction 9 and junction 8, length 1357.0 meters.
Potential coax link joining junction 5 and junction 3, length 334.0 meters.
Potential coax link joining junction 0 and junction 14, length 155.0 meters.
Potential coax link joining junction 0 and junction 12, length 1276.0 meters.
Potential coax link joining junction 6 and junction 7, length 1015.0 meters.
Potential coax link joining junction 6 and junction 8, length 993.0 meters.
Potential coax link joining junction 6 and junction 16, length 1814.0 meters.
Potential coax link joining junction 16 and junction 12, length 3851.0 meters.
Potential coax link joining junction 12 and junction 7, length 1458.0 meters.
Potential coax link joining junction 13 and junction 7, length 1410.0 meters.
Potential coax link joining junction 13 and junction 14, length 1312.0 meters.
Potential coax link joining junction 13 and junction 11, length 638.0 meters.
Potential coax link joining junction 1 and junction 11, length 38.0 meters.
Potential coax link joining junction 8 and junction 3, length 1826.0 meters.
Use these entries to minimize total cable when forming the required 5-junction tree.
Oh, and when you send back the plan, please follow this little JSON layout so I can read it automatically:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Think of that as a simple form: ""solution"" is the list of coax runs you propose, and each [u, v] pair is a single cable connecting junction u to junction v. It's just the shape I need — a sketch of the format, not your final answer.
Also, use the identifiers exactly as they appear in the instance input — no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 19, 'edges': [{'u': 5, 'v': 4, 'w': 459.0}, {'u': 5, 'v': 16, 'w': 926.0}, {'u': 5, 'v': 17, 'w': 577.0}, {'u': 10, 'v': 11, 'w': 3722.0}, {'u': 10, 'v': 3, 'w': 157.0}, {'u': 10, 'v': 9, 'w': 1357.0}, {'u': 6, 'v': 4, 'w': 334.0}, {'u': 1, 'v': 15, 'w': 155.0}, {'u': 1, 'v': 13, 'w': 1276.0}, {'u': 7, 'v': 8, 'w': 1015.0}, {'u': 7, 'v': 9, 'w': 993.0}, {'u': 7, 'v': 17, 'w': 1814.0}, {'u': 17, 'v': 13, 'w': 3851.0}, {'u': 13, 'v': 8, 'w': 1458.0}, {'u': 14, 'v': 8, 'w': 1410.0}, {'u': 14, 'v': 15, 'w': 1312.0}, {'u': 14, 'v': 12, 'w': 638.0}, {'u': 2, 'v': 12, 'w': 38.0}, {'u': 9, 'v': 4, 'w': 1826.0}], 'k': 5, 'source_file': 'I027.stp', 'density': 0.13970588235294118}","[[1, 15], [14, 15], [12, 14], [2, 12]]",2143.0,"{'problem_type': 'KMST', 'num_nodes': 17, 'num_edges': 19, 'edges': [{'u': 4, 'v': 3, 'w': 459.0}, {'u': 4, 'v': 15, 'w': 926.0}, {'u': 4, 'v': 16, 'w': 577.0}, {'u': 9, 'v': 10, 'w': 3722.0}, {'u': 9, 'v': 2, 'w': 157.0}, {'u': 9, 'v': 8, 'w': 1357.0}, {'u': 5, 'v': 3, 'w': 334.0}, {'u': 0, 'v': 14, 'w': 155.0}, {'u': 0, 'v': 12, 'w': 1276.0}, {'u': 6, 'v': 7, 'w': 1015.0}, {'u': 6, 'v': 8, 'w': 993.0}, {'u': 6, 'v': 16, 'w': 1814.0}, {'u': 16, 'v': 12, 'w': 3851.0}, {'u': 12, 'v': 7, 'w': 1458.0}, {'u': 13, 'v': 7, 'w': 1410.0}, {'u': 13, 'v': 14, 'w': 1312.0}, {'u': 13, 'v': 11, 'w': 638.0}, {'u': 1, 'v': 11, 'w': 38.0}, {'u': 8, 'v': 3, 'w': 1826.0}], 'density': 0.13970588235294118, 'source_file': 'I027.stp', 'k': 5}","[[0, 14], [13, 14], [11, 13], [1, 11]]",47,nl,0
KMST,KMST,"I run the watering schedule at our community garden, and I need to pick a specific number of raised beds to hook up to the shared water line. The job is to decide which beds to include and which hoses to lay so all those chosen beds are joined together in a single network with no closed loops, and the plan is better the less hose it uses — you figure that by adding up the lengths of the hoses you’d need. The exact layout and hose lengths for the current case are shown below.
There are 18 raised beds and 21 candidate hose segments; I must connect exactly 9 beds into a single loop-free watering network.
Between bed 7 and bed 13 I can lay a hose of length 2502.0.
Between bed 7 and bed 9 I can lay a hose of length 2527.0.
Between bed 7 and bed 2 I can lay a hose of length 8587.0.
Between bed 6 and bed 18 I can lay a hose of length 1926.0.
Between bed 11 and bed 10 I can lay a hose of length 1229.0.
Between bed 11 and bed 12 I can lay a hose of length 12930.0.
Between bed 5 and bed 3 I can lay a hose of length 1417.0.
Between bed 5 and bed 8 I can lay a hose of length 348.0.
Between bed 5 and bed 4 I can lay a hose of length 615.0.
Between bed 14 and bed 15 I can lay a hose of length 2915.0.
Between bed 15 and bed 16 I can lay a hose of length 344.0.
Between bed 15 and bed 8 I can lay a hose of length 2044.0.
Between bed 15 and bed 18 I can lay a hose of length 1353.0.
Between bed 16 and bed 1 I can lay a hose of length 1806.0.
Between bed 16 and bed 13 I can lay a hose of length 1810.0.
Between bed 17 and bed 10 I can lay a hose of length 5275.0.
Between bed 18 and bed 12 I can lay a hose of length 6198.0.
Between bed 8 and bed 13 I can lay a hose of length 344.0.
Between bed 9 and bed 4 I can lay a hose of length 754.0.
Between bed 9 and bed 10 I can lay a hose of length 16109.0.
Between bed 3 and bed 4 I can lay a hose of length 1486.0.
I'll choose the 9 beds and the connecting hoses that minimize the total hose length.
Also, when you send the plan back, please use this simple JSON layout so it's easy to read and feed into the garden map:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is a list of hose runs; each inner pair [u, v] means run a hose between bed u and bed v. It's just a quick form of saying which beds get connected to which — nothing fancy, just a list of connections.
This JSON is only a sketch of the expected shape, not the actual answer.
Please make sure all identifiers in your final answer match exactly what's in the instance input — no renaming and no new labels. For example: Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 21, 'edges': [{'u': 7, 'v': 13, 'w': 2502.0}, {'u': 7, 'v': 9, 'w': 2527.0}, {'u': 7, 'v': 2, 'w': 8587.0}, {'u': 6, 'v': 18, 'w': 1926.0}, {'u': 11, 'v': 10, 'w': 1229.0}, {'u': 11, 'v': 12, 'w': 12930.0}, {'u': 5, 'v': 3, 'w': 1417.0}, {'u': 5, 'v': 8, 'w': 348.0}, {'u': 5, 'v': 4, 'w': 615.0}, {'u': 14, 'v': 15, 'w': 2915.0}, {'u': 15, 'v': 16, 'w': 344.0}, {'u': 15, 'v': 8, 'w': 2044.0}, {'u': 15, 'v': 18, 'w': 1353.0}, {'u': 16, 'v': 1, 'w': 1806.0}, {'u': 16, 'v': 13, 'w': 1810.0}, {'u': 17, 'v': 10, 'w': 5275.0}, {'u': 18, 'v': 12, 'w': 6198.0}, {'u': 8, 'v': 13, 'w': 344.0}, {'u': 9, 'v': 4, 'w': 754.0}, {'u': 9, 'v': 10, 'w': 16109.0}, {'u': 3, 'v': 4, 'w': 1486.0}], 'k': 9, 'source_file': 'I035.stp', 'density': 0.13725490196078433}","[[3, 5], [5, 8], [4, 5], [15, 16], [15, 18], [13, 16], [8, 13], [4, 9]]",6985.0,"{'problem_type': 'KMST', 'num_nodes': 18, 'num_edges': 21, 'edges': [{'u': 7, 'v': 13, 'w': 2502.0}, {'u': 7, 'v': 9, 'w': 2527.0}, {'u': 7, 'v': 2, 'w': 8587.0}, {'u': 6, 'v': 18, 'w': 1926.0}, {'u': 11, 'v': 10, 'w': 1229.0}, {'u': 11, 'v': 12, 'w': 12930.0}, {'u': 5, 'v': 3, 'w': 1417.0}, {'u': 5, 'v': 8, 'w': 348.0}, {'u': 5, 'v': 4, 'w': 615.0}, {'u': 14, 'v': 15, 'w': 2915.0}, {'u': 15, 'v': 16, 'w': 344.0}, {'u': 15, 'v': 8, 'w': 2044.0}, {'u': 15, 'v': 18, 'w': 1353.0}, {'u': 16, 'v': 1, 'w': 1806.0}, {'u': 16, 'v': 13, 'w': 1810.0}, {'u': 17, 'v': 10, 'w': 5275.0}, {'u': 18, 'v': 12, 'w': 6198.0}, {'u': 8, 'v': 13, 'w': 344.0}, {'u': 9, 'v': 4, 'w': 754.0}, {'u': 9, 'v': 10, 'w': 16109.0}, {'u': 3, 'v': 4, 'w': 1486.0}], 'density': 0.13725490196078433, 'source_file': 'I035.stp', 'k': 9}","[[3, 5], [5, 8], [4, 5], [15, 16], [15, 18], [13, 16], [8, 13], [4, 9]]",48,nl,1
KMST,KMST,"Heading into the next round of surveys, the responsibility is to select a specified count of plots and pick links that tie those plots into a single connected, loopless measurement structure. The plan that wins is the one with the smallest combined link distance — just total the lengths of all the links chosen. Every selected plot must be included once, everything must be connected together, and there can’t be any loops or repeated plot selections. The concrete details for the instance are shown below.
# total_plots=19
# available_links_count=23
# plots_to_select=10
plot_u,plot_v,link_distance
15,12,956.0
2,8,205.0
2,16,2196.0
3,4,545.0
3,5,592.0
4,8,38.0
4,6,473.0
5,18,492.0
5,19,349.0
6,18,70.0
6,7,358.0
7,18,307.0
7,1,1268.0
17,18,174.0
17,14,809.0
17,13,2561.0
9,10,410.0
9,11,781.0
9,12,419.0
11,16,416.0
11,1,362.0
12,1,752.0
10,16,655.0
Also, when you send your plan back, please use this simple JSON layout so it's easy to read and check:
{
""solution"": [[u1, v1], [u2, v2], ...]
}
Here ""solution"" is just a list of the links you want to include; each inner pair [u, v] is a single link connecting plot u to plot v. Think of it like filling in a short form: list the chosen connections one pair at a time. This block is just a sketch of the shape I expect, not the actual answer.
Please make sure to use the exact identifiers from the instance input — don't rename them and don't invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 23, 'edges': [{'u': 15, 'v': 12, 'w': 956.0}, {'u': 2, 'v': 8, 'w': 205.0}, {'u': 2, 'v': 16, 'w': 2196.0}, {'u': 3, 'v': 4, 'w': 545.0}, {'u': 3, 'v': 5, 'w': 592.0}, {'u': 4, 'v': 8, 'w': 38.0}, {'u': 4, 'v': 6, 'w': 473.0}, {'u': 5, 'v': 18, 'w': 492.0}, {'u': 5, 'v': 19, 'w': 349.0}, {'u': 6, 'v': 18, 'w': 70.0}, {'u': 6, 'v': 7, 'w': 358.0}, {'u': 7, 'v': 18, 'w': 307.0}, {'u': 7, 'v': 1, 'w': 1268.0}, {'u': 17, 'v': 18, 'w': 174.0}, {'u': 17, 'v': 14, 'w': 809.0}, {'u': 17, 'v': 13, 'w': 2561.0}, {'u': 9, 'v': 10, 'w': 410.0}, {'u': 9, 'v': 11, 'w': 781.0}, {'u': 9, 'v': 12, 'w': 419.0}, {'u': 11, 'v': 16, 'w': 416.0}, {'u': 11, 'v': 1, 'w': 362.0}, {'u': 12, 'v': 1, 'w': 752.0}, {'u': 10, 'v': 16, 'w': 655.0}], 'k': 10, 'source_file': 'I084.stp', 'density': 0.13450292397660818}","[[2, 8], [3, 4], [4, 8], [4, 6], [5, 18], [5, 19], [6, 18], [7, 18], [17, 18]]",2653.0,"{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 23, 'edges': [{'u': 15, 'v': 12, 'w': 956.0}, {'u': 2, 'v': 8, 'w': 205.0}, {'u': 2, 'v': 16, 'w': 2196.0}, {'u': 3, 'v': 4, 'w': 545.0}, {'u': 3, 'v': 5, 'w': 592.0}, {'u': 4, 'v': 8, 'w': 38.0}, {'u': 4, 'v': 6, 'w': 473.0}, {'u': 5, 'v': 18, 'w': 492.0}, {'u': 5, 'v': 19, 'w': 349.0}, {'u': 6, 'v': 18, 'w': 70.0}, {'u': 6, 'v': 7, 'w': 358.0}, {'u': 7, 'v': 18, 'w': 307.0}, {'u': 7, 'v': 1, 'w': 1268.0}, {'u': 17, 'v': 18, 'w': 174.0}, {'u': 17, 'v': 14, 'w': 809.0}, {'u': 17, 'v': 13, 'w': 2561.0}, {'u': 9, 'v': 10, 'w': 410.0}, {'u': 9, 'v': 11, 'w': 781.0}, {'u': 9, 'v': 12, 'w': 419.0}, {'u': 11, 'v': 16, 'w': 416.0}, {'u': 11, 'v': 1, 'w': 362.0}, {'u': 12, 'v': 1, 'w': 752.0}, {'u': 10, 'v': 16, 'w': 655.0}], 'density': 0.13450292397660818, 'source_file': 'I084.stp', 'k': 10}","[[2, 8], [3, 4], [4, 8], [4, 6], [5, 18], [5, 19], [6, 18], [7, 18], [17, 18]]",49,csv,1
KMST,KMST,"Someone from network operations has to choose a handful of small cells — exactly k — and set up backhaul so the chosen cells form a single connected layout with no loops or redundant paths. The goal is simply to keep the total backhaul expense as low as possible, measured by adding the cost of each link used. The detailed layout and costs are listed below.
{
""total_small_cells"": 19,
""total_candidate_links"": 20,
""edges"": [
{
""cell_u_id"": 4,
""cell_v_id"": 9,
""backhaul_cost"": 1850.0
},
{
""cell_u_id"": 16,
""cell_v_id"": 1,
""backhaul_cost"": 274.0
},
{
""cell_u_id"": 16,
""cell_v_id"": 13,
""backhaul_cost"": 1026.0
},
{
""cell_u_id"": 16,
""cell_v_id"": 9,
""backhaul_cost"": 1057.0
},
{
""cell_u_id"": 0,
""cell_v_id"": 1,
""backhaul_cost"": 1143.0
},
{
""cell_u_id"": 0,
""cell_v_id"": 8,
""backhaul_cost"": 147.0
},
{
""cell_u_id"": 1,
""cell_v_id"": 14,
""backhaul_cost"": 2393.0
},
{
""cell_u_id"": 6,
""cell_v_id"": 11,
""backhaul_cost"": 1998.0
},
{
""cell_u_id"": 7,
""cell_v_id"": 8,
""backhaul_cost"": 3604.0
},
{
""cell_u_id"": 12,
""cell_v_id"": 13,
""backhaul_cost"": 681.0
},
{
""cell_u_id"": 12,
""cell_v_id"": 11,
""backhaul_cost"": 4346.0
},
{
""cell_u_id"": 12,
""cell_v_id"": 8,
""backhaul_cost"": 749.0
},
{
""cell_u_id"": 13,
""cell_v_id"": 15,
""backhaul_cost"": 1132.0
},
{
""cell_u_id"": 15,
""cell_v_id"": 18,
""backhaul_cost"": 4154.0
},
{
""cell_u_id"": 15,
""cell_v_id"": 3,
""backhaul_cost"": 1478.0
},
{
""cell_u_id"": 9,
""cell_v_id"": 10,
""backhaul_cost"": 1019.0
},
{
""cell_u_id"": 11,
""cell_v_id"": 5,
""backhaul_cost"": 2212.0
},
{
""cell_u_id"": 17,
""cell_v_id"": 18,
""backhaul_cost"": 1176.0
},
{
""cell_u_id"": 18,
""cell_v_id"": 5,
""backhaul_cost"": 229.0
},
{
""cell_u_id"": 2,
""cell_v_id"": 3,
""backhaul_cost"": 1203.0
}
],
""target_active_small_cells"": 10
}
If you want to send back the chosen links, just use this simple JSON shape — a list of the selected edges under ""solution"". For example:
{
""solution"": [[""u1"", ""v1""], [""u2"", ""v2""], ...]
}
This is just a sketch of the shape I expect: ""solution"" holds a list of pairs, and each pair is an edge between two small-cell identifiers (the two ends of a backhaul link). Keep it light and use the same identifiers the instance uses — this block isn't the final answer, just the format I'll read.
Also: all identifiers must be used exactly as they appear in the instance input — no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 20, 'edges': [{'u': 5, 'v': 10, 'w': 1850.0}, {'u': 17, 'v': 2, 'w': 274.0}, {'u': 17, 'v': 14, 'w': 1026.0}, {'u': 17, 'v': 10, 'w': 1057.0}, {'u': 1, 'v': 2, 'w': 1143.0}, {'u': 1, 'v': 9, 'w': 147.0}, {'u': 2, 'v': 15, 'w': 2393.0}, {'u': 7, 'v': 12, 'w': 1998.0}, {'u': 8, 'v': 9, 'w': 3604.0}, {'u': 13, 'v': 14, 'w': 681.0}, {'u': 13, 'v': 12, 'w': 4346.0}, {'u': 13, 'v': 9, 'w': 749.0}, {'u': 14, 'v': 16, 'w': 1132.0}, {'u': 16, 'v': 19, 'w': 4154.0}, {'u': 16, 'v': 4, 'w': 1478.0}, {'u': 10, 'v': 11, 'w': 1019.0}, {'u': 12, 'v': 6, 'w': 2212.0}, {'u': 18, 'v': 19, 'w': 1176.0}, {'u': 19, 'v': 6, 'w': 229.0}, {'u': 3, 'v': 4, 'w': 1203.0}], 'k': 10, 'source_file': 'I046.stp', 'density': 0.11695906432748537}","[[2, 17], [14, 17], [10, 17], [1, 9], [13, 14], [9, 13], [14, 16], [4, 16], [10, 11]]",7563.0,"{'problem_type': 'KMST', 'num_nodes': 19, 'num_edges': 20, 'edges': [{'u': 4, 'v': 9, 'w': 1850.0}, {'u': 16, 'v': 1, 'w': 274.0}, {'u': 16, 'v': 13, 'w': 1026.0}, {'u': 16, 'v': 9, 'w': 1057.0}, {'u': 0, 'v': 1, 'w': 1143.0}, {'u': 0, 'v': 8, 'w': 147.0}, {'u': 1, 'v': 14, 'w': 2393.0}, {'u': 6, 'v': 11, 'w': 1998.0}, {'u': 7, 'v': 8, 'w': 3604.0}, {'u': 12, 'v': 13, 'w': 681.0}, {'u': 12, 'v': 11, 'w': 4346.0}, {'u': 12, 'v': 8, 'w': 749.0}, {'u': 13, 'v': 15, 'w': 1132.0}, {'u': 15, 'v': 18, 'w': 4154.0}, {'u': 15, 'v': 3, 'w': 1478.0}, {'u': 9, 'v': 10, 'w': 1019.0}, {'u': 11, 'v': 5, 'w': 2212.0}, {'u': 17, 'v': 18, 'w': 1176.0}, {'u': 18, 'v': 5, 'w': 229.0}, {'u': 2, 'v': 3, 'w': 1203.0}], 'density': 0.11695906432748537, 'source_file': 'I046.stp', 'k': 10}","[[1, 16], [13, 16], [9, 16], [0, 8], [12, 13], [8, 12], [13, 15], [3, 15], [9, 10]]",50,json,0
|