File size: 240,725 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 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 | task_name,problem_type,instruction,instance,solution,obj,instance_variant,solution_variant,context_index,input_format,input_index_base
MIS,MIS,"Recently the wedding coordinator decided to make a carefully spaced display of centerpieces: pick as many tables to dress as possible but avoid picking any tables that are next to each other on the floor map. Success is just the number of dressed tables — add them up — and no table gets picked twice or left in an ambiguous state. The detailed layout is provided below.
There are 24 tables in total and 46 num adjacent pairs.
| adjacent_table_1 | adjacent_table_2 |
|---|---|
| 8 | 12 |
| 5 | 0 |
| 5 | 1 |
| 5 | 16 |
| 14 | 4 |
| 14 | 7 |
| 14 | 9 |
| 14 | 11 |
| 14 | 15 |
| 14 | 22 |
| 15 | 6 |
| 15 | 11 |
| 15 | 17 |
| 15 | 19 |
| 15 | 22 |
| 17 | 12 |
| 17 | 19 |
| 17 | 22 |
| 6 | 10 |
| 6 | 11 |
| 6 | 19 |
| 6 | 20 |
| 7 | 1 |
| 7 | 12 |
| 7 | 16 |
| 7 | 21 |
| 7 | 22 |
| 23 | 12 |
| 23 | 21 |
| 13 | 11 |
| 0 | 12 |
| 0 | 16 |
| 1 | 2 |
| 1 | 4 |
| 2 | 4 |
| 3 | 4 |
| 3 | 11 |
| 10 | 12 |
| 10 | 19 |
| 10 | 20 |
| 11 | 18 |
| 11 | 20 |
| 12 | 16 |
| 12 | 19 |
| 12 | 21 |
| 21 | 16 |
Also, when you send back which tables you picked, just put them in a tiny JSON snippet like this so it's clear and easy to check:
{
""solution"": [""table_id"", ""table_id"", ...]
}
Quick note: ""solution"" is the list of table identifiers you chose to dress for the display. Each entry in that array should be a single table id from the floor plan (the ""table_id"" placeholders above just show the shape — replace them with the actual ids). The little ellipsis means you can list as many ids as needed.
This JSON is just a sketch of the expected shape, not the actual answer itself — please return the real ids from the instance.
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': 'MIS', 'num_nodes': 24, 'num_edges': 46, 'edges': [{'u': 9, 'v': 13}, {'u': 6, 'v': 1}, {'u': 6, 'v': 2}, {'u': 6, 'v': 17}, {'u': 15, 'v': 5}, {'u': 15, 'v': 8}, {'u': 15, 'v': 10}, {'u': 15, 'v': 12}, {'u': 15, 'v': 16}, {'u': 15, 'v': 23}, {'u': 16, 'v': 7}, {'u': 16, 'v': 12}, {'u': 16, 'v': 18}, {'u': 16, 'v': 20}, {'u': 16, 'v': 23}, {'u': 18, 'v': 13}, {'u': 18, 'v': 20}, {'u': 18, 'v': 23}, {'u': 7, 'v': 11}, {'u': 7, 'v': 12}, {'u': 7, 'v': 20}, {'u': 7, 'v': 21}, {'u': 8, 'v': 2}, {'u': 8, 'v': 13}, {'u': 8, 'v': 17}, {'u': 8, 'v': 22}, {'u': 8, 'v': 23}, {'u': 24, 'v': 13}, {'u': 24, 'v': 22}, {'u': 14, 'v': 12}, {'u': 1, 'v': 13}, {'u': 1, 'v': 17}, {'u': 2, 'v': 3}, {'u': 2, 'v': 5}, {'u': 3, 'v': 5}, {'u': 4, 'v': 5}, {'u': 4, 'v': 12}, {'u': 11, 'v': 13}, {'u': 11, 'v': 20}, {'u': 11, 'v': 21}, {'u': 12, 'v': 19}, {'u': 12, 'v': 21}, {'u': 13, 'v': 17}, {'u': 13, 'v': 20}, {'u': 13, 'v': 22}, {'u': 22, 'v': 17}], 'source_file': 'vt2010.mtx', 'density': 0.16666666666666666, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0000.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0000.png', 'edge_connectivity': 1}","[1, 3, 4, 8, 9, 10, 14, 19, 20, 21, 24]",11.0,"{'num_nodes': 24, 'num_edges': 46, 'edges': [{'u': 8, 'v': 12}, {'u': 5, 'v': 0}, {'u': 5, 'v': 1}, {'u': 5, 'v': 16}, {'u': 14, 'v': 4}, {'u': 14, 'v': 7}, {'u': 14, 'v': 9}, {'u': 14, 'v': 11}, {'u': 14, 'v': 15}, {'u': 14, 'v': 22}, {'u': 15, 'v': 6}, {'u': 15, 'v': 11}, {'u': 15, 'v': 17}, {'u': 15, 'v': 19}, {'u': 15, 'v': 22}, {'u': 17, 'v': 12}, {'u': 17, 'v': 19}, {'u': 17, 'v': 22}, {'u': 6, 'v': 10}, {'u': 6, 'v': 11}, {'u': 6, 'v': 19}, {'u': 6, 'v': 20}, {'u': 7, 'v': 1}, {'u': 7, 'v': 12}, {'u': 7, 'v': 16}, {'u': 7, 'v': 21}, {'u': 7, 'v': 22}, {'u': 23, 'v': 12}, {'u': 23, 'v': 21}, {'u': 13, 'v': 11}, {'u': 0, 'v': 12}, {'u': 0, 'v': 16}, {'u': 1, 'v': 2}, {'u': 1, 'v': 4}, {'u': 2, 'v': 4}, {'u': 3, 'v': 4}, {'u': 3, 'v': 11}, {'u': 10, 'v': 12}, {'u': 10, 'v': 19}, {'u': 10, 'v': 20}, {'u': 11, 'v': 18}, {'u': 11, 'v': 20}, {'u': 12, 'v': 16}, {'u': 12, 'v': 19}, {'u': 12, 'v': 21}, {'u': 21, 'v': 16}]}","[0, 2, 3, 7, 8, 9, 13, 18, 19, 20, 23]",1,markdown_table,0
MIS,MIS,"I’m setting up the front display at the library and want to pick as many interesting books as I can, but I’m careful not to put two chosen books right next to each other on the shelf. The better a selection is, the more books end up on that display — so the simple way to judge a pick is to count how many distinct books are placed there. Each book can only be chosen once and every choice must respect the “no neighbors” rule on the shelf. The exact shelf layout and details are shown below.
There are 19 books on shelf in total and 41 num adjacent book pairs.
| book_id_a | book_id_b |
|---|---|
| 16 | 2 |
| 16 | 3 |
| 16 | 14 |
| 7 | 5 |
| 7 | 6 |
| 7 | 12 |
| 7 | 15 |
| 0 | 4 |
| 0 | 11 |
| 0 | 12 |
| 0 | 13 |
| 0 | 17 |
| 0 | 18 |
| 18 | 1 |
| 18 | 4 |
| 12 | 1 |
| 12 | 4 |
| 12 | 5 |
| 12 | 6 |
| 12 | 11 |
| 12 | 14 |
| 12 | 15 |
| 17 | 4 |
| 17 | 10 |
| 17 | 13 |
| 13 | 9 |
| 13 | 10 |
| 8 | 2 |
| 8 | 4 |
| 8 | 14 |
| 9 | 10 |
| 9 | 11 |
| 3 | 14 |
| 4 | 1 |
| 4 | 10 |
| 4 | 14 |
| 2 | 10 |
| 5 | 6 |
| 5 | 14 |
| 15 | 11 |
| 10 | 11 |
If you want to pass me the selection in a neat, machine-friendly way, you can just use a little JSON like this:
{
""solution"": [""book_id"", ""book_id"", ...]
}
Here ""solution"" is the list of the books you put on the front display — each entry should be the exact ID for a book from the instance (so one entry per chosen book, and don't list two books that are neighbors). This JSON is just a sketch of the shape I expect, not the actual final answer.
All identifiers must be used 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': 'MIS', 'num_nodes': 19, 'num_edges': 41, 'edges': [{'u': 17, 'v': 3}, {'u': 17, 'v': 4}, {'u': 17, 'v': 15}, {'u': 8, 'v': 6}, {'u': 8, 'v': 7}, {'u': 8, 'v': 13}, {'u': 8, 'v': 16}, {'u': 1, 'v': 5}, {'u': 1, 'v': 12}, {'u': 1, 'v': 13}, {'u': 1, 'v': 14}, {'u': 1, 'v': 18}, {'u': 1, 'v': 19}, {'u': 19, 'v': 2}, {'u': 19, 'v': 5}, {'u': 13, 'v': 2}, {'u': 13, 'v': 5}, {'u': 13, 'v': 6}, {'u': 13, 'v': 7}, {'u': 13, 'v': 12}, {'u': 13, 'v': 15}, {'u': 13, 'v': 16}, {'u': 18, 'v': 5}, {'u': 18, 'v': 11}, {'u': 18, 'v': 14}, {'u': 14, 'v': 10}, {'u': 14, 'v': 11}, {'u': 9, 'v': 3}, {'u': 9, 'v': 5}, {'u': 9, 'v': 15}, {'u': 10, 'v': 11}, {'u': 10, 'v': 12}, {'u': 4, 'v': 15}, {'u': 5, 'v': 2}, {'u': 5, 'v': 11}, {'u': 5, 'v': 15}, {'u': 3, 'v': 11}, {'u': 6, 'v': 7}, {'u': 6, 'v': 15}, {'u': 16, 'v': 12}, {'u': 11, 'v': 12}], 'source_file': 'wi2010.mtx', 'density': 0.23976608187134502, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0001.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0001.png', 'edge_connectivity': 2}","[2, 4, 7, 9, 10, 16, 18]",7.0,"{'num_nodes': 19, 'num_edges': 41, 'edges': [{'u': 16, 'v': 2}, {'u': 16, 'v': 3}, {'u': 16, 'v': 14}, {'u': 7, 'v': 5}, {'u': 7, 'v': 6}, {'u': 7, 'v': 12}, {'u': 7, 'v': 15}, {'u': 0, 'v': 4}, {'u': 0, 'v': 11}, {'u': 0, 'v': 12}, {'u': 0, 'v': 13}, {'u': 0, 'v': 17}, {'u': 0, 'v': 18}, {'u': 18, 'v': 1}, {'u': 18, 'v': 4}, {'u': 12, 'v': 1}, {'u': 12, 'v': 4}, {'u': 12, 'v': 5}, {'u': 12, 'v': 6}, {'u': 12, 'v': 11}, {'u': 12, 'v': 14}, {'u': 12, 'v': 15}, {'u': 17, 'v': 4}, {'u': 17, 'v': 10}, {'u': 17, 'v': 13}, {'u': 13, 'v': 9}, {'u': 13, 'v': 10}, {'u': 8, 'v': 2}, {'u': 8, 'v': 4}, {'u': 8, 'v': 14}, {'u': 9, 'v': 10}, {'u': 9, 'v': 11}, {'u': 3, 'v': 14}, {'u': 4, 'v': 1}, {'u': 4, 'v': 10}, {'u': 4, 'v': 14}, {'u': 2, 'v': 10}, {'u': 5, 'v': 6}, {'u': 5, 'v': 14}, {'u': 15, 'v': 11}, {'u': 10, 'v': 11}]}","[1, 3, 6, 8, 9, 15, 17]",2,markdown_table,0
MIS,MIS,"I’m the radio tech staring at a wall of channel knobs: each one can be switched on or left off, but some pairs clash and can’t be on at the same time. The job is to flip as many knobs to “on” as possible without ever turning on two channels that interfere with each other. How to tell which plan is better? Just count how many channels are on — the higher the count, the better. Every channel is decided once (on or off) and can’t be duplicated, and the specific interference pairs and channels are listed below.
There are 19 channels in total and 35 interference pairs.
| channel_one | channel_two |
|---|---|
| 18 | 2 |
| 18 | 3 |
| 18 | 8 |
| 18 | 9 |
| 18 | 13 |
| 18 | 15 |
| 18 | 17 |
| 1 | 3 |
| 1 | 5 |
| 1 | 9 |
| 1 | 11 |
| 13 | 7 |
| 13 | 8 |
| 13 | 15 |
| 12 | 6 |
| 12 | 7 |
| 12 | 15 |
| 14 | 0 |
| 14 | 2 |
| 14 | 6 |
| 14 | 15 |
| 7 | 8 |
| 9 | 2 |
| 9 | 17 |
| 3 | 16 |
| 10 | 0 |
| 10 | 2 |
| 16 | 11 |
| 17 | 2 |
| 0 | 2 |
| 0 | 4 |
| 0 | 6 |
| 11 | 5 |
| 5 | 2 |
| 4 | 2 |
Oh, and when you give the answer, just put it in this little JSON shape so it's easy to read and parse:
{
""solution"": [""channel_id"", ""channel_id"", ...]
}
Pretty straightforward: ""solution"" is the list of channels you want switched on (one entry per channel). The example uses the placeholder ""channel_id"" to show the format — replace those placeholders with the actual channel identifiers from the instance when you answer. This JSON is just a sketch of the shape I expect, not the final selection.
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': 'MIS', 'num_nodes': 19, 'num_edges': 35, 'edges': [{'u': 19, 'v': 3}, {'u': 19, 'v': 4}, {'u': 19, 'v': 9}, {'u': 19, 'v': 10}, {'u': 19, 'v': 14}, {'u': 19, 'v': 16}, {'u': 19, 'v': 18}, {'u': 2, 'v': 4}, {'u': 2, 'v': 6}, {'u': 2, 'v': 10}, {'u': 2, 'v': 12}, {'u': 14, 'v': 8}, {'u': 14, 'v': 9}, {'u': 14, 'v': 16}, {'u': 13, 'v': 7}, {'u': 13, 'v': 8}, {'u': 13, 'v': 16}, {'u': 15, 'v': 1}, {'u': 15, 'v': 3}, {'u': 15, 'v': 7}, {'u': 15, 'v': 16}, {'u': 8, 'v': 9}, {'u': 10, 'v': 3}, {'u': 10, 'v': 18}, {'u': 4, 'v': 17}, {'u': 11, 'v': 1}, {'u': 11, 'v': 3}, {'u': 17, 'v': 12}, {'u': 18, 'v': 3}, {'u': 1, 'v': 3}, {'u': 1, 'v': 5}, {'u': 1, 'v': 7}, {'u': 12, 'v': 6}, {'u': 6, 'v': 3}, {'u': 5, 'v': 3}], 'source_file': 'wa2010.mtx', 'density': 0.2046783625730994, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0002.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0002.png', 'edge_connectivity': 2}","[4, 5, 6, 9, 11, 13, 15, 18]",8.0,"{'num_nodes': 19, 'num_edges': 35, 'edges': [{'u': 18, 'v': 2}, {'u': 18, 'v': 3}, {'u': 18, 'v': 8}, {'u': 18, 'v': 9}, {'u': 18, 'v': 13}, {'u': 18, 'v': 15}, {'u': 18, 'v': 17}, {'u': 1, 'v': 3}, {'u': 1, 'v': 5}, {'u': 1, 'v': 9}, {'u': 1, 'v': 11}, {'u': 13, 'v': 7}, {'u': 13, 'v': 8}, {'u': 13, 'v': 15}, {'u': 12, 'v': 6}, {'u': 12, 'v': 7}, {'u': 12, 'v': 15}, {'u': 14, 'v': 0}, {'u': 14, 'v': 2}, {'u': 14, 'v': 6}, {'u': 14, 'v': 15}, {'u': 7, 'v': 8}, {'u': 9, 'v': 2}, {'u': 9, 'v': 17}, {'u': 3, 'v': 16}, {'u': 10, 'v': 0}, {'u': 10, 'v': 2}, {'u': 16, 'v': 11}, {'u': 17, 'v': 2}, {'u': 0, 'v': 2}, {'u': 0, 'v': 4}, {'u': 0, 'v': 6}, {'u': 11, 'v': 5}, {'u': 5, 'v': 2}, {'u': 4, 'v': 2}]}","[3, 4, 5, 8, 10, 12, 14, 17]",3,markdown_table,0
MIS,MIS,"We had a small exhibition to plan and the curatorial team was trying to squeeze in as many pieces as they could. The idea was simple: choose the biggest collection of paintings to display, while making sure none of the selected works are placed on panels that are next to each other. How well the team did is measured by the final count of displayed paintings — just add them up — and each piece can only be used once and must occupy its own panel. The specific panel map and the list of paintings are shown below.
There are 24 panels in total and 50 adjacent panel pairs.
| panel_a | panel_b |
|---|---|
| 13 | 1 |
| 13 | 3 |
| 13 | 6 |
| 13 | 11 |
| 13 | 14 |
| 13 | 15 |
| 13 | 17 |
| 13 | 19 |
| 13 | 21 |
| 13 | 23 |
| 13 | 24 |
| 16 | 5 |
| 16 | 6 |
| 16 | 8 |
| 16 | 12 |
| 16 | 17 |
| 17 | 6 |
| 17 | 8 |
| 18 | 1 |
| 18 | 2 |
| 18 | 3 |
| 18 | 10 |
| 18 | 15 |
| 19 | 11 |
| 19 | 21 |
| 6 | 3 |
| 6 | 5 |
| 10 | 2 |
| 10 | 3 |
| 14 | 8 |
| 14 | 12 |
| 15 | 2 |
| 15 | 21 |
| 9 | 5 |
| 9 | 7 |
| 9 | 22 |
| 22 | 5 |
| 22 | 7 |
| 22 | 20 |
| 23 | 1 |
| 2 | 3 |
| 2 | 4 |
| 2 | 5 |
| 3 | 5 |
| 4 | 5 |
| 4 | 21 |
| 20 | 5 |
| 21 | 5 |
| 21 | 7 |
| 5 | 7 |
If you want to hand me the chosen panels in a neat, machine-friendly way, just return them in this little JSON shape.
{
""solution"": [""vertex_id"", ""vertex_id"", ...]
}
Think of ""solution"" as the list of panels where the chosen paintings will hang — just put each panel's identifier in that array. It's just a sketch of the shape I expect, not the final answer itself.
Please make sure you use the exact identifiers from the instance input — no renaming, 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': 'MIS', 'num_nodes': 24, 'num_edges': 50, 'edges': [{'u': 13, 'v': 1}, {'u': 13, 'v': 3}, {'u': 13, 'v': 6}, {'u': 13, 'v': 11}, {'u': 13, 'v': 14}, {'u': 13, 'v': 15}, {'u': 13, 'v': 17}, {'u': 13, 'v': 19}, {'u': 13, 'v': 21}, {'u': 13, 'v': 23}, {'u': 13, 'v': 24}, {'u': 16, 'v': 5}, {'u': 16, 'v': 6}, {'u': 16, 'v': 8}, {'u': 16, 'v': 12}, {'u': 16, 'v': 17}, {'u': 17, 'v': 6}, {'u': 17, 'v': 8}, {'u': 18, 'v': 1}, {'u': 18, 'v': 2}, {'u': 18, 'v': 3}, {'u': 18, 'v': 10}, {'u': 18, 'v': 15}, {'u': 19, 'v': 11}, {'u': 19, 'v': 21}, {'u': 6, 'v': 3}, {'u': 6, 'v': 5}, {'u': 10, 'v': 2}, {'u': 10, 'v': 3}, {'u': 14, 'v': 8}, {'u': 14, 'v': 12}, {'u': 15, 'v': 2}, {'u': 15, 'v': 21}, {'u': 9, 'v': 5}, {'u': 9, 'v': 7}, {'u': 9, 'v': 22}, {'u': 22, 'v': 5}, {'u': 22, 'v': 7}, {'u': 22, 'v': 20}, {'u': 23, 'v': 1}, {'u': 2, 'v': 3}, {'u': 2, 'v': 4}, {'u': 2, 'v': 5}, {'u': 3, 'v': 5}, {'u': 4, 'v': 5}, {'u': 4, 'v': 21}, {'u': 20, 'v': 5}, {'u': 21, 'v': 5}, {'u': 21, 'v': 7}, {'u': 5, 'v': 7}], 'source_file': 'wy2010.mtx', 'density': 0.18115942028985507, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0003.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0003.png', 'edge_connectivity': 1}","[4, 6, 8, 9, 10, 11, 12, 15, 20, 23, 24]",11.0,"{'num_nodes': 24, 'num_edges': 50, 'edges': [{'u': 13, 'v': 1}, {'u': 13, 'v': 3}, {'u': 13, 'v': 6}, {'u': 13, 'v': 11}, {'u': 13, 'v': 14}, {'u': 13, 'v': 15}, {'u': 13, 'v': 17}, {'u': 13, 'v': 19}, {'u': 13, 'v': 21}, {'u': 13, 'v': 23}, {'u': 13, 'v': 24}, {'u': 16, 'v': 5}, {'u': 16, 'v': 6}, {'u': 16, 'v': 8}, {'u': 16, 'v': 12}, {'u': 16, 'v': 17}, {'u': 17, 'v': 6}, {'u': 17, 'v': 8}, {'u': 18, 'v': 1}, {'u': 18, 'v': 2}, {'u': 18, 'v': 3}, {'u': 18, 'v': 10}, {'u': 18, 'v': 15}, {'u': 19, 'v': 11}, {'u': 19, 'v': 21}, {'u': 6, 'v': 3}, {'u': 6, 'v': 5}, {'u': 10, 'v': 2}, {'u': 10, 'v': 3}, {'u': 14, 'v': 8}, {'u': 14, 'v': 12}, {'u': 15, 'v': 2}, {'u': 15, 'v': 21}, {'u': 9, 'v': 5}, {'u': 9, 'v': 7}, {'u': 9, 'v': 22}, {'u': 22, 'v': 5}, {'u': 22, 'v': 7}, {'u': 22, 'v': 20}, {'u': 23, 'v': 1}, {'u': 2, 'v': 3}, {'u': 2, 'v': 4}, {'u': 2, 'v': 5}, {'u': 3, 'v': 5}, {'u': 4, 'v': 5}, {'u': 4, 'v': 21}, {'u': 20, 'v': 5}, {'u': 21, 'v': 5}, {'u': 21, 'v': 7}, {'u': 5, 'v': 7}]}","[4, 6, 8, 9, 10, 11, 12, 15, 20, 23, 24]",4,markdown_table,1
MIS,MIS,"Recently the neighborhood organizer took on the task of assembling a guest list for a street party, aiming to invite as many households as possible but not having any invited homes be next-door neighbors. The decision involves picking which households to put on the list; a superior choice is simply the list with the most invited homes — count them to compare — and every chosen pair must avoid being adjacent. Each household must be handled once and only once, so nothing is duplicated or overlooked. The detailed map and instance info are shown below.
There are 21 households in total and 43 adjacent pairs.
| household_a | household_b |
|---|---|
| C | A |
| C | F |
| C | L |
| C | O |
| C | Q |
| C | S |
| C | T |
| D | E |
| D | G |
| D | H |
| D | I |
| D | K |
| F | L |
| F | N |
| F | Q |
| E | H |
| E | K |
| E | N |
| J | A |
| J | N |
| K | A |
| K | N |
| K | R |
| G | H |
| G | I |
| G | N |
| S | N |
| S | T |
| P | I |
| P | N |
| T | N |
| B | A |
| B | N |
| B | O |
| U | A |
| H | N |
| L | N |
| R | A |
| R | N |
| M | A |
| M | N |
| N | I |
| N | O |
Also, feel free to return the final guest list in this simple JSON layout so it's easy to read programmatically:
{
""solution"": [""household_id"", ""household_id"", ...]
}
Here ""solution"" is just the list of households you've chosen to invite — each entry should be the exact household identifier from the instance (so think of these placeholders as where the real IDs go). This JSON is just a sketch of the shape I need, not the actual answer itself.
Please 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': 'MIS', 'num_nodes': 21, 'num_edges': 43, 'edges': [{'u': 3, 'v': 1}, {'u': 3, 'v': 6}, {'u': 3, 'v': 12}, {'u': 3, 'v': 15}, {'u': 3, 'v': 17}, {'u': 3, 'v': 19}, {'u': 3, 'v': 20}, {'u': 4, 'v': 5}, {'u': 4, 'v': 7}, {'u': 4, 'v': 8}, {'u': 4, 'v': 9}, {'u': 4, 'v': 11}, {'u': 6, 'v': 12}, {'u': 6, 'v': 14}, {'u': 6, 'v': 17}, {'u': 5, 'v': 8}, {'u': 5, 'v': 11}, {'u': 5, 'v': 14}, {'u': 10, 'v': 1}, {'u': 10, 'v': 14}, {'u': 11, 'v': 1}, {'u': 11, 'v': 14}, {'u': 11, 'v': 18}, {'u': 7, 'v': 8}, {'u': 7, 'v': 9}, {'u': 7, 'v': 14}, {'u': 19, 'v': 14}, {'u': 19, 'v': 20}, {'u': 16, 'v': 9}, {'u': 16, 'v': 14}, {'u': 20, 'v': 14}, {'u': 2, 'v': 1}, {'u': 2, 'v': 14}, {'u': 2, 'v': 15}, {'u': 21, 'v': 1}, {'u': 8, 'v': 14}, {'u': 12, 'v': 14}, {'u': 18, 'v': 1}, {'u': 18, 'v': 14}, {'u': 13, 'v': 1}, {'u': 13, 'v': 14}, {'u': 14, 'v': 9}, {'u': 14, 'v': 15}], 'source_file': 'wv2010.mtx', 'density': 0.20476190476190476, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0004.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0004.png', 'edge_connectivity': 1}","[2, 5, 7, 10, 12, 13, 16, 17, 18, 19, 21]",11.0,"{'num_nodes': 21, 'num_edges': 43, 'edges': [{'u': 'C', 'v': 'A'}, {'u': 'C', 'v': 'F'}, {'u': 'C', 'v': 'L'}, {'u': 'C', 'v': 'O'}, {'u': 'C', 'v': 'Q'}, {'u': 'C', 'v': 'S'}, {'u': 'C', 'v': 'T'}, {'u': 'D', 'v': 'E'}, {'u': 'D', 'v': 'G'}, {'u': 'D', 'v': 'H'}, {'u': 'D', 'v': 'I'}, {'u': 'D', 'v': 'K'}, {'u': 'F', 'v': 'L'}, {'u': 'F', 'v': 'N'}, {'u': 'F', 'v': 'Q'}, {'u': 'E', 'v': 'H'}, {'u': 'E', 'v': 'K'}, {'u': 'E', 'v': 'N'}, {'u': 'J', 'v': 'A'}, {'u': 'J', 'v': 'N'}, {'u': 'K', 'v': 'A'}, {'u': 'K', 'v': 'N'}, {'u': 'K', 'v': 'R'}, {'u': 'G', 'v': 'H'}, {'u': 'G', 'v': 'I'}, {'u': 'G', 'v': 'N'}, {'u': 'S', 'v': 'N'}, {'u': 'S', 'v': 'T'}, {'u': 'P', 'v': 'I'}, {'u': 'P', 'v': 'N'}, {'u': 'T', 'v': 'N'}, {'u': 'B', 'v': 'A'}, {'u': 'B', 'v': 'N'}, {'u': 'B', 'v': 'O'}, {'u': 'U', 'v': 'A'}, {'u': 'H', 'v': 'N'}, {'u': 'L', 'v': 'N'}, {'u': 'R', 'v': 'A'}, {'u': 'R', 'v': 'N'}, {'u': 'M', 'v': 'A'}, {'u': 'M', 'v': 'N'}, {'u': 'N', 'v': 'I'}, {'u': 'N', 'v': 'O'}]}","['B', 'E', 'G', 'J', 'L', 'M', 'P', 'Q', 'R', 'S', 'U']",5,markdown_table,names
MIS,MIS,"There’s a classroom full of kids and the teacher needs to decide who gets solo presentation slots so that no two chosen students are adjacent. The goal is to end up with as many solo presenters as possible; you judge a selection by counting the number of different students in it, and the bigger that number the better. Practical rules: pick distinct students only, and don’t pick any pair that are seated next to each other. The detailed seating chart and options are shown below.
There are 20 students in total and 40 adjacent pairs count.
| student_u_id | student_v_id |
|---|---|
| 13 | 1 |
| 13 | 3 |
| 13 | 5 |
| 13 | 7 |
| 13 | 12 |
| 13 | 15 |
| 13 | 16 |
| 13 | 18 |
| 13 | 19 |
| 1 | 6 |
| 1 | 7 |
| 1 | 8 |
| 1 | 14 |
| 1 | 17 |
| 15 | 12 |
| 15 | 19 |
| 16 | 7 |
| 3 | 6 |
| 17 | 4 |
| 17 | 7 |
| 17 | 8 |
| 18 | 10 |
| 18 | 12 |
| 18 | 14 |
| 4 | 5 |
| 4 | 8 |
| 4 | 20 |
| 2 | 5 |
| 2 | 10 |
| 2 | 11 |
| 5 | 9 |
| 5 | 12 |
| 5 | 19 |
| 5 | 20 |
| 9 | 11 |
| 9 | 12 |
| 10 | 12 |
| 7 | 20 |
| 11 | 12 |
| 12 | 19 |
If you're going to send me a selection, please use this simple JSON layout so I can pick it up reliably. Just list the chosen seats in the array — nothing fancy.
{
""solution"": [""seat_id"", ""seat_id"", ...]
}
Pretty straightforward: the ""solution"" field is an array with one placeholder per chosen solo presenter (replace each placeholder with the actual seat identifier from the instance). This is just a template to show the shape I expect, not your final answer.
Please make sure you use the exact identifiers given 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': 'MIS', 'num_nodes': 20, 'num_edges': 40, 'edges': [{'u': 13, 'v': 1}, {'u': 13, 'v': 3}, {'u': 13, 'v': 5}, {'u': 13, 'v': 7}, {'u': 13, 'v': 12}, {'u': 13, 'v': 15}, {'u': 13, 'v': 16}, {'u': 13, 'v': 18}, {'u': 13, 'v': 19}, {'u': 1, 'v': 6}, {'u': 1, 'v': 7}, {'u': 1, 'v': 8}, {'u': 1, 'v': 14}, {'u': 1, 'v': 17}, {'u': 15, 'v': 12}, {'u': 15, 'v': 19}, {'u': 16, 'v': 7}, {'u': 3, 'v': 6}, {'u': 17, 'v': 4}, {'u': 17, 'v': 7}, {'u': 17, 'v': 8}, {'u': 18, 'v': 10}, {'u': 18, 'v': 12}, {'u': 18, 'v': 14}, {'u': 4, 'v': 5}, {'u': 4, 'v': 8}, {'u': 4, 'v': 20}, {'u': 2, 'v': 5}, {'u': 2, 'v': 10}, {'u': 2, 'v': 11}, {'u': 5, 'v': 9}, {'u': 5, 'v': 12}, {'u': 5, 'v': 19}, {'u': 5, 'v': 20}, {'u': 9, 'v': 11}, {'u': 9, 'v': 12}, {'u': 10, 'v': 12}, {'u': 7, 'v': 20}, {'u': 11, 'v': 12}, {'u': 12, 'v': 19}], 'source_file': 'vt2010.mtx', 'density': 0.21052631578947367, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0005.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0005.png', 'edge_connectivity': 2}","[2, 3, 8, 9, 14, 15, 16, 20]",8.0,"{'num_nodes': 20, 'num_edges': 40, 'edges': [{'u': 13, 'v': 1}, {'u': 13, 'v': 3}, {'u': 13, 'v': 5}, {'u': 13, 'v': 7}, {'u': 13, 'v': 12}, {'u': 13, 'v': 15}, {'u': 13, 'v': 16}, {'u': 13, 'v': 18}, {'u': 13, 'v': 19}, {'u': 1, 'v': 6}, {'u': 1, 'v': 7}, {'u': 1, 'v': 8}, {'u': 1, 'v': 14}, {'u': 1, 'v': 17}, {'u': 15, 'v': 12}, {'u': 15, 'v': 19}, {'u': 16, 'v': 7}, {'u': 3, 'v': 6}, {'u': 17, 'v': 4}, {'u': 17, 'v': 7}, {'u': 17, 'v': 8}, {'u': 18, 'v': 10}, {'u': 18, 'v': 12}, {'u': 18, 'v': 14}, {'u': 4, 'v': 5}, {'u': 4, 'v': 8}, {'u': 4, 'v': 20}, {'u': 2, 'v': 5}, {'u': 2, 'v': 10}, {'u': 2, 'v': 11}, {'u': 5, 'v': 9}, {'u': 5, 'v': 12}, {'u': 5, 'v': 19}, {'u': 5, 'v': 20}, {'u': 9, 'v': 11}, {'u': 9, 'v': 12}, {'u': 10, 'v': 12}, {'u': 7, 'v': 20}, {'u': 11, 'v': 12}, {'u': 12, 'v': 19}]}","[2, 3, 8, 9, 14, 15, 16, 20]",6,markdown_table,1
MIS,MIS,"Someone at the shop needs to power up a subset of machines so the system has maximum capacity, while making sure no two powered machines are linked by a cable. What makes one choice better than another is purely the total number of servers left running — count them and the larger total is preferable. Each server gets a single decision (on or off) and the exact connectivity details are shown below.
There are 20 servers in total and 47 cables.
| server_endpoint_u | server_endpoint_v |
|---|---|
| 16 | 6 |
| 16 | 8 |
| 16 | 19 |
| 7 | 1 |
| 7 | 12 |
| 7 | 13 |
| 7 | 15 |
| 8 | 13 |
| 8 | 19 |
| 18 | 4 |
| 18 | 6 |
| 18 | 10 |
| 19 | 1 |
| 19 | 2 |
| 19 | 6 |
| 19 | 9 |
| 19 | 15 |
| 11 | 4 |
| 11 | 5 |
| 11 | 9 |
| 11 | 10 |
| 6 | 4 |
| 6 | 9 |
| 6 | 10 |
| 6 | 13 |
| 17 | 1 |
| 17 | 2 |
| 17 | 13 |
| 17 | 20 |
| 1 | 2 |
| 9 | 3 |
| 9 | 4 |
| 9 | 5 |
| 9 | 13 |
| 9 | 20 |
| 10 | 5 |
| 10 | 13 |
| 10 | 14 |
| 2 | 20 |
| 12 | 13 |
| 12 | 15 |
| 13 | 3 |
| 13 | 14 |
| 13 | 15 |
| 13 | 20 |
| 14 | 5 |
| 5 | 3 |
If you want to give the answer, just use this little JSON shape so I can read it easily — nothing fancy, just a list of the machines you leave on.
{
""solution"": [""server_id"", ""server_id"", ...]
}
solution: an array with the IDs of the servers you decide to power up (one ID per server). Think of it as ticking boxes on a form — each entry is a machine you left running.
This JSON is just a sketch of the shape I expect, not the actual solution — replace the placeholders with the exact IDs from the instance.
Please use the identifiers exactly as they appear in the problem 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': 'MIS', 'num_nodes': 20, 'num_edges': 47, 'edges': [{'u': 16, 'v': 6}, {'u': 16, 'v': 8}, {'u': 16, 'v': 19}, {'u': 7, 'v': 1}, {'u': 7, 'v': 12}, {'u': 7, 'v': 13}, {'u': 7, 'v': 15}, {'u': 8, 'v': 13}, {'u': 8, 'v': 19}, {'u': 18, 'v': 4}, {'u': 18, 'v': 6}, {'u': 18, 'v': 10}, {'u': 19, 'v': 1}, {'u': 19, 'v': 2}, {'u': 19, 'v': 6}, {'u': 19, 'v': 9}, {'u': 19, 'v': 15}, {'u': 11, 'v': 4}, {'u': 11, 'v': 5}, {'u': 11, 'v': 9}, {'u': 11, 'v': 10}, {'u': 6, 'v': 4}, {'u': 6, 'v': 9}, {'u': 6, 'v': 10}, {'u': 6, 'v': 13}, {'u': 17, 'v': 1}, {'u': 17, 'v': 2}, {'u': 17, 'v': 13}, {'u': 17, 'v': 20}, {'u': 1, 'v': 2}, {'u': 9, 'v': 3}, {'u': 9, 'v': 4}, {'u': 9, 'v': 5}, {'u': 9, 'v': 13}, {'u': 9, 'v': 20}, {'u': 10, 'v': 5}, {'u': 10, 'v': 13}, {'u': 10, 'v': 14}, {'u': 2, 'v': 20}, {'u': 12, 'v': 13}, {'u': 12, 'v': 15}, {'u': 13, 'v': 3}, {'u': 13, 'v': 14}, {'u': 13, 'v': 15}, {'u': 13, 'v': 20}, {'u': 14, 'v': 5}, {'u': 5, 'v': 3}], 'source_file': 'wy2010.mtx', 'density': 0.24736842105263157, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0006.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0006.png', 'edge_connectivity': 3}","[1, 3, 11, 12, 14, 16, 18, 20]",8.0,"{'num_nodes': 20, 'num_edges': 47, 'edges': [{'u': 16, 'v': 6}, {'u': 16, 'v': 8}, {'u': 16, 'v': 19}, {'u': 7, 'v': 1}, {'u': 7, 'v': 12}, {'u': 7, 'v': 13}, {'u': 7, 'v': 15}, {'u': 8, 'v': 13}, {'u': 8, 'v': 19}, {'u': 18, 'v': 4}, {'u': 18, 'v': 6}, {'u': 18, 'v': 10}, {'u': 19, 'v': 1}, {'u': 19, 'v': 2}, {'u': 19, 'v': 6}, {'u': 19, 'v': 9}, {'u': 19, 'v': 15}, {'u': 11, 'v': 4}, {'u': 11, 'v': 5}, {'u': 11, 'v': 9}, {'u': 11, 'v': 10}, {'u': 6, 'v': 4}, {'u': 6, 'v': 9}, {'u': 6, 'v': 10}, {'u': 6, 'v': 13}, {'u': 17, 'v': 1}, {'u': 17, 'v': 2}, {'u': 17, 'v': 13}, {'u': 17, 'v': 20}, {'u': 1, 'v': 2}, {'u': 9, 'v': 3}, {'u': 9, 'v': 4}, {'u': 9, 'v': 5}, {'u': 9, 'v': 13}, {'u': 9, 'v': 20}, {'u': 10, 'v': 5}, {'u': 10, 'v': 13}, {'u': 10, 'v': 14}, {'u': 2, 'v': 20}, {'u': 12, 'v': 13}, {'u': 12, 'v': 15}, {'u': 13, 'v': 3}, {'u': 13, 'v': 14}, {'u': 13, 'v': 15}, {'u': 13, 'v': 20}, {'u': 14, 'v': 5}, {'u': 5, 'v': 3}]}","[1, 3, 11, 12, 14, 16, 18, 20]",7,markdown_table,1
MIS,MIS,"On a busy morning the boutique team debated which outfits to put in the window; the rule everyone agreed on was to show as many different garments as possible while avoiding any two chosen items on neighboring hangers. The way to judge a setup is straightforward: count how many garments made it into the window — higher counts are better — and follow the simple ground rules that each chosen hanger shows one unique piece and nothing is doubled. The concrete hanger-by-hanger details are shown below.
There are 20 hangers in total and 41 adjacent hanger pairs.
| hanger_a | hanger_b |
|---|---|
| F | G |
| F | K |
| F | Q |
| R | I |
| R | L |
| J | B |
| J | D |
| J | H |
| J | I |
| J | O |
| J | P |
| H | B |
| H | O |
| B | C |
| B | E |
| B | M |
| B | N |
| B | O |
| B | P |
| B | S |
| B | T |
| K | I |
| K | Q |
| T | M |
| T | N |
| L | A |
| L | I |
| L | O |
| E | N |
| Q | I |
| Q | P |
| O | A |
| O | C |
| O | D |
| O | I |
| O | M |
| I | D |
| I | P |
| S | P |
| M | A |
| P | G |
If you want to send back which hangers make the window, just use this simple JSON shape so everything’s predictable:
{
""solution"": [""hanger_id"", ""hanger_id"", ...]
}
Think of ""solution"" as the list of hangers you picked to display — one entry per hanger, in the same identifier format the instance uses. This JSON is just a sketch of the expected shape, not the actual answer; fill it with the exact hanger identifiers from the instance when you respond.
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': 'MIS', 'num_nodes': 20, 'num_edges': 41, 'edges': [{'u': 6, 'v': 7}, {'u': 6, 'v': 11}, {'u': 6, 'v': 17}, {'u': 18, 'v': 9}, {'u': 18, 'v': 12}, {'u': 10, 'v': 2}, {'u': 10, 'v': 4}, {'u': 10, 'v': 8}, {'u': 10, 'v': 9}, {'u': 10, 'v': 15}, {'u': 10, 'v': 16}, {'u': 8, 'v': 2}, {'u': 8, 'v': 15}, {'u': 2, 'v': 3}, {'u': 2, 'v': 5}, {'u': 2, 'v': 13}, {'u': 2, 'v': 14}, {'u': 2, 'v': 15}, {'u': 2, 'v': 16}, {'u': 2, 'v': 19}, {'u': 2, 'v': 20}, {'u': 11, 'v': 9}, {'u': 11, 'v': 17}, {'u': 20, 'v': 13}, {'u': 20, 'v': 14}, {'u': 12, 'v': 1}, {'u': 12, 'v': 9}, {'u': 12, 'v': 15}, {'u': 5, 'v': 14}, {'u': 17, 'v': 9}, {'u': 17, 'v': 16}, {'u': 15, 'v': 1}, {'u': 15, 'v': 3}, {'u': 15, 'v': 4}, {'u': 15, 'v': 9}, {'u': 15, 'v': 13}, {'u': 9, 'v': 4}, {'u': 9, 'v': 16}, {'u': 19, 'v': 16}, {'u': 13, 'v': 1}, {'u': 16, 'v': 7}], 'source_file': 'wy2010.mtx', 'density': 0.21578947368421053, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0007.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0007.png', 'edge_connectivity': 2}","[1, 3, 4, 5, 7, 8, 11, 18, 19, 20]",10.0,"{'num_nodes': 20, 'num_edges': 41, 'edges': [{'u': 'F', 'v': 'G'}, {'u': 'F', 'v': 'K'}, {'u': 'F', 'v': 'Q'}, {'u': 'R', 'v': 'I'}, {'u': 'R', 'v': 'L'}, {'u': 'J', 'v': 'B'}, {'u': 'J', 'v': 'D'}, {'u': 'J', 'v': 'H'}, {'u': 'J', 'v': 'I'}, {'u': 'J', 'v': 'O'}, {'u': 'J', 'v': 'P'}, {'u': 'H', 'v': 'B'}, {'u': 'H', 'v': 'O'}, {'u': 'B', 'v': 'C'}, {'u': 'B', 'v': 'E'}, {'u': 'B', 'v': 'M'}, {'u': 'B', 'v': 'N'}, {'u': 'B', 'v': 'O'}, {'u': 'B', 'v': 'P'}, {'u': 'B', 'v': 'S'}, {'u': 'B', 'v': 'T'}, {'u': 'K', 'v': 'I'}, {'u': 'K', 'v': 'Q'}, {'u': 'T', 'v': 'M'}, {'u': 'T', 'v': 'N'}, {'u': 'L', 'v': 'A'}, {'u': 'L', 'v': 'I'}, {'u': 'L', 'v': 'O'}, {'u': 'E', 'v': 'N'}, {'u': 'Q', 'v': 'I'}, {'u': 'Q', 'v': 'P'}, {'u': 'O', 'v': 'A'}, {'u': 'O', 'v': 'C'}, {'u': 'O', 'v': 'D'}, {'u': 'O', 'v': 'I'}, {'u': 'O', 'v': 'M'}, {'u': 'I', 'v': 'D'}, {'u': 'I', 'v': 'P'}, {'u': 'S', 'v': 'P'}, {'u': 'M', 'v': 'A'}, {'u': 'P', 'v': 'G'}]}","['A', 'C', 'D', 'E', 'G', 'H', 'K', 'R', 'S', 'T']",8,markdown_table,names
MIS,MIS,"We’ve been asked to schedule bench refurbishments along the waterfront, and the idea is to mark as many benches for work as we can. Plans are judged by how many benches get selected — simply tally the chosen benches, and more is better. One rule: don’t pick a bench that sits next to another picked bench, and every bench can only be chosen once. The concrete details of the promenade are shown below.
There are 24 benches in total and 50 adjacent bench pairs.
| bench_a | bench_b |
|---|---|
| 17 | 1 |
| 17 | 2 |
| 17 | 4 |
| 17 | 5 |
| 19 | 1 |
| 19 | 2 |
| 19 | 3 |
| 19 | 4 |
| 19 | 16 |
| 19 | 23 |
| 6 | 2 |
| 6 | 5 |
| 6 | 8 |
| 6 | 20 |
| 21 | 8 |
| 21 | 9 |
| 21 | 11 |
| 21 | 14 |
| 7 | 3 |
| 7 | 13 |
| 7 | 14 |
| 7 | 23 |
| 20 | 8 |
| 22 | 10 |
| 22 | 12 |
| 22 | 13 |
| 5 | 2 |
| 2 | 1 |
| 2 | 3 |
| 2 | 8 |
| 14 | 3 |
| 14 | 8 |
| 14 | 9 |
| 14 | 10 |
| 14 | 11 |
| 8 | 3 |
| 8 | 15 |
| 8 | 24 |
| 9 | 11 |
| 4 | 16 |
| 4 | 18 |
| 16 | 13 |
| 16 | 23 |
| 11 | 12 |
| 11 | 24 |
| 12 | 10 |
| 24 | 15 |
| 10 | 13 |
| 18 | 13 |
| 3 | 23 |
When you send the plan back, just stick to this simple JSON shape so I can read it automatically:
{
""solution"": [""bench_id"", ""bench_id"", ...]
}
Think of it as a short form: ""solution"" is the list of benches you want refurbished. The strings in the array are the bench identifiers — in the example above I used the placeholder bench_id so it matches the bench story, but in your reply you should list the actual IDs from the instance. This block is just the expected shape, 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': 'MIS', 'num_nodes': 24, 'num_edges': 50, 'edges': [{'u': 17, 'v': 1}, {'u': 17, 'v': 2}, {'u': 17, 'v': 4}, {'u': 17, 'v': 5}, {'u': 19, 'v': 1}, {'u': 19, 'v': 2}, {'u': 19, 'v': 3}, {'u': 19, 'v': 4}, {'u': 19, 'v': 16}, {'u': 19, 'v': 23}, {'u': 6, 'v': 2}, {'u': 6, 'v': 5}, {'u': 6, 'v': 8}, {'u': 6, 'v': 20}, {'u': 21, 'v': 8}, {'u': 21, 'v': 9}, {'u': 21, 'v': 11}, {'u': 21, 'v': 14}, {'u': 7, 'v': 3}, {'u': 7, 'v': 13}, {'u': 7, 'v': 14}, {'u': 7, 'v': 23}, {'u': 20, 'v': 8}, {'u': 22, 'v': 10}, {'u': 22, 'v': 12}, {'u': 22, 'v': 13}, {'u': 5, 'v': 2}, {'u': 2, 'v': 1}, {'u': 2, 'v': 3}, {'u': 2, 'v': 8}, {'u': 14, 'v': 3}, {'u': 14, 'v': 8}, {'u': 14, 'v': 9}, {'u': 14, 'v': 10}, {'u': 14, 'v': 11}, {'u': 8, 'v': 3}, {'u': 8, 'v': 15}, {'u': 8, 'v': 24}, {'u': 9, 'v': 11}, {'u': 4, 'v': 16}, {'u': 4, 'v': 18}, {'u': 16, 'v': 13}, {'u': 16, 'v': 23}, {'u': 11, 'v': 12}, {'u': 11, 'v': 24}, {'u': 12, 'v': 10}, {'u': 24, 'v': 15}, {'u': 10, 'v': 13}, {'u': 18, 'v': 13}, {'u': 3, 'v': 23}], 'source_file': 'wy2010.mtx', 'density': 0.18115942028985507, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0008.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0008.png', 'edge_connectivity': 2}","[1, 3, 5, 9, 12, 15, 16, 18, 20]",9.0,"{'num_nodes': 24, 'num_edges': 50, 'edges': [{'u': 17, 'v': 1}, {'u': 17, 'v': 2}, {'u': 17, 'v': 4}, {'u': 17, 'v': 5}, {'u': 19, 'v': 1}, {'u': 19, 'v': 2}, {'u': 19, 'v': 3}, {'u': 19, 'v': 4}, {'u': 19, 'v': 16}, {'u': 19, 'v': 23}, {'u': 6, 'v': 2}, {'u': 6, 'v': 5}, {'u': 6, 'v': 8}, {'u': 6, 'v': 20}, {'u': 21, 'v': 8}, {'u': 21, 'v': 9}, {'u': 21, 'v': 11}, {'u': 21, 'v': 14}, {'u': 7, 'v': 3}, {'u': 7, 'v': 13}, {'u': 7, 'v': 14}, {'u': 7, 'v': 23}, {'u': 20, 'v': 8}, {'u': 22, 'v': 10}, {'u': 22, 'v': 12}, {'u': 22, 'v': 13}, {'u': 5, 'v': 2}, {'u': 2, 'v': 1}, {'u': 2, 'v': 3}, {'u': 2, 'v': 8}, {'u': 14, 'v': 3}, {'u': 14, 'v': 8}, {'u': 14, 'v': 9}, {'u': 14, 'v': 10}, {'u': 14, 'v': 11}, {'u': 8, 'v': 3}, {'u': 8, 'v': 15}, {'u': 8, 'v': 24}, {'u': 9, 'v': 11}, {'u': 4, 'v': 16}, {'u': 4, 'v': 18}, {'u': 16, 'v': 13}, {'u': 16, 'v': 23}, {'u': 11, 'v': 12}, {'u': 11, 'v': 24}, {'u': 12, 'v': 10}, {'u': 24, 'v': 15}, {'u': 10, 'v': 13}, {'u': 18, 'v': 13}, {'u': 3, 'v': 23}]}","[1, 3, 5, 9, 12, 15, 16, 18, 20]",9,markdown_table,1
MIS,MIS,"I’m the gardener looking after a narrow border of plants and trying to decide which ones to keep. The idea is simple: pick as many plants as possible to stay in the border, and the success is measured by how many plants end up being kept — just count them. The catch is that any two plants that sit next to each other can’t both be kept, because their roots would interfere, and each plant must be either kept or removed (no doubles or half-choices). The exact layout and plant positions will be shown below.
# border_plant_count=19
# adjacent_plant_pairs=30
plant_one_id,plant_two_id
14,6
14,8
14,10
14,17
11,10
12,7
12,15
12,16
13,1
13,2
13,4
13,8
4,0
4,3
4,5
1,7
1,16
1,18
8,0
8,16
2,5
2,18
17,0
17,9
17,10
0,9
15,7
9,3
16,6
6,10
Oh, and when you reply, it helps if you stick to a simple JSON shape so I can read which plants you decided to keep. Something like this will do:
{
""solution"": [""plant_id"", ""plant_id"", ...]
}
""solution"" is just the list of plants to keep in the border — one identifier per plant. Think of those strings as the exact labels from the plant map you'll get with the instance; this block is just a sketch of the expected shape, not your final answer.
Please use the identifiers exactly as they appear in the instance input — no renaming and no inventing 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': 'MIS', 'num_nodes': 19, 'num_edges': 30, 'edges': [{'u': 15, 'v': 7}, {'u': 15, 'v': 9}, {'u': 15, 'v': 11}, {'u': 15, 'v': 18}, {'u': 12, 'v': 11}, {'u': 13, 'v': 8}, {'u': 13, 'v': 16}, {'u': 13, 'v': 17}, {'u': 14, 'v': 2}, {'u': 14, 'v': 3}, {'u': 14, 'v': 5}, {'u': 14, 'v': 9}, {'u': 5, 'v': 1}, {'u': 5, 'v': 4}, {'u': 5, 'v': 6}, {'u': 2, 'v': 8}, {'u': 2, 'v': 17}, {'u': 2, 'v': 19}, {'u': 9, 'v': 1}, {'u': 9, 'v': 17}, {'u': 3, 'v': 6}, {'u': 3, 'v': 19}, {'u': 18, 'v': 1}, {'u': 18, 'v': 10}, {'u': 18, 'v': 11}, {'u': 1, 'v': 10}, {'u': 16, 'v': 8}, {'u': 10, 'v': 4}, {'u': 17, 'v': 7}, {'u': 7, 'v': 11}], 'source_file': 'wv2010.mtx', 'density': 0.17543859649122806, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0009.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0009.png', 'edge_connectivity': 1}","[1, 4, 6, 12, 14, 15, 16, 17, 19]",9.0,"{'num_nodes': 19, 'num_edges': 30, 'edges': [{'u': 14, 'v': 6}, {'u': 14, 'v': 8}, {'u': 14, 'v': 10}, {'u': 14, 'v': 17}, {'u': 11, 'v': 10}, {'u': 12, 'v': 7}, {'u': 12, 'v': 15}, {'u': 12, 'v': 16}, {'u': 13, 'v': 1}, {'u': 13, 'v': 2}, {'u': 13, 'v': 4}, {'u': 13, 'v': 8}, {'u': 4, 'v': 0}, {'u': 4, 'v': 3}, {'u': 4, 'v': 5}, {'u': 1, 'v': 7}, {'u': 1, 'v': 16}, {'u': 1, 'v': 18}, {'u': 8, 'v': 0}, {'u': 8, 'v': 16}, {'u': 2, 'v': 5}, {'u': 2, 'v': 18}, {'u': 17, 'v': 0}, {'u': 17, 'v': 9}, {'u': 17, 'v': 10}, {'u': 0, 'v': 9}, {'u': 15, 'v': 7}, {'u': 9, 'v': 3}, {'u': 16, 'v': 6}, {'u': 6, 'v': 10}]}","[0, 3, 5, 11, 13, 14, 15, 16, 18]",10,csv,0
MIS,MIS,"I’m running the festival lineup this year and need to pick which street performers get spots along the parade route so the crowd always has music without shows bumping into each other. The decision is which spots to fill so no two occupied spots sit next to one another, and the aim is to have as many performers as possible — success is just the total number of acts booked, counted by how many spots end up filled. Each spot can hold at most one act and no performer gets booked twice; the specific route and spots will be shown below.
# total_spots_on_route=24
# total_adjacent_spot_pairs=48
adjacent_spot_u,adjacent_spot_v
P,C
P,D
P,R
T,A
T,H
T,L
T,N
T,O
Q,D
Q,F
Q,K
Q,X
R,B
R,D
R,E
R,N
R,U
U,G
U,H
U,N
L,A
V,C
V,X
N,C
N,H
O,A
O,E
O,G
O,H
E,A
E,B
E,G
E,K
E,S
H,G
F,D
F,K
F,M
F,S
I,K
S,D
S,K
S,M
M,D
A,J
A,W
B,D
D,X
If you want to hand me the picks, an easy way is to return a tiny JSON snippet like this so I can parse it quickly:
{
""solution"": [""spot_id"", ""spot_id"", ...]
}
This just means ""solution"" should be a list of the spot identifiers you've picked for performers along the route. Think of it like filling out a short form: each entry is the exact spot ID for a booked act. This is only a sketch of the expected shape, not the actual answer you should submit.
Please use the 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': 'MIS', 'num_nodes': 24, 'num_edges': 48, 'edges': [{'u': 16, 'v': 3}, {'u': 16, 'v': 4}, {'u': 16, 'v': 18}, {'u': 20, 'v': 1}, {'u': 20, 'v': 8}, {'u': 20, 'v': 12}, {'u': 20, 'v': 14}, {'u': 20, 'v': 15}, {'u': 17, 'v': 4}, {'u': 17, 'v': 6}, {'u': 17, 'v': 11}, {'u': 17, 'v': 24}, {'u': 18, 'v': 2}, {'u': 18, 'v': 4}, {'u': 18, 'v': 5}, {'u': 18, 'v': 14}, {'u': 18, 'v': 21}, {'u': 21, 'v': 7}, {'u': 21, 'v': 8}, {'u': 21, 'v': 14}, {'u': 12, 'v': 1}, {'u': 22, 'v': 3}, {'u': 22, 'v': 24}, {'u': 14, 'v': 3}, {'u': 14, 'v': 8}, {'u': 15, 'v': 1}, {'u': 15, 'v': 5}, {'u': 15, 'v': 7}, {'u': 15, 'v': 8}, {'u': 5, 'v': 1}, {'u': 5, 'v': 2}, {'u': 5, 'v': 7}, {'u': 5, 'v': 11}, {'u': 5, 'v': 19}, {'u': 8, 'v': 7}, {'u': 6, 'v': 4}, {'u': 6, 'v': 11}, {'u': 6, 'v': 13}, {'u': 6, 'v': 19}, {'u': 9, 'v': 11}, {'u': 19, 'v': 4}, {'u': 19, 'v': 11}, {'u': 19, 'v': 13}, {'u': 13, 'v': 4}, {'u': 1, 'v': 10}, {'u': 1, 'v': 23}, {'u': 2, 'v': 4}, {'u': 4, 'v': 24}], 'source_file': 'vt2010.mtx', 'density': 0.17391304347826086, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0010.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0010.png', 'edge_connectivity': 1}","[2, 9, 10, 12, 13, 15, 16, 17, 21, 22, 23]",11.0,"{'num_nodes': 24, 'num_edges': 48, 'edges': [{'u': 'P', 'v': 'C'}, {'u': 'P', 'v': 'D'}, {'u': 'P', 'v': 'R'}, {'u': 'T', 'v': 'A'}, {'u': 'T', 'v': 'H'}, {'u': 'T', 'v': 'L'}, {'u': 'T', 'v': 'N'}, {'u': 'T', 'v': 'O'}, {'u': 'Q', 'v': 'D'}, {'u': 'Q', 'v': 'F'}, {'u': 'Q', 'v': 'K'}, {'u': 'Q', 'v': 'X'}, {'u': 'R', 'v': 'B'}, {'u': 'R', 'v': 'D'}, {'u': 'R', 'v': 'E'}, {'u': 'R', 'v': 'N'}, {'u': 'R', 'v': 'U'}, {'u': 'U', 'v': 'G'}, {'u': 'U', 'v': 'H'}, {'u': 'U', 'v': 'N'}, {'u': 'L', 'v': 'A'}, {'u': 'V', 'v': 'C'}, {'u': 'V', 'v': 'X'}, {'u': 'N', 'v': 'C'}, {'u': 'N', 'v': 'H'}, {'u': 'O', 'v': 'A'}, {'u': 'O', 'v': 'E'}, {'u': 'O', 'v': 'G'}, {'u': 'O', 'v': 'H'}, {'u': 'E', 'v': 'A'}, {'u': 'E', 'v': 'B'}, {'u': 'E', 'v': 'G'}, {'u': 'E', 'v': 'K'}, {'u': 'E', 'v': 'S'}, {'u': 'H', 'v': 'G'}, {'u': 'F', 'v': 'D'}, {'u': 'F', 'v': 'K'}, {'u': 'F', 'v': 'M'}, {'u': 'F', 'v': 'S'}, {'u': 'I', 'v': 'K'}, {'u': 'S', 'v': 'D'}, {'u': 'S', 'v': 'K'}, {'u': 'S', 'v': 'M'}, {'u': 'M', 'v': 'D'}, {'u': 'A', 'v': 'J'}, {'u': 'A', 'v': 'W'}, {'u': 'B', 'v': 'D'}, {'u': 'D', 'v': 'X'}]}","['B', 'I', 'J', 'L', 'M', 'O', 'P', 'Q', 'U', 'V', 'W']",11,csv,names
MIS,MIS,"We’re planning a private event and want to cordon off as many tables as possible, while making sure any two tables we mark off aren’t side-by-side. What matters is the total number of tables held for the event — the more, the better — so each possible setup is judged by simply counting how many tables got reserved. Each table can only be in or out (no duplicates or half-reservations), and neighboring tables can’t both be selected. The specific floor plan will be shown below.
There are 24 tables in total and 48 adjacent pairs.
| adjacent_table_1 | adjacent_table_2 |
|---|---|
| E | O |
| E | P |
| I | B |
| I | T |
| I | V |
| I | W |
| J | P |
| J | U |
| J | W |
| J | X |
| K | C |
| K | Q |
| Q | C |
| Q | P |
| B | T |
| B | U |
| B | V |
| B | W |
| F | P |
| F | W |
| G | C |
| G | W |
| H | D |
| H | R |
| H | W |
| N | P |
| M | P |
| R | D |
| R | P |
| R | W |
| V | A |
| V | C |
| V | W |
| W | C |
| W | D |
| W | L |
| W | P |
| W | S |
| W | T |
| W | U |
| S | C |
| S | L |
| S | P |
| C | A |
| C | P |
| X | P |
| O | P |
| P | L |
When you send your answer back, just drop it into a tiny JSON object like this so it's easy to read and process:
{
""solution"": [""table_id"", ""table_id"", ...]
}
Pretty straightforward — ""solution"" is just the list of tables you're reserving for the event. Think of each ""table_id"" as a placeholder for whatever label appears on the floor plan (I'll replace those with the actual labels when I submit the final selection). This JSON is just 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 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': 'MIS', 'num_nodes': 24, 'num_edges': 48, 'edges': [{'u': 5, 'v': 15}, {'u': 5, 'v': 16}, {'u': 9, 'v': 2}, {'u': 9, 'v': 20}, {'u': 9, 'v': 22}, {'u': 9, 'v': 23}, {'u': 10, 'v': 16}, {'u': 10, 'v': 21}, {'u': 10, 'v': 23}, {'u': 10, 'v': 24}, {'u': 11, 'v': 3}, {'u': 11, 'v': 17}, {'u': 17, 'v': 3}, {'u': 17, 'v': 16}, {'u': 2, 'v': 20}, {'u': 2, 'v': 21}, {'u': 2, 'v': 22}, {'u': 2, 'v': 23}, {'u': 6, 'v': 16}, {'u': 6, 'v': 23}, {'u': 7, 'v': 3}, {'u': 7, 'v': 23}, {'u': 8, 'v': 4}, {'u': 8, 'v': 18}, {'u': 8, 'v': 23}, {'u': 14, 'v': 16}, {'u': 13, 'v': 16}, {'u': 18, 'v': 4}, {'u': 18, 'v': 16}, {'u': 18, 'v': 23}, {'u': 22, 'v': 1}, {'u': 22, 'v': 3}, {'u': 22, 'v': 23}, {'u': 23, 'v': 3}, {'u': 23, 'v': 4}, {'u': 23, 'v': 12}, {'u': 23, 'v': 16}, {'u': 23, 'v': 19}, {'u': 23, 'v': 20}, {'u': 23, 'v': 21}, {'u': 19, 'v': 3}, {'u': 19, 'v': 12}, {'u': 19, 'v': 16}, {'u': 3, 'v': 1}, {'u': 3, 'v': 16}, {'u': 24, 'v': 16}, {'u': 15, 'v': 16}, {'u': 16, 'v': 12}], 'source_file': 'wa2010.mtx', 'density': 0.17391304347826086, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0011.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0011.png', 'edge_connectivity': 1}","[1, 4, 6, 7, 11, 12, 13, 14, 15, 20, 21, 24]",12.0,"{'num_nodes': 24, 'num_edges': 48, 'edges': [{'u': 'E', 'v': 'O'}, {'u': 'E', 'v': 'P'}, {'u': 'I', 'v': 'B'}, {'u': 'I', 'v': 'T'}, {'u': 'I', 'v': 'V'}, {'u': 'I', 'v': 'W'}, {'u': 'J', 'v': 'P'}, {'u': 'J', 'v': 'U'}, {'u': 'J', 'v': 'W'}, {'u': 'J', 'v': 'X'}, {'u': 'K', 'v': 'C'}, {'u': 'K', 'v': 'Q'}, {'u': 'Q', 'v': 'C'}, {'u': 'Q', 'v': 'P'}, {'u': 'B', 'v': 'T'}, {'u': 'B', 'v': 'U'}, {'u': 'B', 'v': 'V'}, {'u': 'B', 'v': 'W'}, {'u': 'F', 'v': 'P'}, {'u': 'F', 'v': 'W'}, {'u': 'G', 'v': 'C'}, {'u': 'G', 'v': 'W'}, {'u': 'H', 'v': 'D'}, {'u': 'H', 'v': 'R'}, {'u': 'H', 'v': 'W'}, {'u': 'N', 'v': 'P'}, {'u': 'M', 'v': 'P'}, {'u': 'R', 'v': 'D'}, {'u': 'R', 'v': 'P'}, {'u': 'R', 'v': 'W'}, {'u': 'V', 'v': 'A'}, {'u': 'V', 'v': 'C'}, {'u': 'V', 'v': 'W'}, {'u': 'W', 'v': 'C'}, {'u': 'W', 'v': 'D'}, {'u': 'W', 'v': 'L'}, {'u': 'W', 'v': 'P'}, {'u': 'W', 'v': 'S'}, {'u': 'W', 'v': 'T'}, {'u': 'W', 'v': 'U'}, {'u': 'S', 'v': 'C'}, {'u': 'S', 'v': 'L'}, {'u': 'S', 'v': 'P'}, {'u': 'C', 'v': 'A'}, {'u': 'C', 'v': 'P'}, {'u': 'X', 'v': 'P'}, {'u': 'O', 'v': 'P'}, {'u': 'P', 'v': 'L'}]}","['A', 'D', 'F', 'G', 'K', 'L', 'M', 'N', 'O', 'T', 'U', 'X']",12,markdown_table,names
MIS,MIS,"At the museum the registrar faces a packing rule: if an artifact is taken from one compartment, items in compartments directly next to it must stay behind. The job is to choose artifacts so the traveling case ends up holding as many separate objects as possible — success is just counting how many distinct artifacts were selected — and no item can be doubled up or partially selected. The exact layout and items are shown below.
{
""total_compartments"": 23,
""total_adjacent_pairs"": 46,
""edges"": [
{
""compartment_u"": 17,
""compartment_v"": 6
},
{
""compartment_u"": 17,
""compartment_v"": 15
},
{
""compartment_u"": 17,
""compartment_v"": 20
},
{
""compartment_u"": 17,
""compartment_v"": 22
},
{
""compartment_u"": 3,
""compartment_v"": 0
},
{
""compartment_u"": 3,
""compartment_v"": 2
},
{
""compartment_u"": 3,
""compartment_v"": 11
},
{
""compartment_u"": 3,
""compartment_v"": 16
},
{
""compartment_u"": 3,
""compartment_v"": 18
},
{
""compartment_u"": 15,
""compartment_v"": 6
},
{
""compartment_u"": 15,
""compartment_v"": 10
},
{
""compartment_u"": 15,
""compartment_v"": 14
},
{
""compartment_u"": 15,
""compartment_v"": 20
},
{
""compartment_u"": 15,
""compartment_v"": 22
},
{
""compartment_u"": 4,
""compartment_v"": 0
},
{
""compartment_u"": 4,
""compartment_v"": 9
},
{
""compartment_u"": 4,
""compartment_v"": 13
},
{
""compartment_u"": 4,
""compartment_v"": 19
},
{
""compartment_u"": 21,
""compartment_v"": 0
},
{
""compartment_u"": 21,
""compartment_v"": 7
},
{
""compartment_u"": 21,
""compartment_v"": 11
},
{
""compartment_u"": 21,
""compartment_v"": 14
},
{
""compartment_u"": 16,
""compartment_v"": 11
},
{
""compartment_u"": 22,
""compartment_v"": 20
},
{
""compartment_u"": 13,
""compartment_v"": 0
},
{
""compartment_u"": 13,
""compartment_v"": 14
},
{
""compartment_u"": 2,
""compartment_v"": 0
},
{
""compartment_u"": 2,
""compartment_v"": 1
},
{
""compartment_u"": 2,
""compartment_v"": 9
},
{
""compartment_u"": 18,
""compartment_v"": 1
},
{
""compartment_u"": 14,
""compartment_v"": 7
},
{
""compartment_u"": 14,
""compartment_v"": 10
},
{
""compartment_u"": 14,
""compartment_v"": 12
},
{
""compartment_u"": 14,
""compartment_v"": 19
},
{
""compartment_u"": 14,
""compartment_v"": 20
},
{
""compartment_u"": 10,
""compartment_v"": 11
},
{
""compartment_u"": 11,
""compartment_v"": 5
},
{
""compartment_u"": 11,
""compartment_v"": 6
},
{
""compartment_u"": 12,
""compartment_v"": 8
},
{
""compartment_u"": 12,
""compartment_v"": 19
},
{
""compartment_u"": 12,
""compartment_v"": 20
},
{
""compartment_u"": 9,
""compartment_v"": 8
},
{
""compartment_u"": 6,
""compartment_v"": 5
},
{
""compartment_u"": 7,
""compartment_v"": 0
},
{
""compartment_u"": 8,
""compartment_v"": 19
},
{
""compartment_u"": 8,
""compartment_v"": 20
}
]
}
Oh — and when you send back which artifacts to take, please use this little JSON shape so it's easy to read:
{
""solution"": [""compartment_id"", ""compartment_id"", ...]
}
Think of ""solution"" as just a list of the compartment IDs you picked — one entry for each artifact that goes into the traveling case. This is just a sketch of the shape I expect, not the actual answer itself.
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': 'MIS', 'num_nodes': 23, 'num_edges': 46, 'edges': [{'u': 18, 'v': 7}, {'u': 18, 'v': 16}, {'u': 18, 'v': 21}, {'u': 18, 'v': 23}, {'u': 4, 'v': 1}, {'u': 4, 'v': 3}, {'u': 4, 'v': 12}, {'u': 4, 'v': 17}, {'u': 4, 'v': 19}, {'u': 16, 'v': 7}, {'u': 16, 'v': 11}, {'u': 16, 'v': 15}, {'u': 16, 'v': 21}, {'u': 16, 'v': 23}, {'u': 5, 'v': 1}, {'u': 5, 'v': 10}, {'u': 5, 'v': 14}, {'u': 5, 'v': 20}, {'u': 22, 'v': 1}, {'u': 22, 'v': 8}, {'u': 22, 'v': 12}, {'u': 22, 'v': 15}, {'u': 17, 'v': 12}, {'u': 23, 'v': 21}, {'u': 14, 'v': 1}, {'u': 14, 'v': 15}, {'u': 3, 'v': 1}, {'u': 3, 'v': 2}, {'u': 3, 'v': 10}, {'u': 19, 'v': 2}, {'u': 15, 'v': 8}, {'u': 15, 'v': 11}, {'u': 15, 'v': 13}, {'u': 15, 'v': 20}, {'u': 15, 'v': 21}, {'u': 11, 'v': 12}, {'u': 12, 'v': 6}, {'u': 12, 'v': 7}, {'u': 13, 'v': 9}, {'u': 13, 'v': 20}, {'u': 13, 'v': 21}, {'u': 10, 'v': 9}, {'u': 7, 'v': 6}, {'u': 8, 'v': 1}, {'u': 9, 'v': 20}, {'u': 9, 'v': 21}], 'source_file': 'wi2010.mtx', 'density': 0.18181818181818182, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0012.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0012.png', 'edge_connectivity': 2}","[3, 6, 8, 11, 13, 14, 17, 19, 23]",9.0,"{'num_nodes': 23, 'num_edges': 46, 'edges': [{'u': 17, 'v': 6}, {'u': 17, 'v': 15}, {'u': 17, 'v': 20}, {'u': 17, 'v': 22}, {'u': 3, 'v': 0}, {'u': 3, 'v': 2}, {'u': 3, 'v': 11}, {'u': 3, 'v': 16}, {'u': 3, 'v': 18}, {'u': 15, 'v': 6}, {'u': 15, 'v': 10}, {'u': 15, 'v': 14}, {'u': 15, 'v': 20}, {'u': 15, 'v': 22}, {'u': 4, 'v': 0}, {'u': 4, 'v': 9}, {'u': 4, 'v': 13}, {'u': 4, 'v': 19}, {'u': 21, 'v': 0}, {'u': 21, 'v': 7}, {'u': 21, 'v': 11}, {'u': 21, 'v': 14}, {'u': 16, 'v': 11}, {'u': 22, 'v': 20}, {'u': 13, 'v': 0}, {'u': 13, 'v': 14}, {'u': 2, 'v': 0}, {'u': 2, 'v': 1}, {'u': 2, 'v': 9}, {'u': 18, 'v': 1}, {'u': 14, 'v': 7}, {'u': 14, 'v': 10}, {'u': 14, 'v': 12}, {'u': 14, 'v': 19}, {'u': 14, 'v': 20}, {'u': 10, 'v': 11}, {'u': 11, 'v': 5}, {'u': 11, 'v': 6}, {'u': 12, 'v': 8}, {'u': 12, 'v': 19}, {'u': 12, 'v': 20}, {'u': 9, 'v': 8}, {'u': 6, 'v': 5}, {'u': 7, 'v': 0}, {'u': 8, 'v': 19}, {'u': 8, 'v': 20}]}","[2, 5, 7, 10, 12, 13, 16, 18, 22]",13,json,0
MIS,MIS,"Recently the venue switched consoles and the new rule is to light up as many microphones as possible for a show, but never two that have direct crosstalk between them. The goal is to maximize the number of mics in use — you measure this by simply counting active channels — while making sure no interfering pair is turned on together. Every channel is a single, indivisible choice (on or off) and can’t be counted twice. The detailed diagram of channel interference is provided below.
# total_mic_channels=19
# total_crosstalk_pairs=39
mic_channel_u,mic_channel_v
7,1
7,4
7,13
7,16
7,17
8,6
8,10
8,11
8,14
8,16
8,18
11,14
6,2
6,10
6,16
6,18
9,0
9,5
9,15
13,1
13,16
14,3
14,4
14,16
18,2
4,1
4,3
0,5
0,12
0,15
0,16
10,16
12,2
12,5
12,16
17,16
2,16
16,15
3,1
Oh, and when you send the final set of channels, please use this simple JSON shape so it’s easy to read and parse:
{
""solution"": [""mic_id"", ""mic_id"", ...]
}
Think of that as a little form: ""solution"" is the list of microphones you want turned on (each entry is one channel identifier). The placeholders are just examples showing the shape — you’ll replace them with the actual channel IDs from the instance when you answer.
Please don’t rename or invent any labels — use the identifiers exactly as they appear in the instance input, no changes.
- 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”.""
Again, the JSON above is just a sketch of the expected shape, not the real answer.","{'problem_type': 'MIS', 'num_nodes': 19, 'num_edges': 39, 'edges': [{'u': 8, 'v': 2}, {'u': 8, 'v': 5}, {'u': 8, 'v': 14}, {'u': 8, 'v': 17}, {'u': 8, 'v': 18}, {'u': 9, 'v': 7}, {'u': 9, 'v': 11}, {'u': 9, 'v': 12}, {'u': 9, 'v': 15}, {'u': 9, 'v': 17}, {'u': 9, 'v': 19}, {'u': 12, 'v': 15}, {'u': 7, 'v': 3}, {'u': 7, 'v': 11}, {'u': 7, 'v': 17}, {'u': 7, 'v': 19}, {'u': 10, 'v': 1}, {'u': 10, 'v': 6}, {'u': 10, 'v': 16}, {'u': 14, 'v': 2}, {'u': 14, 'v': 17}, {'u': 15, 'v': 4}, {'u': 15, 'v': 5}, {'u': 15, 'v': 17}, {'u': 19, 'v': 3}, {'u': 5, 'v': 2}, {'u': 5, 'v': 4}, {'u': 1, 'v': 6}, {'u': 1, 'v': 13}, {'u': 1, 'v': 16}, {'u': 1, 'v': 17}, {'u': 11, 'v': 17}, {'u': 13, 'v': 3}, {'u': 13, 'v': 6}, {'u': 13, 'v': 17}, {'u': 18, 'v': 17}, {'u': 3, 'v': 17}, {'u': 17, 'v': 16}, {'u': 4, 'v': 2}], 'source_file': 'wa2010.mtx', 'density': 0.22807017543859648, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0013.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0013.png', 'edge_connectivity': 2}","[4, 11, 12, 13, 14, 16, 18, 19]",8.0,"{'num_nodes': 19, 'num_edges': 39, 'edges': [{'u': 7, 'v': 1}, {'u': 7, 'v': 4}, {'u': 7, 'v': 13}, {'u': 7, 'v': 16}, {'u': 7, 'v': 17}, {'u': 8, 'v': 6}, {'u': 8, 'v': 10}, {'u': 8, 'v': 11}, {'u': 8, 'v': 14}, {'u': 8, 'v': 16}, {'u': 8, 'v': 18}, {'u': 11, 'v': 14}, {'u': 6, 'v': 2}, {'u': 6, 'v': 10}, {'u': 6, 'v': 16}, {'u': 6, 'v': 18}, {'u': 9, 'v': 0}, {'u': 9, 'v': 5}, {'u': 9, 'v': 15}, {'u': 13, 'v': 1}, {'u': 13, 'v': 16}, {'u': 14, 'v': 3}, {'u': 14, 'v': 4}, {'u': 14, 'v': 16}, {'u': 18, 'v': 2}, {'u': 4, 'v': 1}, {'u': 4, 'v': 3}, {'u': 0, 'v': 5}, {'u': 0, 'v': 12}, {'u': 0, 'v': 15}, {'u': 0, 'v': 16}, {'u': 10, 'v': 16}, {'u': 12, 'v': 2}, {'u': 12, 'v': 5}, {'u': 12, 'v': 16}, {'u': 17, 'v': 16}, {'u': 2, 'v': 16}, {'u': 16, 'v': 15}, {'u': 3, 'v': 1}]}","[3, 10, 11, 12, 13, 15, 17, 18]",14,csv,0
MIS,MIS,"Many people want to use the communal bike racks, and the person running the place has to pick a group of bikes that will actually fit without crowding. The rule we follow is that no two bikes we allow can occupy adjacent rack slots, so approvals need spacing. Better decisions are those that let the greatest number of bikes in; to figure that out, just count how many bikes would be parked under each selection. Nothing is double-booked and every slot holds at most one bike. The concrete rack layout and bike details appear below.
There are 23 rack slots in total and 49 adjacent pairs.
| slot_u | slot_v |
|---|---|
| I | H |
| I | R |
| I | V |
| W | F |
| W | J |
| W | T |
| W | V |
| V | C |
| V | D |
| V | E |
| V | F |
| V | G |
| V | H |
| V | N |
| V | O |
| V | Q |
| V | R |
| V | S |
| V | T |
| E | F |
| E | Q |
| T | G |
| T | J |
| T | K |
| T | S |
| T | U |
| U | O |
| U | S |
| R | A |
| R | H |
| R | M |
| F | Q |
| H | C |
| H | M |
| O | A |
| O | B |
| O | D |
| O | K |
| O | L |
| O | S |
| P | B |
| P | K |
| Q | C |
| Q | J |
| Q | N |
| B | A |
| B | K |
| S | D |
| A | L |
Also, when you hand back the chosen slots, please follow this little JSON sketch so it's easy to read by whoever's checking:
{
""solution"": [""slot_id"", ""slot_id"", ...]
}
This just means ""solution"" is the list of rack slots you're approving for bikes — each entry is a slot identifier from the instance (the slots that get to park). Think of it as filling out a tiny form: put each approved slot's id into that array. It's just a sketch of the expected shape, not the actual answer.
Please make sure to use the exact identifiers 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': 'MIS', 'num_nodes': 23, 'num_edges': 49, 'edges': [{'u': 9, 'v': 8}, {'u': 9, 'v': 18}, {'u': 9, 'v': 22}, {'u': 23, 'v': 6}, {'u': 23, 'v': 10}, {'u': 23, 'v': 20}, {'u': 23, 'v': 22}, {'u': 22, 'v': 3}, {'u': 22, 'v': 4}, {'u': 22, 'v': 5}, {'u': 22, 'v': 6}, {'u': 22, 'v': 7}, {'u': 22, 'v': 8}, {'u': 22, 'v': 14}, {'u': 22, 'v': 15}, {'u': 22, 'v': 17}, {'u': 22, 'v': 18}, {'u': 22, 'v': 19}, {'u': 22, 'v': 20}, {'u': 5, 'v': 6}, {'u': 5, 'v': 17}, {'u': 20, 'v': 7}, {'u': 20, 'v': 10}, {'u': 20, 'v': 11}, {'u': 20, 'v': 19}, {'u': 20, 'v': 21}, {'u': 21, 'v': 15}, {'u': 21, 'v': 19}, {'u': 18, 'v': 1}, {'u': 18, 'v': 8}, {'u': 18, 'v': 13}, {'u': 6, 'v': 17}, {'u': 8, 'v': 3}, {'u': 8, 'v': 13}, {'u': 15, 'v': 1}, {'u': 15, 'v': 2}, {'u': 15, 'v': 4}, {'u': 15, 'v': 11}, {'u': 15, 'v': 12}, {'u': 15, 'v': 19}, {'u': 16, 'v': 2}, {'u': 16, 'v': 11}, {'u': 17, 'v': 3}, {'u': 17, 'v': 10}, {'u': 17, 'v': 14}, {'u': 2, 'v': 1}, {'u': 2, 'v': 11}, {'u': 19, 'v': 4}, {'u': 1, 'v': 12}], 'source_file': 'vt2010.mtx', 'density': 0.19367588932806323, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0014.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0014.png', 'edge_connectivity': 2}","[3, 4, 5, 7, 9, 12, 13, 14, 16, 21, 23]",11.0,"{'num_nodes': 23, 'num_edges': 49, 'edges': [{'u': 'I', 'v': 'H'}, {'u': 'I', 'v': 'R'}, {'u': 'I', 'v': 'V'}, {'u': 'W', 'v': 'F'}, {'u': 'W', 'v': 'J'}, {'u': 'W', 'v': 'T'}, {'u': 'W', 'v': 'V'}, {'u': 'V', 'v': 'C'}, {'u': 'V', 'v': 'D'}, {'u': 'V', 'v': 'E'}, {'u': 'V', 'v': 'F'}, {'u': 'V', 'v': 'G'}, {'u': 'V', 'v': 'H'}, {'u': 'V', 'v': 'N'}, {'u': 'V', 'v': 'O'}, {'u': 'V', 'v': 'Q'}, {'u': 'V', 'v': 'R'}, {'u': 'V', 'v': 'S'}, {'u': 'V', 'v': 'T'}, {'u': 'E', 'v': 'F'}, {'u': 'E', 'v': 'Q'}, {'u': 'T', 'v': 'G'}, {'u': 'T', 'v': 'J'}, {'u': 'T', 'v': 'K'}, {'u': 'T', 'v': 'S'}, {'u': 'T', 'v': 'U'}, {'u': 'U', 'v': 'O'}, {'u': 'U', 'v': 'S'}, {'u': 'R', 'v': 'A'}, {'u': 'R', 'v': 'H'}, {'u': 'R', 'v': 'M'}, {'u': 'F', 'v': 'Q'}, {'u': 'H', 'v': 'C'}, {'u': 'H', 'v': 'M'}, {'u': 'O', 'v': 'A'}, {'u': 'O', 'v': 'B'}, {'u': 'O', 'v': 'D'}, {'u': 'O', 'v': 'K'}, {'u': 'O', 'v': 'L'}, {'u': 'O', 'v': 'S'}, {'u': 'P', 'v': 'B'}, {'u': 'P', 'v': 'K'}, {'u': 'Q', 'v': 'C'}, {'u': 'Q', 'v': 'J'}, {'u': 'Q', 'v': 'N'}, {'u': 'B', 'v': 'A'}, {'u': 'B', 'v': 'K'}, {'u': 'S', 'v': 'D'}, {'u': 'A', 'v': 'L'}]}","['C', 'D', 'E', 'G', 'I', 'L', 'M', 'N', 'P', 'U', 'W']",15,markdown_table,names
MIS,MIS,"On a late afternoon the ranger is figuring out which campsites to leave available; the idea is to keep as many as possible but never two that are next to each other. The quality of the plan is simply the number of sites kept open, counted at the end, and each campsite must be decided once (open or closed) with the restriction that no neighboring sites are both open. The campsite specifics and layout are shown below.
{
""total_campsites"": 22,
""num_adjacent_pairs"": 42,
""edges"": [
{
""campsite_a"": 21,
""campsite_b"": 1
},
{
""campsite_a"": 21,
""campsite_b"": 6
},
{
""campsite_a"": 21,
""campsite_b"": 8
},
{
""campsite_a"": 16,
""campsite_b"": 1
},
{
""campsite_a"": 17,
""campsite_b"": 5
},
{
""campsite_a"": 17,
""campsite_b"": 13
},
{
""campsite_a"": 17,
""campsite_b"": 15
},
{
""campsite_a"": 17,
""campsite_b"": 18
},
{
""campsite_a"": 18,
""campsite_b"": 3
},
{
""campsite_a"": 18,
""campsite_b"": 13
},
{
""campsite_a"": 18,
""campsite_b"": 14
},
{
""campsite_a"": 18,
""campsite_b"": 15
},
{
""campsite_a"": 18,
""campsite_b"": 19
},
{
""campsite_a"": 19,
""campsite_b"": 3
},
{
""campsite_a"": 19,
""campsite_b"": 14
},
{
""campsite_a"": 20,
""campsite_b"": 0
},
{
""campsite_a"": 20,
""campsite_b"": 7
},
{
""campsite_a"": 20,
""campsite_b"": 14
},
{
""campsite_a"": 0,
""campsite_b"": 1
},
{
""campsite_a"": 0,
""campsite_b"": 8
},
{
""campsite_a"": 0,
""campsite_b"": 12
},
{
""campsite_a"": 1,
""campsite_b"": 6
},
{
""campsite_a"": 1,
""campsite_b"": 10
},
{
""campsite_a"": 7,
""campsite_b"": 10
},
{
""campsite_a"": 7,
""campsite_b"": 12
},
{
""campsite_a"": 13,
""campsite_b"": 3
},
{
""campsite_a"": 13,
""campsite_b"": 4
},
{
""campsite_a"": 13,
""campsite_b"": 5
},
{
""campsite_a"": 13,
""campsite_b"": 6
},
{
""campsite_a"": 14,
""campsite_b"": 2
},
{
""campsite_a"": 14,
""campsite_b"": 8
},
{
""campsite_a"": 14,
""campsite_b"": 9
},
{
""campsite_a"": 14,
""campsite_b"": 11
},
{
""campsite_a"": 8,
""campsite_b"": 4
},
{
""campsite_a"": 8,
""campsite_b"": 9
},
{
""campsite_a"": 9,
""campsite_b"": 3
},
{
""campsite_a"": 10,
""campsite_b"": 12
},
{
""campsite_a"": 2,
""campsite_b"": 15
},
{
""campsite_a"": 3,
""campsite_b"": 4
},
{
""campsite_a"": 4,
""campsite_b"": 6
},
{
""campsite_a"": 15,
""campsite_b"": 5
},
{
""campsite_a"": 5,
""campsite_b"": 6
}
]
}
Also, just so everything is easy to parse, please return the chosen open campsites using this simple JSON shape:
{
""solution"": [""site_id"", ""site_id"", ...]
}
""solution"" is just a list of the campsite IDs you'd like to leave open — one string per site. Think of the placeholders above as examples of the format, not the actual choices.
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': 'MIS', 'num_nodes': 22, 'num_edges': 42, 'edges': [{'u': 22, 'v': 2}, {'u': 22, 'v': 7}, {'u': 22, 'v': 9}, {'u': 17, 'v': 2}, {'u': 18, 'v': 6}, {'u': 18, 'v': 14}, {'u': 18, 'v': 16}, {'u': 18, 'v': 19}, {'u': 19, 'v': 4}, {'u': 19, 'v': 14}, {'u': 19, 'v': 15}, {'u': 19, 'v': 16}, {'u': 19, 'v': 20}, {'u': 20, 'v': 4}, {'u': 20, 'v': 15}, {'u': 21, 'v': 1}, {'u': 21, 'v': 8}, {'u': 21, 'v': 15}, {'u': 1, 'v': 2}, {'u': 1, 'v': 9}, {'u': 1, 'v': 13}, {'u': 2, 'v': 7}, {'u': 2, 'v': 11}, {'u': 8, 'v': 11}, {'u': 8, 'v': 13}, {'u': 14, 'v': 4}, {'u': 14, 'v': 5}, {'u': 14, 'v': 6}, {'u': 14, 'v': 7}, {'u': 15, 'v': 3}, {'u': 15, 'v': 9}, {'u': 15, 'v': 10}, {'u': 15, 'v': 12}, {'u': 9, 'v': 5}, {'u': 9, 'v': 10}, {'u': 10, 'v': 4}, {'u': 11, 'v': 13}, {'u': 3, 'v': 16}, {'u': 4, 'v': 5}, {'u': 5, 'v': 7}, {'u': 16, 'v': 6}, {'u': 6, 'v': 7}], 'source_file': 'vt2010.mtx', 'density': 0.18181818181818182, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0015.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0015.png', 'edge_connectivity': 1}","[3, 5, 10, 11, 12, 17, 18, 20, 21, 22]",10.0,"{'num_nodes': 22, 'num_edges': 42, 'edges': [{'u': 21, 'v': 1}, {'u': 21, 'v': 6}, {'u': 21, 'v': 8}, {'u': 16, 'v': 1}, {'u': 17, 'v': 5}, {'u': 17, 'v': 13}, {'u': 17, 'v': 15}, {'u': 17, 'v': 18}, {'u': 18, 'v': 3}, {'u': 18, 'v': 13}, {'u': 18, 'v': 14}, {'u': 18, 'v': 15}, {'u': 18, 'v': 19}, {'u': 19, 'v': 3}, {'u': 19, 'v': 14}, {'u': 20, 'v': 0}, {'u': 20, 'v': 7}, {'u': 20, 'v': 14}, {'u': 0, 'v': 1}, {'u': 0, 'v': 8}, {'u': 0, 'v': 12}, {'u': 1, 'v': 6}, {'u': 1, 'v': 10}, {'u': 7, 'v': 10}, {'u': 7, 'v': 12}, {'u': 13, 'v': 3}, {'u': 13, 'v': 4}, {'u': 13, 'v': 5}, {'u': 13, 'v': 6}, {'u': 14, 'v': 2}, {'u': 14, 'v': 8}, {'u': 14, 'v': 9}, {'u': 14, 'v': 11}, {'u': 8, 'v': 4}, {'u': 8, 'v': 9}, {'u': 9, 'v': 3}, {'u': 10, 'v': 12}, {'u': 2, 'v': 15}, {'u': 3, 'v': 4}, {'u': 4, 'v': 6}, {'u': 15, 'v': 5}, {'u': 5, 'v': 6}]}","[2, 4, 9, 10, 11, 16, 17, 19, 20, 21]",16,json,0
MIS,MIS,"Recently the clerk noticed the aisle was cluttered and decided to bring some crates to the front for easier access, but there’s a catch: crates sitting on neighboring pallets can’t both be moved. The goal is to bring as many crates forward as possible, which is measured by counting how many were moved, and every plan must respect the “no neighboring pallets” rule and avoid picking the same crate twice. The concrete details are shown below.
There are 19 crates in total and 35 neighboring pallet pairs count.
| crate_u_id | crate_v_id |
|---|---|
| I | C |
| I | F |
| I | H |
| I | J |
| I | P |
| I | S |
| J | A |
| J | C |
| H | F |
| H | N |
| H | P |
| O | L |
| D | E |
| D | P |
| E | R |
| P | F |
| P | L |
| P | N |
| P | R |
| P | S |
| Q | G |
| Q | K |
| Q | M |
| R | L |
| F | B |
| F | L |
| K | L |
| G | A |
| G | L |
| G | M |
| L | B |
| M | A |
| A | B |
| A | C |
| B | C |
You can just send the chosen pallets back in this simple JSON layout so I know which crates to bring forward:
{
""solution"": [""pallet_id"", ""pallet_id"", ...]
}
""solution"" is just a list of the pallet identifiers for the crates you want moved (one entry per crate). Think of it like filling out a small checklist: each string is the exact label of a pallet you picked. This JSON is only a sketch of the shape I expect, not the actual answer—replace the placeholders with the real IDs from the instance.
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': 'MIS', 'num_nodes': 19, 'num_edges': 35, 'edges': [{'u': 9, 'v': 3}, {'u': 9, 'v': 6}, {'u': 9, 'v': 8}, {'u': 9, 'v': 10}, {'u': 9, 'v': 16}, {'u': 9, 'v': 19}, {'u': 10, 'v': 1}, {'u': 10, 'v': 3}, {'u': 8, 'v': 6}, {'u': 8, 'v': 14}, {'u': 8, 'v': 16}, {'u': 15, 'v': 12}, {'u': 4, 'v': 5}, {'u': 4, 'v': 16}, {'u': 5, 'v': 18}, {'u': 16, 'v': 6}, {'u': 16, 'v': 12}, {'u': 16, 'v': 14}, {'u': 16, 'v': 18}, {'u': 16, 'v': 19}, {'u': 17, 'v': 7}, {'u': 17, 'v': 11}, {'u': 17, 'v': 13}, {'u': 18, 'v': 12}, {'u': 6, 'v': 2}, {'u': 6, 'v': 12}, {'u': 11, 'v': 12}, {'u': 7, 'v': 1}, {'u': 7, 'v': 12}, {'u': 7, 'v': 13}, {'u': 12, 'v': 2}, {'u': 13, 'v': 1}, {'u': 1, 'v': 2}, {'u': 1, 'v': 3}, {'u': 2, 'v': 3}], 'source_file': 'wi2010.mtx', 'density': 0.2046783625730994, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0016.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0016.png', 'edge_connectivity': 1}","[4, 6, 7, 10, 11, 14, 15, 18, 19]",9.0,"{'num_nodes': 19, 'num_edges': 35, 'edges': [{'u': 'I', 'v': 'C'}, {'u': 'I', 'v': 'F'}, {'u': 'I', 'v': 'H'}, {'u': 'I', 'v': 'J'}, {'u': 'I', 'v': 'P'}, {'u': 'I', 'v': 'S'}, {'u': 'J', 'v': 'A'}, {'u': 'J', 'v': 'C'}, {'u': 'H', 'v': 'F'}, {'u': 'H', 'v': 'N'}, {'u': 'H', 'v': 'P'}, {'u': 'O', 'v': 'L'}, {'u': 'D', 'v': 'E'}, {'u': 'D', 'v': 'P'}, {'u': 'E', 'v': 'R'}, {'u': 'P', 'v': 'F'}, {'u': 'P', 'v': 'L'}, {'u': 'P', 'v': 'N'}, {'u': 'P', 'v': 'R'}, {'u': 'P', 'v': 'S'}, {'u': 'Q', 'v': 'G'}, {'u': 'Q', 'v': 'K'}, {'u': 'Q', 'v': 'M'}, {'u': 'R', 'v': 'L'}, {'u': 'F', 'v': 'B'}, {'u': 'F', 'v': 'L'}, {'u': 'K', 'v': 'L'}, {'u': 'G', 'v': 'A'}, {'u': 'G', 'v': 'L'}, {'u': 'G', 'v': 'M'}, {'u': 'L', 'v': 'B'}, {'u': 'M', 'v': 'A'}, {'u': 'A', 'v': 'B'}, {'u': 'A', 'v': 'C'}, {'u': 'B', 'v': 'C'}]}","['D', 'F', 'G', 'J', 'K', 'N', 'O', 'R', 'S']",17,markdown_table,names
MIS,MIS,"There’s a convention coming up and the lighting crew wants to spotlight booths, but they don’t want two neighboring booths both under the same lights. The job is to mark as many booths as possible for priority lighting while making sure no two chosen booths sit next to one another. The simplest way to tell which plan is best is to count the marked booths — the plan with the biggest count wins — and every pick has to be a real booth from the plan with no repeats. The specific hall layout appears below.
{
""total_booths"": 19,
""total_adjacency_pairs"": 37,
""edges"": [
{
""adjacent_booth_1"": ""E"",
""adjacent_booth_2"": ""A""
},
{
""adjacent_booth_1"": ""E"",
""adjacent_booth_2"": ""D""
},
{
""adjacent_booth_1"": ""E"",
""adjacent_booth_2"": ""G""
},
{
""adjacent_booth_1"": ""E"",
""adjacent_booth_2"": ""J""
},
{
""adjacent_booth_1"": ""E"",
""adjacent_booth_2"": ""S""
},
{
""adjacent_booth_1"": ""A"",
""adjacent_booth_2"": ""B""
},
{
""adjacent_booth_1"": ""A"",
""adjacent_booth_2"": ""J""
},
{
""adjacent_booth_1"": ""A"",
""adjacent_booth_2"": ""M""
},
{
""adjacent_booth_1"": ""B"",
""adjacent_booth_2"": ""N""
},
{
""adjacent_booth_1"": ""Q"",
""adjacent_booth_2"": ""C""
},
{
""adjacent_booth_1"": ""Q"",
""adjacent_booth_2"": ""H""
},
{
""adjacent_booth_1"": ""Q"",
""adjacent_booth_2"": ""L""
},
{
""adjacent_booth_1"": ""Q"",
""adjacent_booth_2"": ""R""
},
{
""adjacent_booth_1"": ""R"",
""adjacent_booth_2"": ""C""
},
{
""adjacent_booth_1"": ""R"",
""adjacent_booth_2"": ""H""
},
{
""adjacent_booth_1"": ""R"",
""adjacent_booth_2"": ""K""
},
{
""adjacent_booth_1"": ""R"",
""adjacent_booth_2"": ""L""
},
{
""adjacent_booth_1"": ""S"",
""adjacent_booth_2"": ""D""
},
{
""adjacent_booth_1"": ""S"",
""adjacent_booth_2"": ""I""
},
{
""adjacent_booth_1"": ""S"",
""adjacent_booth_2"": ""J""
},
{
""adjacent_booth_1"": ""J"",
""adjacent_booth_2"": ""C""
},
{
""adjacent_booth_1"": ""J"",
""adjacent_booth_2"": ""K""
},
{
""adjacent_booth_1"": ""J"",
""adjacent_booth_2"": ""L""
},
{
""adjacent_booth_1"": ""J"",
""adjacent_booth_2"": ""N""
},
{
""adjacent_booth_1"": ""J"",
""adjacent_booth_2"": ""O""
},
{
""adjacent_booth_1"": ""J"",
""adjacent_booth_2"": ""P""
},
{
""adjacent_booth_1"": ""K"",
""adjacent_booth_2"": ""C""
},
{
""adjacent_booth_1"": ""K"",
""adjacent_booth_2"": ""L""
},
{
""adjacent_booth_1"": ""L"",
""adjacent_booth_2"": ""D""
},
{
""adjacent_booth_1"": ""L"",
""adjacent_booth_2"": ""I""
},
{
""adjacent_booth_1"": ""M"",
""adjacent_booth_2"": ""G""
},
{
""adjacent_booth_1"": ""O"",
""adjacent_booth_2"": ""C""
},
{
""adjacent_booth_1"": ""O"",
""adjacent_booth_2"": ""F""
},
{
""adjacent_booth_1"": ""G"",
""adjacent_booth_2"": ""D""
},
{
""adjacent_booth_1"": ""H"",
""adjacent_booth_2"": ""C""
},
{
""adjacent_booth_1"": ""I"",
""adjacent_booth_2"": ""D""
},
{
""adjacent_booth_1"": ""F"",
""adjacent_booth_2"": ""N""
}
]
}
I'll return the chosen booths in a tiny JSON snippet so it's easy to read and parse. Something like this:
{
""solution"": [""booth_id"", ""booth_id"", ...]
}
Here ""solution"" is just a list of the booths we're marking for priority lighting — each item is a booth identifier from the hall layout (and no repeats). This JSON is only a sketch of the shape I’ll use, not the actual final selection.
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': 'MIS', 'num_nodes': 19, 'num_edges': 37, 'edges': [{'u': 5, 'v': 1}, {'u': 5, 'v': 4}, {'u': 5, 'v': 7}, {'u': 5, 'v': 10}, {'u': 5, 'v': 19}, {'u': 1, 'v': 2}, {'u': 1, 'v': 10}, {'u': 1, 'v': 13}, {'u': 2, 'v': 14}, {'u': 17, 'v': 3}, {'u': 17, 'v': 8}, {'u': 17, 'v': 12}, {'u': 17, 'v': 18}, {'u': 18, 'v': 3}, {'u': 18, 'v': 8}, {'u': 18, 'v': 11}, {'u': 18, 'v': 12}, {'u': 19, 'v': 4}, {'u': 19, 'v': 9}, {'u': 19, 'v': 10}, {'u': 10, 'v': 3}, {'u': 10, 'v': 11}, {'u': 10, 'v': 12}, {'u': 10, 'v': 14}, {'u': 10, 'v': 15}, {'u': 10, 'v': 16}, {'u': 11, 'v': 3}, {'u': 11, 'v': 12}, {'u': 12, 'v': 4}, {'u': 12, 'v': 9}, {'u': 13, 'v': 7}, {'u': 15, 'v': 3}, {'u': 15, 'v': 6}, {'u': 7, 'v': 4}, {'u': 8, 'v': 3}, {'u': 9, 'v': 4}, {'u': 6, 'v': 14}], 'source_file': 'vt2010.mtx', 'density': 0.21637426900584794, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0017.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0017.png', 'edge_connectivity': 1}","[5, 8, 9, 11, 13, 14, 15, 16]",8.0,"{'num_nodes': 19, 'num_edges': 37, 'edges': [{'u': 'E', 'v': 'A'}, {'u': 'E', 'v': 'D'}, {'u': 'E', 'v': 'G'}, {'u': 'E', 'v': 'J'}, {'u': 'E', 'v': 'S'}, {'u': 'A', 'v': 'B'}, {'u': 'A', 'v': 'J'}, {'u': 'A', 'v': 'M'}, {'u': 'B', 'v': 'N'}, {'u': 'Q', 'v': 'C'}, {'u': 'Q', 'v': 'H'}, {'u': 'Q', 'v': 'L'}, {'u': 'Q', 'v': 'R'}, {'u': 'R', 'v': 'C'}, {'u': 'R', 'v': 'H'}, {'u': 'R', 'v': 'K'}, {'u': 'R', 'v': 'L'}, {'u': 'S', 'v': 'D'}, {'u': 'S', 'v': 'I'}, {'u': 'S', 'v': 'J'}, {'u': 'J', 'v': 'C'}, {'u': 'J', 'v': 'K'}, {'u': 'J', 'v': 'L'}, {'u': 'J', 'v': 'N'}, {'u': 'J', 'v': 'O'}, {'u': 'J', 'v': 'P'}, {'u': 'K', 'v': 'C'}, {'u': 'K', 'v': 'L'}, {'u': 'L', 'v': 'D'}, {'u': 'L', 'v': 'I'}, {'u': 'M', 'v': 'G'}, {'u': 'O', 'v': 'C'}, {'u': 'O', 'v': 'F'}, {'u': 'G', 'v': 'D'}, {'u': 'H', 'v': 'C'}, {'u': 'I', 'v': 'D'}, {'u': 'F', 'v': 'N'}]}","['E', 'H', 'I', 'K', 'M', 'N', 'O', 'P']",18,json,names
MIS,MIS,"There’s a neighborhood parade coming and the volunteer coordinator is trying to pack the route with helpers without putting any two of them side by side. The choice is which positions along the lineup to staff so that the total number of helpers is as high as possible, and the way to judge a plan is simple: count the helpers — more counts mean a better plan. Each chosen spot is used once and nobody gets assigned to two spots; the concrete lineup info is shown below.
# total_positions=19
# num_adjacent_pairs=42
position_u,position_v
3,5
3,11
3,13
12,4
12,5
12,14
17,0
17,16
4,2
4,5
4,7
4,9
4,10
4,14
5,0
5,2
5,6
5,8
5,9
5,11
5,13
6,11
9,7
9,8
9,14
9,16
15,2
15,10
15,11
15,18
10,2
10,18
18,1
18,11
8,0
8,16
7,14
13,11
2,11
16,0
11,1
1,0
If you want to send back which positions to staff, just use this little JSON shape so it's easy to read and parse:
{
""solution"": [""spot_id"", ""spot_id"", ...]
}
""solution"" is just the list of parade spots you picked for helpers — one entry per chosen position. Think of each string in that array as the exact label for a spot from the lineup (this JSON is just a sketch of the shape I expect, not the actual answer).
Please use the identifiers exactly as they appear in the instance input — do not rename them and do not 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': 'MIS', 'num_nodes': 19, 'num_edges': 42, 'edges': [{'u': 4, 'v': 6}, {'u': 4, 'v': 12}, {'u': 4, 'v': 14}, {'u': 13, 'v': 5}, {'u': 13, 'v': 6}, {'u': 13, 'v': 15}, {'u': 18, 'v': 1}, {'u': 18, 'v': 17}, {'u': 5, 'v': 3}, {'u': 5, 'v': 6}, {'u': 5, 'v': 8}, {'u': 5, 'v': 10}, {'u': 5, 'v': 11}, {'u': 5, 'v': 15}, {'u': 6, 'v': 1}, {'u': 6, 'v': 3}, {'u': 6, 'v': 7}, {'u': 6, 'v': 9}, {'u': 6, 'v': 10}, {'u': 6, 'v': 12}, {'u': 6, 'v': 14}, {'u': 7, 'v': 12}, {'u': 10, 'v': 8}, {'u': 10, 'v': 9}, {'u': 10, 'v': 15}, {'u': 10, 'v': 17}, {'u': 16, 'v': 3}, {'u': 16, 'v': 11}, {'u': 16, 'v': 12}, {'u': 16, 'v': 19}, {'u': 11, 'v': 3}, {'u': 11, 'v': 19}, {'u': 19, 'v': 2}, {'u': 19, 'v': 12}, {'u': 9, 'v': 1}, {'u': 9, 'v': 17}, {'u': 8, 'v': 15}, {'u': 14, 'v': 12}, {'u': 3, 'v': 12}, {'u': 17, 'v': 1}, {'u': 12, 'v': 2}, {'u': 2, 'v': 1}], 'source_file': 'wy2010.mtx', 'density': 0.24561403508771928, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0018.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0018.png', 'edge_connectivity': 2}","[2, 3, 7, 8, 9, 13, 14, 18]",8.0,"{'num_nodes': 19, 'num_edges': 42, 'edges': [{'u': 3, 'v': 5}, {'u': 3, 'v': 11}, {'u': 3, 'v': 13}, {'u': 12, 'v': 4}, {'u': 12, 'v': 5}, {'u': 12, 'v': 14}, {'u': 17, 'v': 0}, {'u': 17, 'v': 16}, {'u': 4, 'v': 2}, {'u': 4, 'v': 5}, {'u': 4, 'v': 7}, {'u': 4, 'v': 9}, {'u': 4, 'v': 10}, {'u': 4, 'v': 14}, {'u': 5, 'v': 0}, {'u': 5, 'v': 2}, {'u': 5, 'v': 6}, {'u': 5, 'v': 8}, {'u': 5, 'v': 9}, {'u': 5, 'v': 11}, {'u': 5, 'v': 13}, {'u': 6, 'v': 11}, {'u': 9, 'v': 7}, {'u': 9, 'v': 8}, {'u': 9, 'v': 14}, {'u': 9, 'v': 16}, {'u': 15, 'v': 2}, {'u': 15, 'v': 10}, {'u': 15, 'v': 11}, {'u': 15, 'v': 18}, {'u': 10, 'v': 2}, {'u': 10, 'v': 18}, {'u': 18, 'v': 1}, {'u': 18, 'v': 11}, {'u': 8, 'v': 0}, {'u': 8, 'v': 16}, {'u': 7, 'v': 14}, {'u': 13, 'v': 11}, {'u': 2, 'v': 11}, {'u': 16, 'v': 0}, {'u': 11, 'v': 1}, {'u': 1, 'v': 0}]}","[1, 2, 6, 7, 8, 12, 13, 17]",19,csv,0
MIS,MIS,"Someone at the operations desk is trying to maximize coverage tonight by switching on as many cell sites as possible, while making sure no directly interfering pair is active together. The selection is straightforward: for every pair that’s directly linked, choose at most one of them to be live, and then tally up how many stations are live — the higher that tally, the better the outcome. Every station needs a definitive on/off decision (no duplicates, no ignoring entries), and the concrete network layout is shown below.
The layout below lists 20 stations and 42 direct interference links:
Interference link between station 6 and station 1: at most one of the two may be live.
Interference link between station 6 and station 3: at most one of the two may be live.
Interference link between station 6 and station 7: at most one of the two may be live.
Interference link between station 6 and station 11: at most one of the two may be live.
Interference link between station 6 and station 18: at most one of the two may be live.
Interference link between station 2 and station 8: at most one of the two may be live.
Interference link between station 2 and station 16: at most one of the two may be live.
Interference link between station 7 and station 11: at most one of the two may be live.
Interference link between station 7 and station 15: at most one of the two may be live.
Interference link between station 7 and station 18: at most one of the two may be live.
Interference link between station 7 and station 19: at most one of the two may be live.
Interference link between station 11 and station 1: at most one of the two may be live.
Interference link between station 11 and station 9: at most one of the two may be live.
Interference link between station 11 and station 12: at most one of the two may be live.
Interference link between station 11 and station 19: at most one of the two may be live.
Interference link between station 4 and station 0: at most one of the two may be live.
Interference link between station 4 and station 10: at most one of the two may be live.
Interference link between station 4 and station 13: at most one of the two may be live.
Interference link between station 4 and station 14: at most one of the two may be live.
Interference link between station 5 and station 8: at most one of the two may be live.
Interference link between station 5 and station 9: at most one of the two may be live.
Interference link between station 5 and station 15: at most one of the two may be live.
Interference link between station 0 and station 8: at most one of the two may be live.
Interference link between station 0 and station 10: at most one of the two may be live.
Interference link between station 0 and station 14: at most one of the two may be live.
Interference link between station 3 and station 10: at most one of the two may be live.
Interference link between station 3 and station 13: at most one of the two may be live.
Interference link between station 3 and station 18: at most one of the two may be live.
Interference link between station 8 and station 9: at most one of the two may be live.
Interference link between station 8 and station 13: at most one of the two may be live.
Interference link between station 8 and station 14: at most one of the two may be live.
Interference link between station 8 and station 16: at most one of the two may be live.
Interference link between station 9 and station 12: at most one of the two may be live.
Interference link between station 9 and station 17: at most one of the two may be live.
Interference link between station 16 and station 17: at most one of the two may be live.
Interference link between station 17 and station 12: at most one of the two may be live.
Interference link between station 10 and station 13: at most one of the two may be live.
Interference link between station 18 and station 13: at most one of the two may be live.
Interference link between station 18 and station 15: at most one of the two may be live.
Interference link between station 19 and station 15: at most one of the two may be live.
Interference link between station 13 and station 14: at most one of the two may be live.
Interference link between station 13 and station 15: at most one of the two may be live.
Every station must receive a definitive on/off decision so the operations desk can tally how many are live and maximize coverage tonight.
Also, when you send the final selection back, please use this simple JSON layout so it's easy to parse:
{
""solution"": [""site_id"", ""site_id"", ...]
}
This just means ""solution"" should be a list of the site IDs you want switched on. Think of it like ticking boxes on a form — each quoted entry is the exact station identifier you choose to make live. The JSON above is only 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': 'MIS', 'num_nodes': 20, 'num_edges': 42, 'edges': [{'u': 7, 'v': 2}, {'u': 7, 'v': 4}, {'u': 7, 'v': 8}, {'u': 7, 'v': 12}, {'u': 7, 'v': 19}, {'u': 3, 'v': 9}, {'u': 3, 'v': 17}, {'u': 8, 'v': 12}, {'u': 8, 'v': 16}, {'u': 8, 'v': 19}, {'u': 8, 'v': 20}, {'u': 12, 'v': 2}, {'u': 12, 'v': 10}, {'u': 12, 'v': 13}, {'u': 12, 'v': 20}, {'u': 5, 'v': 1}, {'u': 5, 'v': 11}, {'u': 5, 'v': 14}, {'u': 5, 'v': 15}, {'u': 6, 'v': 9}, {'u': 6, 'v': 10}, {'u': 6, 'v': 16}, {'u': 1, 'v': 9}, {'u': 1, 'v': 11}, {'u': 1, 'v': 15}, {'u': 4, 'v': 11}, {'u': 4, 'v': 14}, {'u': 4, 'v': 19}, {'u': 9, 'v': 10}, {'u': 9, 'v': 14}, {'u': 9, 'v': 15}, {'u': 9, 'v': 17}, {'u': 10, 'v': 13}, {'u': 10, 'v': 18}, {'u': 17, 'v': 18}, {'u': 18, 'v': 13}, {'u': 11, 'v': 14}, {'u': 19, 'v': 14}, {'u': 19, 'v': 16}, {'u': 20, 'v': 16}, {'u': 14, 'v': 15}, {'u': 14, 'v': 16}], 'source_file': 'vt2010.mtx', 'density': 0.22105263157894736, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0019.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0019.png', 'edge_connectivity': 2}","[2, 3, 6, 11, 15, 18, 19, 20]",8.0,"{'num_nodes': 20, 'num_edges': 42, 'edges': [{'u': 6, 'v': 1}, {'u': 6, 'v': 3}, {'u': 6, 'v': 7}, {'u': 6, 'v': 11}, {'u': 6, 'v': 18}, {'u': 2, 'v': 8}, {'u': 2, 'v': 16}, {'u': 7, 'v': 11}, {'u': 7, 'v': 15}, {'u': 7, 'v': 18}, {'u': 7, 'v': 19}, {'u': 11, 'v': 1}, {'u': 11, 'v': 9}, {'u': 11, 'v': 12}, {'u': 11, 'v': 19}, {'u': 4, 'v': 0}, {'u': 4, 'v': 10}, {'u': 4, 'v': 13}, {'u': 4, 'v': 14}, {'u': 5, 'v': 8}, {'u': 5, 'v': 9}, {'u': 5, 'v': 15}, {'u': 0, 'v': 8}, {'u': 0, 'v': 10}, {'u': 0, 'v': 14}, {'u': 3, 'v': 10}, {'u': 3, 'v': 13}, {'u': 3, 'v': 18}, {'u': 8, 'v': 9}, {'u': 8, 'v': 13}, {'u': 8, 'v': 14}, {'u': 8, 'v': 16}, {'u': 9, 'v': 12}, {'u': 9, 'v': 17}, {'u': 16, 'v': 17}, {'u': 17, 'v': 12}, {'u': 10, 'v': 13}, {'u': 18, 'v': 13}, {'u': 18, 'v': 15}, {'u': 19, 'v': 15}, {'u': 13, 'v': 14}, {'u': 13, 'v': 15}]}","[1, 2, 5, 10, 14, 17, 18, 19]",20,nl,0
MIS,MIS,"I’m the club adviser trying to build the best possible presenter lineup for the school assembly: pick as many students as I can to go on stage, but never pick two who have a time clash with each other. The idea is simple — the better the lineup, the more students are speaking, so count how many presenters are chosen and aim for the highest total. No student can be picked twice, and if two students’ schedules overlap, only one of them can be in the final group. The concrete list of students and their schedule conflicts is shown below.
I'm working with 20 students and 42 pairwise scheduling conflicts listed below.
I can't pick both 13 and 3 because their schedules clash, so only one can present.
I can't pick both 13 and 6 because their schedules clash, so only one can present.
I can't pick both 13 and 7 because their schedules clash, so only one can present.
I can't pick both 13 and 16 because their schedules clash, so only one can present.
I can't pick both 13 and 17 because their schedules clash, so only one can present.
I can't pick both 0 and 10 because their schedules clash, so only one can present.
I can't pick both 0 and 15 because their schedules clash, so only one can present.
I can't pick both 0 and 16 because their schedules clash, so only one can present.
I can't pick both 0 and 17 because their schedules clash, so only one can present.
I can't pick both 0 and 19 because their schedules clash, so only one can present.
I can't pick both 1 and 2 because their schedules clash, so only one can present.
I can't pick both 1 and 4 because their schedules clash, so only one can present.
I can't pick both 1 and 15 because their schedules clash, so only one can present.
I can't pick both 1 and 19 because their schedules clash, so only one can present.
I can't pick both 17 and 3 because their schedules clash, so only one can present.
I can't pick both 17 and 6 because their schedules clash, so only one can present.
I can't pick both 17 and 10 because their schedules clash, so only one can present.
I can't pick both 17 and 12 because their schedules clash, so only one can present.
I can't pick both 18 and 4 because their schedules clash, so only one can present.
I can't pick both 18 and 8 because their schedules clash, so only one can present.
I can't pick both 18 and 9 because their schedules clash, so only one can present.
I can't pick both 2 and 12 because their schedules clash, so only one can present.
I can't pick both 2 and 14 because their schedules clash, so only one can present.
I can't pick both 2 and 15 because their schedules clash, so only one can present.
I can't pick both 5 and 4 because their schedules clash, so only one can present.
I can't pick both 5 and 9 because their schedules clash, so only one can present.
I can't pick both 5 and 19 because their schedules clash, so only one can present.
I can't pick both 14 and 4 because their schedules clash, so only one can present.
I can't pick both 14 and 6 because their schedules clash, so only one can present.
I can't pick both 14 and 11 because their schedules clash, so only one can present.
I can't pick both 6 and 3 because their schedules clash, so only one can present.
I can't pick both 6 and 7 because their schedules clash, so only one can present.
I can't pick both 6 and 11 because their schedules clash, so only one can present.
I can't pick both 6 and 12 because their schedules clash, so only one can present.
I can't pick both 7 and 8 because their schedules clash, so only one can present.
I can't pick both 4 and 11 because their schedules clash, so only one can present.
I can't pick both 15 and 10 because their schedules clash, so only one can present.
I can't pick both 15 and 12 because their schedules clash, so only one can present.
I can't pick both 15 and 19 because their schedules clash, so only one can present.
I can't pick both 10 and 12 because their schedules clash, so only one can present.
I can't pick both 11 and 8 because their schedules clash, so only one can present.
I can't pick both 8 and 9 because their schedules clash, so only one can present.
I'll use this list to choose the largest possible presenter lineup with no overlapping schedules.
You can just send back the final lineup in a tiny JSON snippet like this — super simple and machine-friendly:
{
""solution"": [""presenter_id"", ""presenter_id"", ...]
}
Think of ""solution"" as the box where you list the student IDs you're putting on stage. Each ""presenter_id"" is a placeholder for one chosen student — replace those placeholders with the actual IDs from the instance when you give the real answer. This JSON is just a sketch of the shape I want, not the actual final lineup.
Please be 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': 'MIS', 'num_nodes': 20, 'num_edges': 42, 'edges': [{'u': 14, 'v': 4}, {'u': 14, 'v': 7}, {'u': 14, 'v': 8}, {'u': 14, 'v': 17}, {'u': 14, 'v': 18}, {'u': 1, 'v': 11}, {'u': 1, 'v': 16}, {'u': 1, 'v': 17}, {'u': 1, 'v': 18}, {'u': 1, 'v': 20}, {'u': 2, 'v': 3}, {'u': 2, 'v': 5}, {'u': 2, 'v': 16}, {'u': 2, 'v': 20}, {'u': 18, 'v': 4}, {'u': 18, 'v': 7}, {'u': 18, 'v': 11}, {'u': 18, 'v': 13}, {'u': 19, 'v': 5}, {'u': 19, 'v': 9}, {'u': 19, 'v': 10}, {'u': 3, 'v': 13}, {'u': 3, 'v': 15}, {'u': 3, 'v': 16}, {'u': 6, 'v': 5}, {'u': 6, 'v': 10}, {'u': 6, 'v': 20}, {'u': 15, 'v': 5}, {'u': 15, 'v': 7}, {'u': 15, 'v': 12}, {'u': 7, 'v': 4}, {'u': 7, 'v': 8}, {'u': 7, 'v': 12}, {'u': 7, 'v': 13}, {'u': 8, 'v': 9}, {'u': 5, 'v': 12}, {'u': 16, 'v': 11}, {'u': 16, 'v': 13}, {'u': 16, 'v': 20}, {'u': 11, 'v': 13}, {'u': 12, 'v': 9}, {'u': 9, 'v': 10}], 'source_file': 'wy2010.mtx', 'density': 0.22105263157894736, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0020.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0020.png', 'edge_connectivity': 2}","[3, 4, 6, 8, 11, 12, 17, 19]",8.0,"{'num_nodes': 20, 'num_edges': 42, 'edges': [{'u': 13, 'v': 3}, {'u': 13, 'v': 6}, {'u': 13, 'v': 7}, {'u': 13, 'v': 16}, {'u': 13, 'v': 17}, {'u': 0, 'v': 10}, {'u': 0, 'v': 15}, {'u': 0, 'v': 16}, {'u': 0, 'v': 17}, {'u': 0, 'v': 19}, {'u': 1, 'v': 2}, {'u': 1, 'v': 4}, {'u': 1, 'v': 15}, {'u': 1, 'v': 19}, {'u': 17, 'v': 3}, {'u': 17, 'v': 6}, {'u': 17, 'v': 10}, {'u': 17, 'v': 12}, {'u': 18, 'v': 4}, {'u': 18, 'v': 8}, {'u': 18, 'v': 9}, {'u': 2, 'v': 12}, {'u': 2, 'v': 14}, {'u': 2, 'v': 15}, {'u': 5, 'v': 4}, {'u': 5, 'v': 9}, {'u': 5, 'v': 19}, {'u': 14, 'v': 4}, {'u': 14, 'v': 6}, {'u': 14, 'v': 11}, {'u': 6, 'v': 3}, {'u': 6, 'v': 7}, {'u': 6, 'v': 11}, {'u': 6, 'v': 12}, {'u': 7, 'v': 8}, {'u': 4, 'v': 11}, {'u': 15, 'v': 10}, {'u': 15, 'v': 12}, {'u': 15, 'v': 19}, {'u': 10, 'v': 12}, {'u': 11, 'v': 8}, {'u': 8, 'v': 9}]}","[2, 3, 5, 7, 10, 11, 16, 18]",21,nl,0
MIS,MIS,"On a busy weekend the restaurant wants to offer a generous tasting menu, but ingredient clashes force some tough calls. The task is to select a combination of distinct dishes where no two chosen items clash, and then see how many dishes that gives you — the larger that number, the better the menu. Each dish is either included once or left off the menu. The specific dishes and the pairs that clash are provided below.
There are 23 dishes in total and 54 clashing pairs.
| dish_a | dish_b |
|---|---|
| 22 | 3 |
| 22 | 4 |
| 22 | 7 |
| 22 | 8 |
| 22 | 9 |
| 22 | 14 |
| 22 | 16 |
| 22 | 17 |
| 22 | 19 |
| 20 | 8 |
| 20 | 9 |
| 20 | 13 |
| 20 | 16 |
| 20 | 19 |
| 21 | 6 |
| 21 | 9 |
| 21 | 13 |
| 21 | 15 |
| 21 | 23 |
| 23 | 15 |
| 14 | 2 |
| 14 | 4 |
| 14 | 5 |
| 15 | 5 |
| 15 | 6 |
| 15 | 18 |
| 6 | 1 |
| 6 | 4 |
| 6 | 9 |
| 6 | 11 |
| 7 | 4 |
| 7 | 9 |
| 8 | 3 |
| 8 | 16 |
| 8 | 19 |
| 17 | 9 |
| 18 | 1 |
| 18 | 5 |
| 18 | 10 |
| 18 | 11 |
| 3 | 19 |
| 2 | 4 |
| 2 | 5 |
| 13 | 9 |
| 12 | 4 |
| 12 | 9 |
| 4 | 1 |
| 4 | 5 |
| 4 | 9 |
| 4 | 10 |
| 9 | 19 |
| 10 | 1 |
| 10 | 5 |
| 1 | 11 |
Also, when you send back the chosen dishes, please use this simple JSON layout so I can read it easily:
{
""solution"": [""dish_id"", ""dish_id"", ...]
}
This just means the value for ""solution"" should be a list of the dish identifiers you picked for the menu (one entry per dish). Think of it like filling out a short form — the JSON above is just the shape I expect, not the actual answer.
Please use the identifiers exactly as they appear in the instance input — don't rename them or invent new labels. Valid identifiers look like:
- plain numbers such as ""1"" or ""23""
- single capital letters like ""A"" or ""B""
- a capital letter followed by digits like ""A1"" or ""X7""","{'problem_type': 'MIS', 'num_nodes': 23, 'num_edges': 54, 'edges': [{'u': 22, 'v': 3}, {'u': 22, 'v': 4}, {'u': 22, 'v': 7}, {'u': 22, 'v': 8}, {'u': 22, 'v': 9}, {'u': 22, 'v': 14}, {'u': 22, 'v': 16}, {'u': 22, 'v': 17}, {'u': 22, 'v': 19}, {'u': 20, 'v': 8}, {'u': 20, 'v': 9}, {'u': 20, 'v': 13}, {'u': 20, 'v': 16}, {'u': 20, 'v': 19}, {'u': 21, 'v': 6}, {'u': 21, 'v': 9}, {'u': 21, 'v': 13}, {'u': 21, 'v': 15}, {'u': 21, 'v': 23}, {'u': 23, 'v': 15}, {'u': 14, 'v': 2}, {'u': 14, 'v': 4}, {'u': 14, 'v': 5}, {'u': 15, 'v': 5}, {'u': 15, 'v': 6}, {'u': 15, 'v': 18}, {'u': 6, 'v': 1}, {'u': 6, 'v': 4}, {'u': 6, 'v': 9}, {'u': 6, 'v': 11}, {'u': 7, 'v': 4}, {'u': 7, 'v': 9}, {'u': 8, 'v': 3}, {'u': 8, 'v': 16}, {'u': 8, 'v': 19}, {'u': 17, 'v': 9}, {'u': 18, 'v': 1}, {'u': 18, 'v': 5}, {'u': 18, 'v': 10}, {'u': 18, 'v': 11}, {'u': 3, 'v': 19}, {'u': 2, 'v': 4}, {'u': 2, 'v': 5}, {'u': 13, 'v': 9}, {'u': 12, 'v': 4}, {'u': 12, 'v': 9}, {'u': 4, 'v': 1}, {'u': 4, 'v': 5}, {'u': 4, 'v': 9}, {'u': 4, 'v': 10}, {'u': 9, 'v': 19}, {'u': 10, 'v': 1}, {'u': 10, 'v': 5}, {'u': 1, 'v': 11}], 'source_file': 'wy2010.mtx', 'density': 0.2134387351778656, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0021.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0021.png', 'edge_connectivity': 2}","[2, 3, 6, 7, 10, 12, 13, 16, 17, 23]",10.0,"{'num_nodes': 23, 'num_edges': 54, 'edges': [{'u': 22, 'v': 3}, {'u': 22, 'v': 4}, {'u': 22, 'v': 7}, {'u': 22, 'v': 8}, {'u': 22, 'v': 9}, {'u': 22, 'v': 14}, {'u': 22, 'v': 16}, {'u': 22, 'v': 17}, {'u': 22, 'v': 19}, {'u': 20, 'v': 8}, {'u': 20, 'v': 9}, {'u': 20, 'v': 13}, {'u': 20, 'v': 16}, {'u': 20, 'v': 19}, {'u': 21, 'v': 6}, {'u': 21, 'v': 9}, {'u': 21, 'v': 13}, {'u': 21, 'v': 15}, {'u': 21, 'v': 23}, {'u': 23, 'v': 15}, {'u': 14, 'v': 2}, {'u': 14, 'v': 4}, {'u': 14, 'v': 5}, {'u': 15, 'v': 5}, {'u': 15, 'v': 6}, {'u': 15, 'v': 18}, {'u': 6, 'v': 1}, {'u': 6, 'v': 4}, {'u': 6, 'v': 9}, {'u': 6, 'v': 11}, {'u': 7, 'v': 4}, {'u': 7, 'v': 9}, {'u': 8, 'v': 3}, {'u': 8, 'v': 16}, {'u': 8, 'v': 19}, {'u': 17, 'v': 9}, {'u': 18, 'v': 1}, {'u': 18, 'v': 5}, {'u': 18, 'v': 10}, {'u': 18, 'v': 11}, {'u': 3, 'v': 19}, {'u': 2, 'v': 4}, {'u': 2, 'v': 5}, {'u': 13, 'v': 9}, {'u': 12, 'v': 4}, {'u': 12, 'v': 9}, {'u': 4, 'v': 1}, {'u': 4, 'v': 5}, {'u': 4, 'v': 9}, {'u': 4, 'v': 10}, {'u': 9, 'v': 19}, {'u': 10, 'v': 1}, {'u': 10, 'v': 5}, {'u': 1, 'v': 11}]}","[2, 3, 6, 7, 10, 12, 13, 16, 17, 23]",22,markdown_table,1
MIS,MIS,"In our neighborhood, putting together the volunteer roster for the fair means trying to get the biggest team we can, but with one rule: don’t sign up any two people who’ve got a personal conflict. The choice is who to roster — one arrangement is better than another if it ends up with a greater number of distinct helpers, so you just count the names to compare. Don’t add anybody twice, only pick from the people who offered, and if two people are known to clash, they can’t both be chosen. The exact details are listed below.
{
""total_volunteers"": 23,
""total_conflicts"": 41,
""edges"": [
{
""volunteer_a"": ""D"",
""volunteer_b"": ""B""
},
{
""volunteer_a"": ""D"",
""volunteer_b"": ""R""
},
{
""volunteer_a"": ""D"",
""volunteer_b"": ""W""
},
{
""volunteer_a"": ""L"",
""volunteer_b"": ""F""
},
{
""volunteer_a"": ""L"",
""volunteer_b"": ""N""
},
{
""volunteer_a"": ""L"",
""volunteer_b"": ""O""
},
{
""volunteer_a"": ""M"",
""volunteer_b"": ""E""
},
{
""volunteer_a"": ""M"",
""volunteer_b"": ""G""
},
{
""volunteer_a"": ""M"",
""volunteer_b"": ""I""
},
{
""volunteer_a"": ""M"",
""volunteer_b"": ""U""
},
{
""volunteer_a"": ""T"",
""volunteer_b"": ""C""
},
{
""volunteer_a"": ""T"",
""volunteer_b"": ""F""
},
{
""volunteer_a"": ""T"",
""volunteer_b"": ""P""
},
{
""volunteer_a"": ""N"",
""volunteer_b"": ""K""
},
{
""volunteer_a"": ""U"",
""volunteer_b"": ""I""
},
{
""volunteer_a"": ""U"",
""volunteer_b"": ""K""
},
{
""volunteer_a"": ""O"",
""volunteer_b"": ""F""
},
{
""volunteer_a"": ""O"",
""volunteer_b"": ""H""
},
{
""volunteer_a"": ""O"",
""volunteer_b"": ""K""
},
{
""volunteer_a"": ""O"",
""volunteer_b"": ""P""
},
{
""volunteer_a"": ""O"",
""volunteer_b"": ""V""
},
{
""volunteer_a"": ""P"",
""volunteer_b"": ""B""
},
{
""volunteer_a"": ""P"",
""volunteer_b"": ""E""
},
{
""volunteer_a"": ""P"",
""volunteer_b"": ""G""
},
{
""volunteer_a"": ""P"",
""volunteer_b"": ""R""
},
{
""volunteer_a"": ""P"",
""volunteer_b"": ""S""
},
{
""volunteer_a"": ""P"",
""volunteer_b"": ""V""
},
{
""volunteer_a"": ""S"",
""volunteer_b"": ""J""
},
{
""volunteer_a"": ""S"",
""volunteer_b"": ""Q""
},
{
""volunteer_a"": ""S"",
""volunteer_b"": ""R""
},
{
""volunteer_a"": ""S"",
""volunteer_b"": ""W""
},
{
""volunteer_a"": ""V"",
""volunteer_b"": ""G""
},
{
""volunteer_a"": ""V"",
""volunteer_b"": ""H""
},
{
""volunteer_a"": ""W"",
""volunteer_b"": ""B""
},
{
""volunteer_a"": ""H"",
""volunteer_b"": ""G""
},
{
""volunteer_a"": ""I"",
""volunteer_b"": ""G""
},
{
""volunteer_a"": ""A"",
""volunteer_b"": ""B""
},
{
""volunteer_a"": ""B"",
""volunteer_b"": ""C""
},
{
""volunteer_a"": ""Q"",
""volunteer_b"": ""E""
},
{
""volunteer_a"": ""K"",
""volunteer_b"": ""G""
},
{
""volunteer_a"": ""E"",
""volunteer_b"": ""G""
}
]
}
Also, when you send the final roster back, please use this simple JSON layout so it's easy to parse:
{
""solution"": [""volunteer_id"", ""volunteer_id"", ...]
}
Think of ""solution"" as the list of people you're choosing for the fair — each string is the identifier for one person from the problem instance (the exact label that showed up in the input). This JSON is just a sketch of the shape I expect, not the final answer itself.
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': 'MIS', 'num_nodes': 23, 'num_edges': 41, 'edges': [{'u': 4, 'v': 2}, {'u': 4, 'v': 18}, {'u': 4, 'v': 23}, {'u': 12, 'v': 6}, {'u': 12, 'v': 14}, {'u': 12, 'v': 15}, {'u': 13, 'v': 5}, {'u': 13, 'v': 7}, {'u': 13, 'v': 9}, {'u': 13, 'v': 21}, {'u': 20, 'v': 3}, {'u': 20, 'v': 6}, {'u': 20, 'v': 16}, {'u': 14, 'v': 11}, {'u': 21, 'v': 9}, {'u': 21, 'v': 11}, {'u': 15, 'v': 6}, {'u': 15, 'v': 8}, {'u': 15, 'v': 11}, {'u': 15, 'v': 16}, {'u': 15, 'v': 22}, {'u': 16, 'v': 2}, {'u': 16, 'v': 5}, {'u': 16, 'v': 7}, {'u': 16, 'v': 18}, {'u': 16, 'v': 19}, {'u': 16, 'v': 22}, {'u': 19, 'v': 10}, {'u': 19, 'v': 17}, {'u': 19, 'v': 18}, {'u': 19, 'v': 23}, {'u': 22, 'v': 7}, {'u': 22, 'v': 8}, {'u': 23, 'v': 2}, {'u': 8, 'v': 7}, {'u': 9, 'v': 7}, {'u': 1, 'v': 2}, {'u': 2, 'v': 3}, {'u': 17, 'v': 5}, {'u': 11, 'v': 7}, {'u': 5, 'v': 7}], 'source_file': 'vt2010.mtx', 'density': 0.16205533596837945, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0022.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0022.png', 'edge_connectivity': 1}","[1, 3, 6, 8, 10, 14, 17, 18, 21, 23]",10.0,"{'num_nodes': 23, 'num_edges': 41, 'edges': [{'u': 'D', 'v': 'B'}, {'u': 'D', 'v': 'R'}, {'u': 'D', 'v': 'W'}, {'u': 'L', 'v': 'F'}, {'u': 'L', 'v': 'N'}, {'u': 'L', 'v': 'O'}, {'u': 'M', 'v': 'E'}, {'u': 'M', 'v': 'G'}, {'u': 'M', 'v': 'I'}, {'u': 'M', 'v': 'U'}, {'u': 'T', 'v': 'C'}, {'u': 'T', 'v': 'F'}, {'u': 'T', 'v': 'P'}, {'u': 'N', 'v': 'K'}, {'u': 'U', 'v': 'I'}, {'u': 'U', 'v': 'K'}, {'u': 'O', 'v': 'F'}, {'u': 'O', 'v': 'H'}, {'u': 'O', 'v': 'K'}, {'u': 'O', 'v': 'P'}, {'u': 'O', 'v': 'V'}, {'u': 'P', 'v': 'B'}, {'u': 'P', 'v': 'E'}, {'u': 'P', 'v': 'G'}, {'u': 'P', 'v': 'R'}, {'u': 'P', 'v': 'S'}, {'u': 'P', 'v': 'V'}, {'u': 'S', 'v': 'J'}, {'u': 'S', 'v': 'Q'}, {'u': 'S', 'v': 'R'}, {'u': 'S', 'v': 'W'}, {'u': 'V', 'v': 'G'}, {'u': 'V', 'v': 'H'}, {'u': 'W', 'v': 'B'}, {'u': 'H', 'v': 'G'}, {'u': 'I', 'v': 'G'}, {'u': 'A', 'v': 'B'}, {'u': 'B', 'v': 'C'}, {'u': 'Q', 'v': 'E'}, {'u': 'K', 'v': 'G'}, {'u': 'E', 'v': 'G'}]}","['A', 'C', 'F', 'H', 'J', 'N', 'Q', 'R', 'U', 'W']",23,json,names
MIS,MIS,"Someone on the programming team needs to assemble an hour-long set and must avoid putting any two policy-conflicted songs in the same playlist. The choice is which songs to include in that hour so the list contains the highest possible count of distinct tracks while steering clear of any forbidden pairings. A playlist with a higher count of songs is better — evaluate it by tallying the tracks. Repeats aren’t allowed, and the full list of tracks and the station’s incompatibility notes appear below.
There are 19 distinct candidate tracks available and 42 station-policy incompatibility pairs listed below.
Track 11 must not appear with track 4 in the same hour-long playlist.
Track 11 must not appear with track 5 in the same hour-long playlist.
Track 11 must not appear with track 7 in the same hour-long playlist.
Track 11 must not appear with track 8 in the same hour-long playlist.
Track 11 must not appear with track 15 in the same hour-long playlist.
Track 12 must not appear with track 2 in the same hour-long playlist.
Track 12 must not appear with track 18 in the same hour-long playlist.
Track 13 must not appear with track 3 in the same hour-long playlist.
Track 13 must not appear with track 5 in the same hour-long playlist.
Track 13 must not appear with track 6 in the same hour-long playlist.
Track 13 must not appear with track 7 in the same hour-long playlist.
Track 13 must not appear with track 15 in the same hour-long playlist.
Track 8 must not appear with track 7 in the same hour-long playlist.
Track 14 must not appear with track 2 in the same hour-long playlist.
Track 14 must not appear with track 9 in the same hour-long playlist.
Track 14 must not appear with track 10 in the same hour-long playlist.
Track 14 must not appear with track 18 in the same hour-long playlist.
Track 9 must not appear with track 10 in the same hour-long playlist.
Track 9 must not appear with track 15 in the same hour-long playlist.
Track 9 must not appear with track 16 in the same hour-long playlist.
Track 9 must not appear with track 17 in the same hour-long playlist.
Track 10 must not appear with track 2 in the same hour-long playlist.
Track 10 must not appear with track 15 in the same hour-long playlist.
Track 6 must not appear with track 1 in the same hour-long playlist.
Track 6 must not appear with track 2 in the same hour-long playlist.
Track 6 must not appear with track 15 in the same hour-long playlist.
Track 7 must not appear with track 5 in the same hour-long playlist.
Track 7 must not appear with track 16 in the same hour-long playlist.
Track 7 must not appear with track 17 in the same hour-long playlist.
Track 7 must not appear with track 18 in the same hour-long playlist.
Track 4 must not appear with track 0 in the same hour-long playlist.
Track 4 must not appear with track 15 in the same hour-long playlist.
Track 5 must not appear with track 3 in the same hour-long playlist.
Track 5 must not appear with track 15 in the same hour-long playlist.
Track 15 must not appear with track 0 in the same hour-long playlist.
Track 15 must not appear with track 2 in the same hour-long playlist.
Track 15 must not appear with track 3 in the same hour-long playlist.
Track 15 must not appear with track 17 in the same hour-long playlist.
Track 1 must not appear with track 2 in the same hour-long playlist.
Track 2 must not appear with track 18 in the same hour-long playlist.
Track 0 must not appear with track 17 in the same hour-long playlist.
Track 16 must not appear with track 18 in the same hour-long playlist.
Assemble the hour-long set to include as many distinct tracks as possible while respecting the listed conflicts.
Also, when you hand the final playlist back, it'd be great if you use a tiny JSON snippet like this so it's easy to parse:
{
""solution"": [""song_id"", ""song_id"", ...]
}
Here ""solution"" is just the list of tracks you're picking for that hour, and each ""song_id"" is a placeholder for a song identifier from the instance (so think of it like filling in the names or IDs of the tracks you chose). This is just the shape I expect — not the real answer itself.
Please make sure to use the exact identifiers from the instance input, with no renaming or extra labels. For example:
- 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': 'MIS', 'num_nodes': 19, 'num_edges': 42, 'edges': [{'u': 12, 'v': 5}, {'u': 12, 'v': 6}, {'u': 12, 'v': 8}, {'u': 12, 'v': 9}, {'u': 12, 'v': 16}, {'u': 13, 'v': 3}, {'u': 13, 'v': 19}, {'u': 14, 'v': 4}, {'u': 14, 'v': 6}, {'u': 14, 'v': 7}, {'u': 14, 'v': 8}, {'u': 14, 'v': 16}, {'u': 9, 'v': 8}, {'u': 15, 'v': 3}, {'u': 15, 'v': 10}, {'u': 15, 'v': 11}, {'u': 15, 'v': 19}, {'u': 10, 'v': 11}, {'u': 10, 'v': 16}, {'u': 10, 'v': 17}, {'u': 10, 'v': 18}, {'u': 11, 'v': 3}, {'u': 11, 'v': 16}, {'u': 7, 'v': 2}, {'u': 7, 'v': 3}, {'u': 7, 'v': 16}, {'u': 8, 'v': 6}, {'u': 8, 'v': 17}, {'u': 8, 'v': 18}, {'u': 8, 'v': 19}, {'u': 5, 'v': 1}, {'u': 5, 'v': 16}, {'u': 6, 'v': 4}, {'u': 6, 'v': 16}, {'u': 16, 'v': 1}, {'u': 16, 'v': 3}, {'u': 16, 'v': 4}, {'u': 16, 'v': 18}, {'u': 2, 'v': 3}, {'u': 3, 'v': 19}, {'u': 1, 'v': 18}, {'u': 17, 'v': 19}], 'source_file': 'wi2010.mtx', 'density': 0.24561403508771928, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0023.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0023.png', 'edge_connectivity': 2}","[2, 4, 5, 9, 13, 15, 17, 18]",8.0,"{'num_nodes': 19, 'num_edges': 42, 'edges': [{'u': 11, 'v': 4}, {'u': 11, 'v': 5}, {'u': 11, 'v': 7}, {'u': 11, 'v': 8}, {'u': 11, 'v': 15}, {'u': 12, 'v': 2}, {'u': 12, 'v': 18}, {'u': 13, 'v': 3}, {'u': 13, 'v': 5}, {'u': 13, 'v': 6}, {'u': 13, 'v': 7}, {'u': 13, 'v': 15}, {'u': 8, 'v': 7}, {'u': 14, 'v': 2}, {'u': 14, 'v': 9}, {'u': 14, 'v': 10}, {'u': 14, 'v': 18}, {'u': 9, 'v': 10}, {'u': 9, 'v': 15}, {'u': 9, 'v': 16}, {'u': 9, 'v': 17}, {'u': 10, 'v': 2}, {'u': 10, 'v': 15}, {'u': 6, 'v': 1}, {'u': 6, 'v': 2}, {'u': 6, 'v': 15}, {'u': 7, 'v': 5}, {'u': 7, 'v': 16}, {'u': 7, 'v': 17}, {'u': 7, 'v': 18}, {'u': 4, 'v': 0}, {'u': 4, 'v': 15}, {'u': 5, 'v': 3}, {'u': 5, 'v': 15}, {'u': 15, 'v': 0}, {'u': 15, 'v': 2}, {'u': 15, 'v': 3}, {'u': 15, 'v': 17}, {'u': 1, 'v': 2}, {'u': 2, 'v': 18}, {'u': 0, 'v': 17}, {'u': 16, 'v': 18}]}","[1, 3, 4, 8, 12, 14, 16, 17]",24,nl,0
MIS,MIS,"I manage a band and need to put together a live set. The trick is to pick the biggest possible group of songs that all work together — if any two songs are a bad match and can’t follow each other, they can’t both be in the set. The better the set, the more songs it contains, so lineups are compared by simply counting how many songs made the cut. Each song is a single, indivisible choice (no repeats allowed), and no pair that conflicts can both be included. The concrete song-by-song details are shown below.
# total_songs_available=23
# total_conflicting_pairs=43
song_a_id,song_b_id
I,A
I,F
I,H
I,P
I,Q
I,S
L,E
L,U
B,C
B,K
C,D
C,K
C,O
C,R
D,M
D,R
D,V
D,W
E,F
E,G
E,K
E,O
E,S
E,T
E,U
F,N
F,O
F,S
G,H
G,S
G,T
A,P
M,N
M,O
M,V
N,P
U,J
U,K
H,S
H,T
V,P
V,W
J,K
Also, when you send the final lineup, please stick it into a tiny JSON snippet like this so it’s easy to read and parse:
{
""solution"": [""song_id"", ""song_id"", ...]
}
This just means ""solution"" holds a list of the song identifiers you picked for the set — each entry should be the exact label used in the instance (it's just a sketch of the shape I want, not the actual answer). Use the real song IDs from the input; don't make up new names or change them.
Use 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': 'MIS', 'num_nodes': 23, 'num_edges': 43, 'edges': [{'u': 9, 'v': 1}, {'u': 9, 'v': 6}, {'u': 9, 'v': 8}, {'u': 9, 'v': 16}, {'u': 9, 'v': 17}, {'u': 9, 'v': 19}, {'u': 12, 'v': 5}, {'u': 12, 'v': 21}, {'u': 2, 'v': 3}, {'u': 2, 'v': 11}, {'u': 3, 'v': 4}, {'u': 3, 'v': 11}, {'u': 3, 'v': 15}, {'u': 3, 'v': 18}, {'u': 4, 'v': 13}, {'u': 4, 'v': 18}, {'u': 4, 'v': 22}, {'u': 4, 'v': 23}, {'u': 5, 'v': 6}, {'u': 5, 'v': 7}, {'u': 5, 'v': 11}, {'u': 5, 'v': 15}, {'u': 5, 'v': 19}, {'u': 5, 'v': 20}, {'u': 5, 'v': 21}, {'u': 6, 'v': 14}, {'u': 6, 'v': 15}, {'u': 6, 'v': 19}, {'u': 7, 'v': 8}, {'u': 7, 'v': 19}, {'u': 7, 'v': 20}, {'u': 1, 'v': 16}, {'u': 13, 'v': 14}, {'u': 13, 'v': 15}, {'u': 13, 'v': 22}, {'u': 14, 'v': 16}, {'u': 21, 'v': 10}, {'u': 21, 'v': 11}, {'u': 8, 'v': 19}, {'u': 8, 'v': 20}, {'u': 22, 'v': 16}, {'u': 22, 'v': 23}, {'u': 10, 'v': 11}], 'source_file': 'wa2010.mtx', 'density': 0.16996047430830039, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0024.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0024.png', 'edge_connectivity': 1}","[1, 2, 10, 12, 14, 15, 17, 18, 19, 20, 23]",11.0,"{'num_nodes': 23, 'num_edges': 43, 'edges': [{'u': 'I', 'v': 'A'}, {'u': 'I', 'v': 'F'}, {'u': 'I', 'v': 'H'}, {'u': 'I', 'v': 'P'}, {'u': 'I', 'v': 'Q'}, {'u': 'I', 'v': 'S'}, {'u': 'L', 'v': 'E'}, {'u': 'L', 'v': 'U'}, {'u': 'B', 'v': 'C'}, {'u': 'B', 'v': 'K'}, {'u': 'C', 'v': 'D'}, {'u': 'C', 'v': 'K'}, {'u': 'C', 'v': 'O'}, {'u': 'C', 'v': 'R'}, {'u': 'D', 'v': 'M'}, {'u': 'D', 'v': 'R'}, {'u': 'D', 'v': 'V'}, {'u': 'D', 'v': 'W'}, {'u': 'E', 'v': 'F'}, {'u': 'E', 'v': 'G'}, {'u': 'E', 'v': 'K'}, {'u': 'E', 'v': 'O'}, {'u': 'E', 'v': 'S'}, {'u': 'E', 'v': 'T'}, {'u': 'E', 'v': 'U'}, {'u': 'F', 'v': 'N'}, {'u': 'F', 'v': 'O'}, {'u': 'F', 'v': 'S'}, {'u': 'G', 'v': 'H'}, {'u': 'G', 'v': 'S'}, {'u': 'G', 'v': 'T'}, {'u': 'A', 'v': 'P'}, {'u': 'M', 'v': 'N'}, {'u': 'M', 'v': 'O'}, {'u': 'M', 'v': 'V'}, {'u': 'N', 'v': 'P'}, {'u': 'U', 'v': 'J'}, {'u': 'U', 'v': 'K'}, {'u': 'H', 'v': 'S'}, {'u': 'H', 'v': 'T'}, {'u': 'V', 'v': 'P'}, {'u': 'V', 'v': 'W'}, {'u': 'J', 'v': 'K'}]}","['A', 'B', 'J', 'L', 'N', 'O', 'Q', 'R', 'S', 'T', 'W']",25,csv,names
MIS,MIS,"There’s a bit of a puzzle in the office: pick which desks to use so the most people can work on-site without ever placing two folks who clash next to each other. What makes one choice better than another is simple — it seats more people, and that’s measured by tallying the occupied desks. The rules are straightforward: each desk gets at most one person and any pair marked as “shouldn’t sit together” cannot both be chosen. The specific floorplan and the list of those pairings are shown below.
There are 20 desks in total and 40 num conflict pairs.
| desk_a | desk_b |
|---|---|
| 2 | 7 |
| 2 | 16 |
| 2 | 18 |
| 8 | 5 |
| 8 | 13 |
| 8 | 17 |
| 18 | 7 |
| 18 | 12 |
| 18 | 13 |
| 18 | 16 |
| 14 | 4 |
| 14 | 11 |
| 14 | 20 |
| 16 | 6 |
| 16 | 7 |
| 16 | 9 |
| 16 | 11 |
| 16 | 13 |
| 16 | 17 |
| 16 | 20 |
| 17 | 4 |
| 17 | 6 |
| 1 | 4 |
| 1 | 15 |
| 19 | 3 |
| 19 | 4 |
| 19 | 10 |
| 3 | 4 |
| 3 | 10 |
| 3 | 15 |
| 9 | 4 |
| 9 | 6 |
| 9 | 20 |
| 10 | 4 |
| 11 | 20 |
| 12 | 5 |
| 12 | 13 |
| 4 | 5 |
| 4 | 6 |
| 4 | 15 |
If you want to give me the chosen desks, a tiny JSON snippet like this is perfect:
{
""solution"": [""desk_id"", ""desk_id"", ...]
}
Think of it like a simple list: ""solution"" holds the desks you picked, and each entry is the exact desk identifier from the floorplan. It's just a sketch of the shape I expect — swap those placeholders out for the real desk IDs when you send the actual answer.
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': 'MIS', 'num_nodes': 20, 'num_edges': 40, 'edges': [{'u': 2, 'v': 7}, {'u': 2, 'v': 16}, {'u': 2, 'v': 18}, {'u': 8, 'v': 5}, {'u': 8, 'v': 13}, {'u': 8, 'v': 17}, {'u': 18, 'v': 7}, {'u': 18, 'v': 12}, {'u': 18, 'v': 13}, {'u': 18, 'v': 16}, {'u': 14, 'v': 4}, {'u': 14, 'v': 11}, {'u': 14, 'v': 20}, {'u': 16, 'v': 6}, {'u': 16, 'v': 7}, {'u': 16, 'v': 9}, {'u': 16, 'v': 11}, {'u': 16, 'v': 13}, {'u': 16, 'v': 17}, {'u': 16, 'v': 20}, {'u': 17, 'v': 4}, {'u': 17, 'v': 6}, {'u': 1, 'v': 4}, {'u': 1, 'v': 15}, {'u': 19, 'v': 3}, {'u': 19, 'v': 4}, {'u': 19, 'v': 10}, {'u': 3, 'v': 4}, {'u': 3, 'v': 10}, {'u': 3, 'v': 15}, {'u': 9, 'v': 4}, {'u': 9, 'v': 6}, {'u': 9, 'v': 20}, {'u': 10, 'v': 4}, {'u': 11, 'v': 20}, {'u': 12, 'v': 5}, {'u': 12, 'v': 13}, {'u': 4, 'v': 5}, {'u': 4, 'v': 6}, {'u': 4, 'v': 15}], 'source_file': 'wv2010.mtx', 'density': 0.21052631578947367, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0025.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0025.png', 'edge_connectivity': 2}","[1, 2, 5, 9, 10, 13, 14, 17]",8.0,"{'num_nodes': 20, 'num_edges': 40, 'edges': [{'u': 2, 'v': 7}, {'u': 2, 'v': 16}, {'u': 2, 'v': 18}, {'u': 8, 'v': 5}, {'u': 8, 'v': 13}, {'u': 8, 'v': 17}, {'u': 18, 'v': 7}, {'u': 18, 'v': 12}, {'u': 18, 'v': 13}, {'u': 18, 'v': 16}, {'u': 14, 'v': 4}, {'u': 14, 'v': 11}, {'u': 14, 'v': 20}, {'u': 16, 'v': 6}, {'u': 16, 'v': 7}, {'u': 16, 'v': 9}, {'u': 16, 'v': 11}, {'u': 16, 'v': 13}, {'u': 16, 'v': 17}, {'u': 16, 'v': 20}, {'u': 17, 'v': 4}, {'u': 17, 'v': 6}, {'u': 1, 'v': 4}, {'u': 1, 'v': 15}, {'u': 19, 'v': 3}, {'u': 19, 'v': 4}, {'u': 19, 'v': 10}, {'u': 3, 'v': 4}, {'u': 3, 'v': 10}, {'u': 3, 'v': 15}, {'u': 9, 'v': 4}, {'u': 9, 'v': 6}, {'u': 9, 'v': 20}, {'u': 10, 'v': 4}, {'u': 11, 'v': 20}, {'u': 12, 'v': 5}, {'u': 12, 'v': 13}, {'u': 4, 'v': 5}, {'u': 4, 'v': 6}, {'u': 4, 'v': 15}]}","[1, 2, 5, 9, 10, 13, 14, 17]",26,markdown_table,1
MIS,MIS,"Out at the lake the weekend roster needs putting together, and the brief is to pick as many different activities as possible, with the catch that certain activities conflict and can’t be paired. The task is deciding which activities to slot into the program so none of the chosen ones are in conflict and the overall program is as large as it can be. You tell which plan is better by the number of activities it contains — simply count them to compare. Each activity chosen must be unique and must not clash with any other chosen activity; the concrete activity names and their conflict relationships are listed below.
There are 24 activities in total and 51 conflicts.
| activity_a | activity_b |
|---|---|
| 24 | 2 |
| 24 | 6 |
| 24 | 9 |
| 24 | 12 |
| 24 | 19 |
| 19 | 6 |
| 19 | 9 |
| 18 | 16 |
| 18 | 17 |
| 18 | 21 |
| 2 | 1 |
| 2 | 3 |
| 2 | 7 |
| 2 | 8 |
| 2 | 9 |
| 2 | 10 |
| 2 | 12 |
| 2 | 14 |
| 2 | 17 |
| 2 | 22 |
| 2 | 23 |
| 20 | 11 |
| 20 | 22 |
| 3 | 23 |
| 15 | 7 |
| 17 | 5 |
| 17 | 6 |
| 17 | 11 |
| 17 | 13 |
| 17 | 14 |
| 17 | 21 |
| 5 | 11 |
| 16 | 4 |
| 16 | 21 |
| 21 | 6 |
| 21 | 7 |
| 21 | 13 |
| 9 | 6 |
| 9 | 7 |
| 10 | 6 |
| 10 | 8 |
| 10 | 14 |
| 1 | 7 |
| 1 | 23 |
| 12 | 6 |
| 12 | 8 |
| 7 | 4 |
| 7 | 6 |
| 14 | 6 |
| 8 | 6 |
| 13 | 6 |
If you want to hand the answer back in a tidy, machine-friendly way, just drop the chosen activities into a tiny JSON snippet like this:
{
""solution"": [""activity_id"", ""activity_id"", ...]
}
Think of ""solution"" as the list of activities you've picked for the weekend roster — each entry should be the exact identifier for an activity from the instance. This JSON is just a sketch of the shape I expect, not the final filled-in answer.
Please use the 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': 'MIS', 'num_nodes': 24, 'num_edges': 51, 'edges': [{'u': 24, 'v': 2}, {'u': 24, 'v': 6}, {'u': 24, 'v': 9}, {'u': 24, 'v': 12}, {'u': 24, 'v': 19}, {'u': 19, 'v': 6}, {'u': 19, 'v': 9}, {'u': 18, 'v': 16}, {'u': 18, 'v': 17}, {'u': 18, 'v': 21}, {'u': 2, 'v': 1}, {'u': 2, 'v': 3}, {'u': 2, 'v': 7}, {'u': 2, 'v': 8}, {'u': 2, 'v': 9}, {'u': 2, 'v': 10}, {'u': 2, 'v': 12}, {'u': 2, 'v': 14}, {'u': 2, 'v': 17}, {'u': 2, 'v': 22}, {'u': 2, 'v': 23}, {'u': 20, 'v': 11}, {'u': 20, 'v': 22}, {'u': 3, 'v': 23}, {'u': 15, 'v': 7}, {'u': 17, 'v': 5}, {'u': 17, 'v': 6}, {'u': 17, 'v': 11}, {'u': 17, 'v': 13}, {'u': 17, 'v': 14}, {'u': 17, 'v': 21}, {'u': 5, 'v': 11}, {'u': 16, 'v': 4}, {'u': 16, 'v': 21}, {'u': 21, 'v': 6}, {'u': 21, 'v': 7}, {'u': 21, 'v': 13}, {'u': 9, 'v': 6}, {'u': 9, 'v': 7}, {'u': 10, 'v': 6}, {'u': 10, 'v': 8}, {'u': 10, 'v': 14}, {'u': 1, 'v': 7}, {'u': 1, 'v': 23}, {'u': 12, 'v': 6}, {'u': 12, 'v': 8}, {'u': 7, 'v': 4}, {'u': 7, 'v': 6}, {'u': 14, 'v': 6}, {'u': 8, 'v': 6}, {'u': 13, 'v': 6}], 'source_file': 'wi2010.mtx', 'density': 0.18478260869565216, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0026.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0026.png', 'edge_connectivity': 1}","[1, 3, 4, 5, 12, 13, 14, 15, 18, 19, 20]",11.0,"{'num_nodes': 24, 'num_edges': 51, 'edges': [{'u': 24, 'v': 2}, {'u': 24, 'v': 6}, {'u': 24, 'v': 9}, {'u': 24, 'v': 12}, {'u': 24, 'v': 19}, {'u': 19, 'v': 6}, {'u': 19, 'v': 9}, {'u': 18, 'v': 16}, {'u': 18, 'v': 17}, {'u': 18, 'v': 21}, {'u': 2, 'v': 1}, {'u': 2, 'v': 3}, {'u': 2, 'v': 7}, {'u': 2, 'v': 8}, {'u': 2, 'v': 9}, {'u': 2, 'v': 10}, {'u': 2, 'v': 12}, {'u': 2, 'v': 14}, {'u': 2, 'v': 17}, {'u': 2, 'v': 22}, {'u': 2, 'v': 23}, {'u': 20, 'v': 11}, {'u': 20, 'v': 22}, {'u': 3, 'v': 23}, {'u': 15, 'v': 7}, {'u': 17, 'v': 5}, {'u': 17, 'v': 6}, {'u': 17, 'v': 11}, {'u': 17, 'v': 13}, {'u': 17, 'v': 14}, {'u': 17, 'v': 21}, {'u': 5, 'v': 11}, {'u': 16, 'v': 4}, {'u': 16, 'v': 21}, {'u': 21, 'v': 6}, {'u': 21, 'v': 7}, {'u': 21, 'v': 13}, {'u': 9, 'v': 6}, {'u': 9, 'v': 7}, {'u': 10, 'v': 6}, {'u': 10, 'v': 8}, {'u': 10, 'v': 14}, {'u': 1, 'v': 7}, {'u': 1, 'v': 23}, {'u': 12, 'v': 6}, {'u': 12, 'v': 8}, {'u': 7, 'v': 4}, {'u': 7, 'v': 6}, {'u': 14, 'v': 6}, {'u': 8, 'v': 6}, {'u': 13, 'v': 6}]}","[1, 3, 4, 5, 12, 13, 14, 15, 18, 19, 20]",27,markdown_table,1
MIS,MIS,"I’m organizing the readings for a wedding and need to pick as many pieces as possible for the ceremony, but some of those readings clash with each other and can’t both be used. The job is to assemble the biggest collection of readings that don’t conflict — the better the plan, the more readings it contains, so the plan is judged simply by counting how many are included. Each reading can only be used once and clashing pairs must never both be chosen. The exact list of readings and which ones clash will be shown below.
{
""total_readings_count"": 24,
""total_conflicts_count"": 43,
""edges"": [
{
""reading_a"": ""O"",
""reading_b"": ""E""
},
{
""reading_a"": ""O"",
""reading_b"": ""N""
},
{
""reading_a"": ""O"",
""reading_b"": ""V""
},
{
""reading_a"": ""O"",
""reading_b"": ""W""
},
{
""reading_a"": ""P"",
""reading_b"": ""F""
},
{
""reading_a"": ""P"",
""reading_b"": ""I""
},
{
""reading_a"": ""P"",
""reading_b"": ""Q""
},
{
""reading_a"": ""P"",
""reading_b"": ""R""
},
{
""reading_a"": ""P"",
""reading_b"": ""V""
},
{
""reading_a"": ""Q"",
""reading_b"": ""A""
},
{
""reading_a"": ""Q"",
""reading_b"": ""D""
},
{
""reading_a"": ""Q"",
""reading_b"": ""E""
},
{
""reading_a"": ""Q"",
""reading_b"": ""M""
},
{
""reading_a"": ""Q"",
""reading_b"": ""T""
},
{
""reading_a"": ""Q"",
""reading_b"": ""U""
},
{
""reading_a"": ""Q"",
""reading_b"": ""V""
},
{
""reading_a"": ""Q"",
""reading_b"": ""X""
},
{
""reading_a"": ""R"",
""reading_b"": ""I""
},
{
""reading_a"": ""R"",
""reading_b"": ""J""
},
{
""reading_a"": ""R"",
""reading_b"": ""M""
},
{
""reading_a"": ""D"",
""reading_b"": ""M""
},
{
""reading_a"": ""T"",
""reading_b"": ""A""
},
{
""reading_a"": ""T"",
""reading_b"": ""U""
},
{
""reading_a"": ""S"",
""reading_b"": ""H""
},
{
""reading_a"": ""S"",
""reading_b"": ""N""
},
{
""reading_a"": ""S"",
""reading_b"": ""V""
},
{
""reading_a"": ""B"",
""reading_b"": ""K""
},
{
""reading_a"": ""B"",
""reading_b"": ""W""
},
{
""reading_a"": ""I"",
""reading_b"": ""F""
},
{
""reading_a"": ""I"",
""reading_b"": ""J""
},
{
""reading_a"": ""W"",
""reading_b"": ""C""
},
{
""reading_a"": ""W"",
""reading_b"": ""J""
},
{
""reading_a"": ""W"",
""reading_b"": ""K""
},
{
""reading_a"": ""W"",
""reading_b"": ""L""
},
{
""reading_a"": ""W"",
""reading_b"": ""M""
},
{
""reading_a"": ""G"",
""reading_b"": ""C""
},
{
""reading_a"": ""A"",
""reading_b"": ""M""
},
{
""reading_a"": ""E"",
""reading_b"": ""M""
},
{
""reading_a"": ""E"",
""reading_b"": ""V""
},
{
""reading_a"": ""H"",
""reading_b"": ""V""
},
{
""reading_a"": ""L"",
""reading_b"": ""C""
},
{
""reading_a"": ""L"",
""reading_b"": ""J""
},
{
""reading_a"": ""N"",
""reading_b"": ""V""
}
]
}
If you could send your final plan in a tiny, predictable format, that would be great — something like this JSON sketch so I can quickly check which readings you picked:
{
""solution"": [""reading_id"", ""reading_id"", ...]
}
Here ""solution"" is just the list of readings you want to use — each entry should be the reading's identifier from the instance. Think of it like filling in a simple form: put each chosen reading's ID inside the array, comma-separated. This block is just a template showing 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, 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': 'MIS', 'num_nodes': 24, 'num_edges': 43, 'edges': [{'u': 15, 'v': 5}, {'u': 15, 'v': 14}, {'u': 15, 'v': 22}, {'u': 15, 'v': 23}, {'u': 16, 'v': 6}, {'u': 16, 'v': 9}, {'u': 16, 'v': 17}, {'u': 16, 'v': 18}, {'u': 16, 'v': 22}, {'u': 17, 'v': 1}, {'u': 17, 'v': 4}, {'u': 17, 'v': 5}, {'u': 17, 'v': 13}, {'u': 17, 'v': 20}, {'u': 17, 'v': 21}, {'u': 17, 'v': 22}, {'u': 17, 'v': 24}, {'u': 18, 'v': 9}, {'u': 18, 'v': 10}, {'u': 18, 'v': 13}, {'u': 4, 'v': 13}, {'u': 20, 'v': 1}, {'u': 20, 'v': 21}, {'u': 19, 'v': 8}, {'u': 19, 'v': 14}, {'u': 19, 'v': 22}, {'u': 2, 'v': 11}, {'u': 2, 'v': 23}, {'u': 9, 'v': 6}, {'u': 9, 'v': 10}, {'u': 23, 'v': 3}, {'u': 23, 'v': 10}, {'u': 23, 'v': 11}, {'u': 23, 'v': 12}, {'u': 23, 'v': 13}, {'u': 7, 'v': 3}, {'u': 1, 'v': 13}, {'u': 5, 'v': 13}, {'u': 5, 'v': 22}, {'u': 8, 'v': 22}, {'u': 12, 'v': 3}, {'u': 12, 'v': 10}, {'u': 14, 'v': 22}], 'source_file': 'wi2010.mtx', 'density': 0.15579710144927536, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0027.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0027.png', 'edge_connectivity': 1}","[1, 4, 5, 6, 7, 8, 11, 12, 14, 18, 21, 24]",12.0,"{'num_nodes': 24, 'num_edges': 43, 'edges': [{'u': 'O', 'v': 'E'}, {'u': 'O', 'v': 'N'}, {'u': 'O', 'v': 'V'}, {'u': 'O', 'v': 'W'}, {'u': 'P', 'v': 'F'}, {'u': 'P', 'v': 'I'}, {'u': 'P', 'v': 'Q'}, {'u': 'P', 'v': 'R'}, {'u': 'P', 'v': 'V'}, {'u': 'Q', 'v': 'A'}, {'u': 'Q', 'v': 'D'}, {'u': 'Q', 'v': 'E'}, {'u': 'Q', 'v': 'M'}, {'u': 'Q', 'v': 'T'}, {'u': 'Q', 'v': 'U'}, {'u': 'Q', 'v': 'V'}, {'u': 'Q', 'v': 'X'}, {'u': 'R', 'v': 'I'}, {'u': 'R', 'v': 'J'}, {'u': 'R', 'v': 'M'}, {'u': 'D', 'v': 'M'}, {'u': 'T', 'v': 'A'}, {'u': 'T', 'v': 'U'}, {'u': 'S', 'v': 'H'}, {'u': 'S', 'v': 'N'}, {'u': 'S', 'v': 'V'}, {'u': 'B', 'v': 'K'}, {'u': 'B', 'v': 'W'}, {'u': 'I', 'v': 'F'}, {'u': 'I', 'v': 'J'}, {'u': 'W', 'v': 'C'}, {'u': 'W', 'v': 'J'}, {'u': 'W', 'v': 'K'}, {'u': 'W', 'v': 'L'}, {'u': 'W', 'v': 'M'}, {'u': 'G', 'v': 'C'}, {'u': 'A', 'v': 'M'}, {'u': 'E', 'v': 'M'}, {'u': 'E', 'v': 'V'}, {'u': 'H', 'v': 'V'}, {'u': 'L', 'v': 'C'}, {'u': 'L', 'v': 'J'}, {'u': 'N', 'v': 'V'}]}","['A', 'D', 'E', 'F', 'G', 'H', 'K', 'L', 'N', 'R', 'U', 'X']",28,json,names
MIS,MIS,"Someone at the shelter has to go through the list and pick which animals can go into the communal play area; the aim is to allow as many animals as possible while never putting any pair that fights into the same session. Success is measured by how many animals get the green light — higher is better — and you get that by counting the approved animals. No animal can be approved twice and no selection may include two animals that clash. The concrete details will be shown below.
{
""total_animals"": 24,
""total_conflicts"": 48,
""edges"": [
{
""animal_a_id"": 20,
""animal_b_id"": 4
},
{
""animal_a_id"": 20,
""animal_b_id"": 5
},
{
""animal_a_id"": 20,
""animal_b_id"": 11
},
{
""animal_a_id"": 10,
""animal_b_id"": 5
},
{
""animal_a_id"": 10,
""animal_b_id"": 6
},
{
""animal_a_id"": 10,
""animal_b_id"": 9
},
{
""animal_a_id"": 10,
""animal_b_id"": 14
},
{
""animal_a_id"": 10,
""animal_b_id"": 17
},
{
""animal_a_id"": 11,
""animal_b_id"": 1
},
{
""animal_a_id"": 11,
""animal_b_id"": 5
},
{
""animal_a_id"": 11,
""animal_b_id"": 14
},
{
""animal_a_id"": 7,
""animal_b_id"": 1
},
{
""animal_a_id"": 7,
""animal_b_id"": 3
},
{
""animal_a_id"": 7,
""animal_b_id"": 4
},
{
""animal_a_id"": 7,
""animal_b_id"": 9
},
{
""animal_a_id"": 8,
""animal_b_id"": 3
},
{
""animal_a_id"": 8,
""animal_b_id"": 9
},
{
""animal_a_id"": 8,
""animal_b_id"": 17
},
{
""animal_a_id"": 8,
""animal_b_id"": 19
},
{
""animal_a_id"": 8,
""animal_b_id"": 22
},
{
""animal_a_id"": 9,
""animal_b_id"": 4
},
{
""animal_a_id"": 23,
""animal_b_id"": 0
},
{
""animal_a_id"": 23,
""animal_b_id"": 21
},
{
""animal_a_id"": 21,
""animal_b_id"": 0
},
{
""animal_a_id"": 21,
""animal_b_id"": 2
},
{
""animal_a_id"": 21,
""animal_b_id"": 15
},
{
""animal_a_id"": 12,
""animal_b_id"": 2
},
{
""animal_a_id"": 12,
""animal_b_id"": 6
},
{
""animal_a_id"": 12,
""animal_b_id"": 13
},
{
""animal_a_id"": 12,
""animal_b_id"": 17
},
{
""animal_a_id"": 12,
""animal_b_id"": 18
},
{
""animal_a_id"": 13,
""animal_b_id"": 16
},
{
""animal_a_id"": 13,
""animal_b_id"": 18
},
{
""animal_a_id"": 13,
""animal_b_id"": 19
},
{
""animal_a_id"": 2,
""animal_b_id"": 15
},
{
""animal_a_id"": 2,
""animal_b_id"": 18
},
{
""animal_a_id"": 14,
""animal_b_id"": 5
},
{
""animal_a_id"": 14,
""animal_b_id"": 6
},
{
""animal_a_id"": 14,
""animal_b_id"": 15
},
{
""animal_a_id"": 15,
""animal_b_id"": 6
},
{
""animal_a_id"": 16,
""animal_b_id"": 19
},
{
""animal_a_id"": 17,
""animal_b_id"": 19
},
{
""animal_a_id"": 18,
""animal_b_id"": 0
},
{
""animal_a_id"": 18,
""animal_b_id"": 19
},
{
""animal_a_id"": 19,
""animal_b_id"": 0
},
{
""animal_a_id"": 22,
""animal_b_id"": 0
},
{
""animal_a_id"": 4,
""animal_b_id"": 1
},
{
""animal_a_id"": 4,
""animal_b_id"": 5
}
]
}
Also, when you hand back which animals get the green light, please use this simple JSON layout so it's easy to read and validate:
{
""solution"": [""animal_id"", ""animal_id"", ...]
}
Think of ""solution"" as the list of animal IDs you're approving for the communal play area. Each entry in that array should be the exact identifier for an animal from the input (one per animal, no duplicates). This JSON is just a sketch of the expected shape — fill it with the actual IDs when you're ready.
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': 'MIS', 'num_nodes': 24, 'num_edges': 48, 'edges': [{'u': 21, 'v': 5}, {'u': 21, 'v': 6}, {'u': 21, 'v': 12}, {'u': 11, 'v': 6}, {'u': 11, 'v': 7}, {'u': 11, 'v': 10}, {'u': 11, 'v': 15}, {'u': 11, 'v': 18}, {'u': 12, 'v': 2}, {'u': 12, 'v': 6}, {'u': 12, 'v': 15}, {'u': 8, 'v': 2}, {'u': 8, 'v': 4}, {'u': 8, 'v': 5}, {'u': 8, 'v': 10}, {'u': 9, 'v': 4}, {'u': 9, 'v': 10}, {'u': 9, 'v': 18}, {'u': 9, 'v': 20}, {'u': 9, 'v': 23}, {'u': 10, 'v': 5}, {'u': 24, 'v': 1}, {'u': 24, 'v': 22}, {'u': 22, 'v': 1}, {'u': 22, 'v': 3}, {'u': 22, 'v': 16}, {'u': 13, 'v': 3}, {'u': 13, 'v': 7}, {'u': 13, 'v': 14}, {'u': 13, 'v': 18}, {'u': 13, 'v': 19}, {'u': 14, 'v': 17}, {'u': 14, 'v': 19}, {'u': 14, 'v': 20}, {'u': 3, 'v': 16}, {'u': 3, 'v': 19}, {'u': 15, 'v': 6}, {'u': 15, 'v': 7}, {'u': 15, 'v': 16}, {'u': 16, 'v': 7}, {'u': 17, 'v': 20}, {'u': 18, 'v': 20}, {'u': 19, 'v': 1}, {'u': 19, 'v': 20}, {'u': 20, 'v': 1}, {'u': 23, 'v': 1}, {'u': 5, 'v': 2}, {'u': 5, 'v': 6}], 'source_file': 'wi2010.mtx', 'density': 0.17391304347826086, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0028.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0028.png', 'edge_connectivity': 2}","[2, 4, 10, 16, 17, 18, 19, 21, 23, 24]",10.0,"{'num_nodes': 24, 'num_edges': 48, 'edges': [{'u': 20, 'v': 4}, {'u': 20, 'v': 5}, {'u': 20, 'v': 11}, {'u': 10, 'v': 5}, {'u': 10, 'v': 6}, {'u': 10, 'v': 9}, {'u': 10, 'v': 14}, {'u': 10, 'v': 17}, {'u': 11, 'v': 1}, {'u': 11, 'v': 5}, {'u': 11, 'v': 14}, {'u': 7, 'v': 1}, {'u': 7, 'v': 3}, {'u': 7, 'v': 4}, {'u': 7, 'v': 9}, {'u': 8, 'v': 3}, {'u': 8, 'v': 9}, {'u': 8, 'v': 17}, {'u': 8, 'v': 19}, {'u': 8, 'v': 22}, {'u': 9, 'v': 4}, {'u': 23, 'v': 0}, {'u': 23, 'v': 21}, {'u': 21, 'v': 0}, {'u': 21, 'v': 2}, {'u': 21, 'v': 15}, {'u': 12, 'v': 2}, {'u': 12, 'v': 6}, {'u': 12, 'v': 13}, {'u': 12, 'v': 17}, {'u': 12, 'v': 18}, {'u': 13, 'v': 16}, {'u': 13, 'v': 18}, {'u': 13, 'v': 19}, {'u': 2, 'v': 15}, {'u': 2, 'v': 18}, {'u': 14, 'v': 5}, {'u': 14, 'v': 6}, {'u': 14, 'v': 15}, {'u': 15, 'v': 6}, {'u': 16, 'v': 19}, {'u': 17, 'v': 19}, {'u': 18, 'v': 0}, {'u': 18, 'v': 19}, {'u': 19, 'v': 0}, {'u': 22, 'v': 0}, {'u': 4, 'v': 1}, {'u': 4, 'v': 5}]}","[1, 3, 9, 15, 16, 17, 18, 20, 22, 23]",29,json,0
MIS,MIS,"There’s a corner plot everyone loves, and the plan is to plant the most diverse collection of shrubs without sitting together any pair that emit chemicals that hurt each other. The choice is about which shrubs to include so no two conflicting types end up planted side by side. The way to tell if a plan is better is straightforward: count how many different shrubs are in the bed — the higher the count, the better the plan. Each variety can only be used once and every selected plant must actually be in the bed. The concrete details are shown below.
There are 23 shrub varieties in total and 43 conflicting pairs.
| shrub_a_id | shrub_b_id |
|---|---|
| P | K |
| P | S |
| P | W |
| N | T |
| G | D |
| G | F |
| G | I |
| G | M |
| G | R |
| O | B |
| O | C |
| O | D |
| O | E |
| O | I |
| O | L |
| O | Q |
| H | K |
| H | Q |
| I | B |
| I | L |
| I | M |
| A | F |
| A | K |
| A | U |
| A | W |
| U | F |
| U | W |
| S | K |
| S | W |
| T | C |
| T | J |
| T | Q |
| J | K |
| J | V |
| D | L |
| D | M |
| D | Q |
| E | Q |
| F | Q |
| F | R |
| M | L |
| V | K |
| Q | K |
When you send the planting plan back, just stick to a tiny JSON snippet like this so I can read it easily:
{
""solution"": [""shrub_id"", ""shrub_id"", ...]
}
Here, ""solution"" is the list of shrubs you want in the bed — each entry is just the ID for a shrub. Think of it like filling out a short form: one ID per chosen shrub. This JSON is just the expected shape (a sketch), 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': 'MIS', 'num_nodes': 23, 'num_edges': 43, 'edges': [{'u': 16, 'v': 11}, {'u': 16, 'v': 19}, {'u': 16, 'v': 23}, {'u': 14, 'v': 20}, {'u': 7, 'v': 4}, {'u': 7, 'v': 6}, {'u': 7, 'v': 9}, {'u': 7, 'v': 13}, {'u': 7, 'v': 18}, {'u': 15, 'v': 2}, {'u': 15, 'v': 3}, {'u': 15, 'v': 4}, {'u': 15, 'v': 5}, {'u': 15, 'v': 9}, {'u': 15, 'v': 12}, {'u': 15, 'v': 17}, {'u': 8, 'v': 11}, {'u': 8, 'v': 17}, {'u': 9, 'v': 2}, {'u': 9, 'v': 12}, {'u': 9, 'v': 13}, {'u': 1, 'v': 6}, {'u': 1, 'v': 11}, {'u': 1, 'v': 21}, {'u': 1, 'v': 23}, {'u': 21, 'v': 6}, {'u': 21, 'v': 23}, {'u': 19, 'v': 11}, {'u': 19, 'v': 23}, {'u': 20, 'v': 3}, {'u': 20, 'v': 10}, {'u': 20, 'v': 17}, {'u': 10, 'v': 11}, {'u': 10, 'v': 22}, {'u': 4, 'v': 12}, {'u': 4, 'v': 13}, {'u': 4, 'v': 17}, {'u': 5, 'v': 17}, {'u': 6, 'v': 17}, {'u': 6, 'v': 18}, {'u': 13, 'v': 12}, {'u': 22, 'v': 11}, {'u': 17, 'v': 11}], 'source_file': 'vt2010.mtx', 'density': 0.16996047430830039, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0029.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0029.png', 'edge_connectivity': 1}","[2, 3, 4, 5, 8, 14, 18, 19, 21, 22]",10.0,"{'num_nodes': 23, 'num_edges': 43, 'edges': [{'u': 'P', 'v': 'K'}, {'u': 'P', 'v': 'S'}, {'u': 'P', 'v': 'W'}, {'u': 'N', 'v': 'T'}, {'u': 'G', 'v': 'D'}, {'u': 'G', 'v': 'F'}, {'u': 'G', 'v': 'I'}, {'u': 'G', 'v': 'M'}, {'u': 'G', 'v': 'R'}, {'u': 'O', 'v': 'B'}, {'u': 'O', 'v': 'C'}, {'u': 'O', 'v': 'D'}, {'u': 'O', 'v': 'E'}, {'u': 'O', 'v': 'I'}, {'u': 'O', 'v': 'L'}, {'u': 'O', 'v': 'Q'}, {'u': 'H', 'v': 'K'}, {'u': 'H', 'v': 'Q'}, {'u': 'I', 'v': 'B'}, {'u': 'I', 'v': 'L'}, {'u': 'I', 'v': 'M'}, {'u': 'A', 'v': 'F'}, {'u': 'A', 'v': 'K'}, {'u': 'A', 'v': 'U'}, {'u': 'A', 'v': 'W'}, {'u': 'U', 'v': 'F'}, {'u': 'U', 'v': 'W'}, {'u': 'S', 'v': 'K'}, {'u': 'S', 'v': 'W'}, {'u': 'T', 'v': 'C'}, {'u': 'T', 'v': 'J'}, {'u': 'T', 'v': 'Q'}, {'u': 'J', 'v': 'K'}, {'u': 'J', 'v': 'V'}, {'u': 'D', 'v': 'L'}, {'u': 'D', 'v': 'M'}, {'u': 'D', 'v': 'Q'}, {'u': 'E', 'v': 'Q'}, {'u': 'F', 'v': 'Q'}, {'u': 'F', 'v': 'R'}, {'u': 'M', 'v': 'L'}, {'u': 'V', 'v': 'K'}, {'u': 'Q', 'v': 'K'}]}","['B', 'C', 'D', 'E', 'H', 'N', 'R', 'S', 'U', 'V']",30,markdown_table,names
MIS,MIS,"We’ve got one showy mannequin and a pile of accessories to choose from, and the job is to pick the largest possible set that looks harmonious — no two items that clash should be included side by side. Success here is measured by the total number of accessories placed in the window: just tally up the selected pieces and try to make that number as high as possible. Every item is unique (can’t be used twice) and any pair that conflicts must not both be selected. The exact items and the clash notes are given below.
{
""total_accessories"": 22,
""total_clashes"": 43,
""edges"": [
{
""accessory_a"": 17,
""accessory_b"": 9
},
{
""accessory_a"": 17,
""accessory_b"": 13
},
{
""accessory_a"": 17,
""accessory_b"": 14
},
{
""accessory_a"": 17,
""accessory_b"": 21
},
{
""accessory_a"": 18,
""accessory_b"": 1
},
{
""accessory_a"": 18,
""accessory_b"": 10
},
{
""accessory_a"": 19,
""accessory_b"": 4
},
{
""accessory_a"": 19,
""accessory_b"": 10
},
{
""accessory_a"": 19,
""accessory_b"": 12
},
{
""accessory_a"": 19,
""accessory_b"": 22
},
{
""accessory_a"": 12,
""accessory_b"": 3
},
{
""accessory_a"": 12,
""accessory_b"": 8
},
{
""accessory_a"": 6,
""accessory_b"": 16
},
{
""accessory_a"": 6,
""accessory_b"": 21
},
{
""accessory_a"": 7,
""accessory_b"": 1
},
{
""accessory_a"": 7,
""accessory_b"": 10
},
{
""accessory_a"": 7,
""accessory_b"": 22
},
{
""accessory_a"": 4,
""accessory_b"": 8
},
{
""accessory_a"": 4,
""accessory_b"": 10
},
{
""accessory_a"": 4,
""accessory_b"": 14
},
{
""accessory_a"": 20,
""accessory_b"": 5
},
{
""accessory_a"": 20,
""accessory_b"": 10
},
{
""accessory_a"": 5,
""accessory_b"": 11
},
{
""accessory_a"": 5,
""accessory_b"": 21
},
{
""accessory_a"": 8,
""accessory_b"": 3
},
{
""accessory_a"": 8,
""accessory_b"": 13
},
{
""accessory_a"": 21,
""accessory_b"": 9
},
{
""accessory_a"": 21,
""accessory_b"": 11
},
{
""accessory_a"": 21,
""accessory_b"": 13
},
{
""accessory_a"": 21,
""accessory_b"": 15
},
{
""accessory_a"": 21,
""accessory_b"": 16
},
{
""accessory_a"": 16,
""accessory_b"": 13
},
{
""accessory_a"": 1,
""accessory_b"": 10
},
{
""accessory_a"": 13,
""accessory_b"": 2
},
{
""accessory_a"": 13,
""accessory_b"": 9
},
{
""accessory_a"": 13,
""accessory_b"": 14
},
{
""accessory_a"": 22,
""accessory_b"": 10
},
{
""accessory_a"": 10,
""accessory_b"": 11
},
{
""accessory_a"": 10,
""accessory_b"": 14
},
{
""accessory_a"": 10,
""accessory_b"": 15
},
{
""accessory_a"": 14,
""accessory_b"": 15
},
{
""accessory_a"": 15,
""accessory_b"": 11
},
{
""accessory_a"": 2,
""accessory_b"": 3
}
]
}
Oh, and when you send back the picks, please use this simple JSON layout so it's easy to check automatically:
{
""solution"": [""accessory_id"", ""accessory_id"", ...]
}
The ""solution"" list should contain the identifiers of the accessories you want in the window — one entry per chosen piece. Think of it like filling out a short form: put each chosen item's ID in that array. This JSON is just a sketch of the shape I need, not the actual final selection.
Please be 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': 'MIS', 'num_nodes': 22, 'num_edges': 43, 'edges': [{'u': 17, 'v': 9}, {'u': 17, 'v': 13}, {'u': 17, 'v': 14}, {'u': 17, 'v': 21}, {'u': 18, 'v': 1}, {'u': 18, 'v': 10}, {'u': 19, 'v': 4}, {'u': 19, 'v': 10}, {'u': 19, 'v': 12}, {'u': 19, 'v': 22}, {'u': 12, 'v': 3}, {'u': 12, 'v': 8}, {'u': 6, 'v': 16}, {'u': 6, 'v': 21}, {'u': 7, 'v': 1}, {'u': 7, 'v': 10}, {'u': 7, 'v': 22}, {'u': 4, 'v': 8}, {'u': 4, 'v': 10}, {'u': 4, 'v': 14}, {'u': 20, 'v': 5}, {'u': 20, 'v': 10}, {'u': 5, 'v': 11}, {'u': 5, 'v': 21}, {'u': 8, 'v': 3}, {'u': 8, 'v': 13}, {'u': 21, 'v': 9}, {'u': 21, 'v': 11}, {'u': 21, 'v': 13}, {'u': 21, 'v': 15}, {'u': 21, 'v': 16}, {'u': 16, 'v': 13}, {'u': 1, 'v': 10}, {'u': 13, 'v': 2}, {'u': 13, 'v': 9}, {'u': 13, 'v': 14}, {'u': 22, 'v': 10}, {'u': 10, 'v': 11}, {'u': 10, 'v': 14}, {'u': 10, 'v': 15}, {'u': 14, 'v': 15}, {'u': 15, 'v': 11}, {'u': 2, 'v': 3}], 'source_file': 'wa2010.mtx', 'density': 0.18614718614718614, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0030.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0030.png', 'edge_connectivity': 2}","[2, 6, 7, 8, 9, 11, 14, 18, 19, 20]",10.0,"{'num_nodes': 22, 'num_edges': 43, 'edges': [{'u': 17, 'v': 9}, {'u': 17, 'v': 13}, {'u': 17, 'v': 14}, {'u': 17, 'v': 21}, {'u': 18, 'v': 1}, {'u': 18, 'v': 10}, {'u': 19, 'v': 4}, {'u': 19, 'v': 10}, {'u': 19, 'v': 12}, {'u': 19, 'v': 22}, {'u': 12, 'v': 3}, {'u': 12, 'v': 8}, {'u': 6, 'v': 16}, {'u': 6, 'v': 21}, {'u': 7, 'v': 1}, {'u': 7, 'v': 10}, {'u': 7, 'v': 22}, {'u': 4, 'v': 8}, {'u': 4, 'v': 10}, {'u': 4, 'v': 14}, {'u': 20, 'v': 5}, {'u': 20, 'v': 10}, {'u': 5, 'v': 11}, {'u': 5, 'v': 21}, {'u': 8, 'v': 3}, {'u': 8, 'v': 13}, {'u': 21, 'v': 9}, {'u': 21, 'v': 11}, {'u': 21, 'v': 13}, {'u': 21, 'v': 15}, {'u': 21, 'v': 16}, {'u': 16, 'v': 13}, {'u': 1, 'v': 10}, {'u': 13, 'v': 2}, {'u': 13, 'v': 9}, {'u': 13, 'v': 14}, {'u': 22, 'v': 10}, {'u': 10, 'v': 11}, {'u': 10, 'v': 14}, {'u': 10, 'v': 15}, {'u': 14, 'v': 15}, {'u': 15, 'v': 11}, {'u': 2, 'v': 3}]}","[2, 6, 7, 8, 9, 11, 14, 18, 19, 20]",31,json,1
MIS,MIS,"Recently the conference committee realized a simple rule would make panels smoother: try to include as many speakers as possible without seating together anyone who’s publicly argued. The “best” panel in this sense is the one that ends up with the most individual invitees — just count them — and it can’t contain any pair who have a public disagreement. Every person is either invited or not, and duplicates aren’t allowed. The detailed speaker roster and conflict info are shown below.
There are 20 speakers in total and 43 conflicts.
| speaker_id_a | speaker_id_b |
|---|---|
| 1 | 0 |
| 1 | 9 |
| 6 | 10 |
| 6 | 12 |
| 6 | 18 |
| 6 | 19 |
| 2 | 9 |
| 2 | 14 |
| 2 | 15 |
| 2 | 18 |
| 3 | 5 |
| 3 | 14 |
| 3 | 18 |
| 7 | 5 |
| 7 | 11 |
| 7 | 18 |
| 8 | 4 |
| 8 | 5 |
| 8 | 12 |
| 14 | 0 |
| 14 | 5 |
| 14 | 9 |
| 14 | 13 |
| 14 | 17 |
| 14 | 18 |
| 10 | 12 |
| 16 | 4 |
| 16 | 13 |
| 16 | 17 |
| 15 | 18 |
| 15 | 19 |
| 17 | 5 |
| 17 | 13 |
| 13 | 0 |
| 4 | 5 |
| 4 | 12 |
| 19 | 9 |
| 19 | 18 |
| 0 | 9 |
| 5 | 11 |
| 5 | 12 |
| 5 | 18 |
| 18 | 12 |
Oh, and when you send back the final invite list, a tiny JSON snippet like this is easiest to handle:
{
""solution"": [""speaker_id"", ""speaker_id"", ...]
}
Think of ""solution"" as the list of invited speaker IDs — just the IDs, nothing fancy. This JSON 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 — 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': 'MIS', 'num_nodes': 20, 'num_edges': 43, 'edges': [{'u': 2, 'v': 1}, {'u': 2, 'v': 10}, {'u': 7, 'v': 11}, {'u': 7, 'v': 13}, {'u': 7, 'v': 19}, {'u': 7, 'v': 20}, {'u': 3, 'v': 10}, {'u': 3, 'v': 15}, {'u': 3, 'v': 16}, {'u': 3, 'v': 19}, {'u': 4, 'v': 6}, {'u': 4, 'v': 15}, {'u': 4, 'v': 19}, {'u': 8, 'v': 6}, {'u': 8, 'v': 12}, {'u': 8, 'v': 19}, {'u': 9, 'v': 5}, {'u': 9, 'v': 6}, {'u': 9, 'v': 13}, {'u': 15, 'v': 1}, {'u': 15, 'v': 6}, {'u': 15, 'v': 10}, {'u': 15, 'v': 14}, {'u': 15, 'v': 18}, {'u': 15, 'v': 19}, {'u': 11, 'v': 13}, {'u': 17, 'v': 5}, {'u': 17, 'v': 14}, {'u': 17, 'v': 18}, {'u': 16, 'v': 19}, {'u': 16, 'v': 20}, {'u': 18, 'v': 6}, {'u': 18, 'v': 14}, {'u': 14, 'v': 1}, {'u': 5, 'v': 6}, {'u': 5, 'v': 13}, {'u': 20, 'v': 10}, {'u': 20, 'v': 19}, {'u': 1, 'v': 10}, {'u': 6, 'v': 12}, {'u': 6, 'v': 13}, {'u': 6, 'v': 19}, {'u': 19, 'v': 13}], 'source_file': 'wa2010.mtx', 'density': 0.22631578947368422, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0031.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0031.png', 'edge_connectivity': 2}","[2, 3, 4, 9, 11, 12, 18, 20]",8.0,"{'num_nodes': 20, 'num_edges': 43, 'edges': [{'u': 1, 'v': 0}, {'u': 1, 'v': 9}, {'u': 6, 'v': 10}, {'u': 6, 'v': 12}, {'u': 6, 'v': 18}, {'u': 6, 'v': 19}, {'u': 2, 'v': 9}, {'u': 2, 'v': 14}, {'u': 2, 'v': 15}, {'u': 2, 'v': 18}, {'u': 3, 'v': 5}, {'u': 3, 'v': 14}, {'u': 3, 'v': 18}, {'u': 7, 'v': 5}, {'u': 7, 'v': 11}, {'u': 7, 'v': 18}, {'u': 8, 'v': 4}, {'u': 8, 'v': 5}, {'u': 8, 'v': 12}, {'u': 14, 'v': 0}, {'u': 14, 'v': 5}, {'u': 14, 'v': 9}, {'u': 14, 'v': 13}, {'u': 14, 'v': 17}, {'u': 14, 'v': 18}, {'u': 10, 'v': 12}, {'u': 16, 'v': 4}, {'u': 16, 'v': 13}, {'u': 16, 'v': 17}, {'u': 15, 'v': 18}, {'u': 15, 'v': 19}, {'u': 17, 'v': 5}, {'u': 17, 'v': 13}, {'u': 13, 'v': 0}, {'u': 4, 'v': 5}, {'u': 4, 'v': 12}, {'u': 19, 'v': 9}, {'u': 19, 'v': 18}, {'u': 0, 'v': 9}, {'u': 5, 'v': 11}, {'u': 5, 'v': 12}, {'u': 5, 'v': 18}, {'u': 18, 'v': 12}]}","[1, 2, 3, 8, 10, 11, 17, 19]",32,markdown_table,0
MIS,MIS,"There’s a single festival slot to fill and a bunch of short films on the roster, except some titles conflict with each other because of licensing, so they can’t both be programmed. The decision is which combination of films to run so the block contains as many shorts as possible; the measure of success is just the count of films actually scheduled. No title can be duplicated, and any pair that has a licensing conflict has to be kept apart. The concrete details — who’s in the pool and which pairs conflict — appear below.
# num_films=22
# num_conflicts=51
film_a_id,film_b_id
14,5
14,7
14,8
15,4
15,6
15,10
15,17
15,19
18,1
18,7
18,10
18,16
18,17
18,20
18,21
20,7
20,8
20,16
20,17
20,19
20,22
21,10
21,17
8,5
8,7
9,1
9,5
10,1
10,6
10,11
2,1
2,3
2,4
2,5
2,6
2,11
2,12
2,13
3,4
4,6
4,12
4,19
22,7
5,1
5,7
1,7
1,11
6,12
6,13
12,13
19,17
When you tell me which films made the cut, toss the answer back in this little JSON shape so it's easy to read programmatically:
{
""solution"": [""film_id"", ""film_id"", ...]
}
Here ""solution"" is just the list of films you're scheduling in the slot — each entry should be the exact film identifier from the input (order doesn't matter, it's just the chosen set). This block is only a sketch of the shape I want, not the actual selection.
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': 'MIS', 'num_nodes': 22, 'num_edges': 51, 'edges': [{'u': 14, 'v': 5}, {'u': 14, 'v': 7}, {'u': 14, 'v': 8}, {'u': 15, 'v': 4}, {'u': 15, 'v': 6}, {'u': 15, 'v': 10}, {'u': 15, 'v': 17}, {'u': 15, 'v': 19}, {'u': 18, 'v': 1}, {'u': 18, 'v': 7}, {'u': 18, 'v': 10}, {'u': 18, 'v': 16}, {'u': 18, 'v': 17}, {'u': 18, 'v': 20}, {'u': 18, 'v': 21}, {'u': 20, 'v': 7}, {'u': 20, 'v': 8}, {'u': 20, 'v': 16}, {'u': 20, 'v': 17}, {'u': 20, 'v': 19}, {'u': 20, 'v': 22}, {'u': 21, 'v': 10}, {'u': 21, 'v': 17}, {'u': 8, 'v': 5}, {'u': 8, 'v': 7}, {'u': 9, 'v': 1}, {'u': 9, 'v': 5}, {'u': 10, 'v': 1}, {'u': 10, 'v': 6}, {'u': 10, 'v': 11}, {'u': 2, 'v': 1}, {'u': 2, 'v': 3}, {'u': 2, 'v': 4}, {'u': 2, 'v': 5}, {'u': 2, 'v': 6}, {'u': 2, 'v': 11}, {'u': 2, 'v': 12}, {'u': 2, 'v': 13}, {'u': 3, 'v': 4}, {'u': 4, 'v': 6}, {'u': 4, 'v': 12}, {'u': 4, 'v': 19}, {'u': 22, 'v': 7}, {'u': 5, 'v': 1}, {'u': 5, 'v': 7}, {'u': 1, 'v': 7}, {'u': 1, 'v': 11}, {'u': 6, 'v': 12}, {'u': 6, 'v': 13}, {'u': 12, 'v': 13}, {'u': 19, 'v': 17}], 'source_file': 'wv2010.mtx', 'density': 0.22077922077922077, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0032.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0032.png', 'edge_connectivity': 2}","[3, 9, 11, 13, 14, 16, 19, 21, 22]",9.0,"{'num_nodes': 22, 'num_edges': 51, 'edges': [{'u': 14, 'v': 5}, {'u': 14, 'v': 7}, {'u': 14, 'v': 8}, {'u': 15, 'v': 4}, {'u': 15, 'v': 6}, {'u': 15, 'v': 10}, {'u': 15, 'v': 17}, {'u': 15, 'v': 19}, {'u': 18, 'v': 1}, {'u': 18, 'v': 7}, {'u': 18, 'v': 10}, {'u': 18, 'v': 16}, {'u': 18, 'v': 17}, {'u': 18, 'v': 20}, {'u': 18, 'v': 21}, {'u': 20, 'v': 7}, {'u': 20, 'v': 8}, {'u': 20, 'v': 16}, {'u': 20, 'v': 17}, {'u': 20, 'v': 19}, {'u': 20, 'v': 22}, {'u': 21, 'v': 10}, {'u': 21, 'v': 17}, {'u': 8, 'v': 5}, {'u': 8, 'v': 7}, {'u': 9, 'v': 1}, {'u': 9, 'v': 5}, {'u': 10, 'v': 1}, {'u': 10, 'v': 6}, {'u': 10, 'v': 11}, {'u': 2, 'v': 1}, {'u': 2, 'v': 3}, {'u': 2, 'v': 4}, {'u': 2, 'v': 5}, {'u': 2, 'v': 6}, {'u': 2, 'v': 11}, {'u': 2, 'v': 12}, {'u': 2, 'v': 13}, {'u': 3, 'v': 4}, {'u': 4, 'v': 6}, {'u': 4, 'v': 12}, {'u': 4, 'v': 19}, {'u': 22, 'v': 7}, {'u': 5, 'v': 1}, {'u': 5, 'v': 7}, {'u': 1, 'v': 7}, {'u': 1, 'v': 11}, {'u': 6, 'v': 12}, {'u': 6, 'v': 13}, {'u': 12, 'v': 13}, {'u': 19, 'v': 17}]}","[3, 9, 11, 13, 14, 16, 19, 21, 22]",33,csv,1
MIS,MIS,"We were sorting out patrol shifts at the block meeting and the job fell to me: pick the largest crew of partners for evening rounds while making sure no two people who’ve said they won’t work together end up on the same team. The decision is which combination of folks gives the highest headcount; you judge that by counting team members, and the winning plan is the one with the most people. The must-follow rule is that any pair that refuses to collaborate can’t both be chosen, and nobody is duplicated. The specific names and who can’t pair with whom are listed below.
I'm looking at 23 people and 46 refusing pairs.
14 and 1 refuse to work together, so I can't pick them both.
14 and 4 refuse to work together, so I can't pick them both.
14 and 5 refuse to work together, so I can't pick them both.
14 and 6 refuse to work together, so I can't pick them both.
14 and 7 refuse to work together, so I can't pick them both.
14 and 23 refuse to work together, so I can't pick them both.
15 and 2 refuse to work together, so I can't pick them both.
15 and 8 refuse to work together, so I can't pick them both.
15 and 11 refuse to work together, so I can't pick them both.
15 and 21 refuse to work together, so I can't pick them both.
16 and 2 refuse to work together, so I can't pick them both.
16 and 9 refuse to work together, so I can't pick them both.
16 and 13 refuse to work together, so I can't pick them both.
16 and 21 refuse to work together, so I can't pick them both.
20 and 1 refuse to work together, so I can't pick them both.
3 and 18 refuse to work together, so I can't pick them both.
3 and 19 refuse to work together, so I can't pick them both.
3 and 22 refuse to work together, so I can't pick them both.
7 and 5 refuse to work together, so I can't pick them both.
8 and 10 refuse to work together, so I can't pick them both.
8 and 11 refuse to work together, so I can't pick them both.
8 and 21 refuse to work together, so I can't pick them both.
9 and 2 refuse to work together, so I can't pick them both.
4 and 5 refuse to work together, so I can't pick them both.
4 and 12 refuse to work together, so I can't pick them both.
4 and 18 refuse to work together, so I can't pick them both.
4 and 21 refuse to work together, so I can't pick them both.
4 and 22 refuse to work together, so I can't pick them both.
10 and 11 refuse to work together, so I can't pick them both.
10 and 21 refuse to work together, so I can't pick them both.
10 and 22 refuse to work together, so I can't pick them both.
5 and 1 refuse to work together, so I can't pick them both.
5 and 19 refuse to work together, so I can't pick them both.
6 and 12 refuse to work together, so I can't pick them both.
21 and 12 refuse to work together, so I can't pick them both.
21 and 13 refuse to work together, so I can't pick them both.
1 and 2 refuse to work together, so I can't pick them both.
1 and 17 refuse to work together, so I can't pick them both.
1 and 19 refuse to work together, so I can't pick them both.
1 and 23 refuse to work together, so I can't pick them both.
11 and 2 refuse to work together, so I can't pick them both.
11 and 17 refuse to work together, so I can't pick them both.
2 and 13 refuse to work together, so I can't pick them both.
22 and 17 refuse to work together, so I can't pick them both.
17 and 19 refuse to work together, so I can't pick them both.
18 and 19 refuse to work together, so I can't pick them both.
I'll choose the largest crew that never includes both members of any listed refusing pair.
Oh, and when you send back the final pick, could you put it in this simple JSON shape so it’s easy to read by my script?
{
""solution"": [""person_id"", ""person_id"", ...]
}
This just means ""solution"" should be an array listing the chosen people (use their IDs exactly as given). Think of it like a tiny form: the array holds the IDs of the folks you're assigning to the evening patrols.
This JSON is just a sketch of the expected shape — not the actual answer.
Please use the identifiers exactly as they appear in the instance input — don’t rename or invent any 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': 'MIS', 'num_nodes': 23, 'num_edges': 46, 'edges': [{'u': 14, 'v': 1}, {'u': 14, 'v': 4}, {'u': 14, 'v': 5}, {'u': 14, 'v': 6}, {'u': 14, 'v': 7}, {'u': 14, 'v': 23}, {'u': 15, 'v': 2}, {'u': 15, 'v': 8}, {'u': 15, 'v': 11}, {'u': 15, 'v': 21}, {'u': 16, 'v': 2}, {'u': 16, 'v': 9}, {'u': 16, 'v': 13}, {'u': 16, 'v': 21}, {'u': 20, 'v': 1}, {'u': 3, 'v': 18}, {'u': 3, 'v': 19}, {'u': 3, 'v': 22}, {'u': 7, 'v': 5}, {'u': 8, 'v': 10}, {'u': 8, 'v': 11}, {'u': 8, 'v': 21}, {'u': 9, 'v': 2}, {'u': 4, 'v': 5}, {'u': 4, 'v': 12}, {'u': 4, 'v': 18}, {'u': 4, 'v': 21}, {'u': 4, 'v': 22}, {'u': 10, 'v': 11}, {'u': 10, 'v': 21}, {'u': 10, 'v': 22}, {'u': 5, 'v': 1}, {'u': 5, 'v': 19}, {'u': 6, 'v': 12}, {'u': 21, 'v': 12}, {'u': 21, 'v': 13}, {'u': 1, 'v': 2}, {'u': 1, 'v': 17}, {'u': 1, 'v': 19}, {'u': 1, 'v': 23}, {'u': 11, 'v': 2}, {'u': 11, 'v': 17}, {'u': 2, 'v': 13}, {'u': 22, 'v': 17}, {'u': 17, 'v': 19}, {'u': 18, 'v': 19}], 'source_file': 'wi2010.mtx', 'density': 0.18181818181818182, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0033.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0033.png', 'edge_connectivity': 1}","[3, 4, 6, 7, 9, 10, 13, 15, 17, 20, 23]",11.0,"{'num_nodes': 23, 'num_edges': 46, 'edges': [{'u': 14, 'v': 1}, {'u': 14, 'v': 4}, {'u': 14, 'v': 5}, {'u': 14, 'v': 6}, {'u': 14, 'v': 7}, {'u': 14, 'v': 23}, {'u': 15, 'v': 2}, {'u': 15, 'v': 8}, {'u': 15, 'v': 11}, {'u': 15, 'v': 21}, {'u': 16, 'v': 2}, {'u': 16, 'v': 9}, {'u': 16, 'v': 13}, {'u': 16, 'v': 21}, {'u': 20, 'v': 1}, {'u': 3, 'v': 18}, {'u': 3, 'v': 19}, {'u': 3, 'v': 22}, {'u': 7, 'v': 5}, {'u': 8, 'v': 10}, {'u': 8, 'v': 11}, {'u': 8, 'v': 21}, {'u': 9, 'v': 2}, {'u': 4, 'v': 5}, {'u': 4, 'v': 12}, {'u': 4, 'v': 18}, {'u': 4, 'v': 21}, {'u': 4, 'v': 22}, {'u': 10, 'v': 11}, {'u': 10, 'v': 21}, {'u': 10, 'v': 22}, {'u': 5, 'v': 1}, {'u': 5, 'v': 19}, {'u': 6, 'v': 12}, {'u': 21, 'v': 12}, {'u': 21, 'v': 13}, {'u': 1, 'v': 2}, {'u': 1, 'v': 17}, {'u': 1, 'v': 19}, {'u': 1, 'v': 23}, {'u': 11, 'v': 2}, {'u': 11, 'v': 17}, {'u': 2, 'v': 13}, {'u': 22, 'v': 17}, {'u': 17, 'v': 19}, {'u': 18, 'v': 19}]}","[3, 4, 6, 7, 9, 10, 13, 15, 17, 20, 23]",34,nl,1
MIS,MIS,"There’s a themed chapter to fill, and the editor’s challenge is to pick a collection of recipes that’s as large as possible but doesn’t contain any duplicates or recipes that contradict one another. A better decision is the one that results in a bigger final list of unique, non-contradictory recipes — success can be checked by counting how many recipes are included. The concrete details appear below.
There are 21 recipes available in total and 44 num conflicting pairs.
| recipe_a_id | recipe_b_id |
|---|---|
| 10 | 1 |
| 10 | 16 |
| 19 | 1 |
| 19 | 16 |
| 19 | 17 |
| 20 | 1 |
| 20 | 12 |
| 20 | 14 |
| 20 | 21 |
| 2 | 1 |
| 2 | 9 |
| 2 | 11 |
| 3 | 1 |
| 3 | 4 |
| 3 | 8 |
| 3 | 21 |
| 11 | 1 |
| 11 | 18 |
| 12 | 1 |
| 12 | 6 |
| 12 | 8 |
| 12 | 21 |
| 4 | 1 |
| 4 | 7 |
| 4 | 21 |
| 5 | 1 |
| 5 | 14 |
| 5 | 21 |
| 6 | 1 |
| 6 | 15 |
| 7 | 1 |
| 7 | 21 |
| 21 | 8 |
| 21 | 14 |
| 1 | 9 |
| 1 | 13 |
| 1 | 14 |
| 1 | 15 |
| 1 | 16 |
| 1 | 17 |
| 1 | 18 |
| 17 | 15 |
| 17 | 16 |
| 16 | 13 |
Oh, and when you send back the chosen recipes, stick to a tiny JSON layout so it's easy for the editor to read. Something like this:
{
""solution"": [""recipe_id"", ""recipe_id"", ...]
}
Here ""solution"" is the list of recipe identifiers you're including in the chapter — just the IDs, nothing else. This JSON is just 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. 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': 'MIS', 'num_nodes': 21, 'num_edges': 44, 'edges': [{'u': 10, 'v': 1}, {'u': 10, 'v': 16}, {'u': 19, 'v': 1}, {'u': 19, 'v': 16}, {'u': 19, 'v': 17}, {'u': 20, 'v': 1}, {'u': 20, 'v': 12}, {'u': 20, 'v': 14}, {'u': 20, 'v': 21}, {'u': 2, 'v': 1}, {'u': 2, 'v': 9}, {'u': 2, 'v': 11}, {'u': 3, 'v': 1}, {'u': 3, 'v': 4}, {'u': 3, 'v': 8}, {'u': 3, 'v': 21}, {'u': 11, 'v': 1}, {'u': 11, 'v': 18}, {'u': 12, 'v': 1}, {'u': 12, 'v': 6}, {'u': 12, 'v': 8}, {'u': 12, 'v': 21}, {'u': 4, 'v': 1}, {'u': 4, 'v': 7}, {'u': 4, 'v': 21}, {'u': 5, 'v': 1}, {'u': 5, 'v': 14}, {'u': 5, 'v': 21}, {'u': 6, 'v': 1}, {'u': 6, 'v': 15}, {'u': 7, 'v': 1}, {'u': 7, 'v': 21}, {'u': 21, 'v': 8}, {'u': 21, 'v': 14}, {'u': 1, 'v': 9}, {'u': 1, 'v': 13}, {'u': 1, 'v': 14}, {'u': 1, 'v': 15}, {'u': 1, 'v': 16}, {'u': 1, 'v': 17}, {'u': 1, 'v': 18}, {'u': 17, 'v': 15}, {'u': 17, 'v': 16}, {'u': 16, 'v': 13}], 'source_file': 'vt2010.mtx', 'density': 0.20952380952380953, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0034.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0034.png', 'edge_connectivity': 2}","[3, 5, 7, 9, 10, 13, 15, 18, 19, 20]",10.0,"{'num_nodes': 21, 'num_edges': 44, 'edges': [{'u': 10, 'v': 1}, {'u': 10, 'v': 16}, {'u': 19, 'v': 1}, {'u': 19, 'v': 16}, {'u': 19, 'v': 17}, {'u': 20, 'v': 1}, {'u': 20, 'v': 12}, {'u': 20, 'v': 14}, {'u': 20, 'v': 21}, {'u': 2, 'v': 1}, {'u': 2, 'v': 9}, {'u': 2, 'v': 11}, {'u': 3, 'v': 1}, {'u': 3, 'v': 4}, {'u': 3, 'v': 8}, {'u': 3, 'v': 21}, {'u': 11, 'v': 1}, {'u': 11, 'v': 18}, {'u': 12, 'v': 1}, {'u': 12, 'v': 6}, {'u': 12, 'v': 8}, {'u': 12, 'v': 21}, {'u': 4, 'v': 1}, {'u': 4, 'v': 7}, {'u': 4, 'v': 21}, {'u': 5, 'v': 1}, {'u': 5, 'v': 14}, {'u': 5, 'v': 21}, {'u': 6, 'v': 1}, {'u': 6, 'v': 15}, {'u': 7, 'v': 1}, {'u': 7, 'v': 21}, {'u': 21, 'v': 8}, {'u': 21, 'v': 14}, {'u': 1, 'v': 9}, {'u': 1, 'v': 13}, {'u': 1, 'v': 14}, {'u': 1, 'v': 15}, {'u': 1, 'v': 16}, {'u': 1, 'v': 17}, {'u': 1, 'v': 18}, {'u': 17, 'v': 15}, {'u': 17, 'v': 16}, {'u': 16, 'v': 13}]}","[3, 5, 7, 9, 10, 13, 15, 18, 19, 20]",35,markdown_table,1
MIS,MIS,"We were putting together the vendor lineup for a craft market and discovered a few pairs of sellers that just won’t tolerate each other at the same show. The task became choosing which vendors to invite into that single row so the row holds as many different booths as we can, while making sure no two incompatible vendors end up both accepted. To compare different choices, just count how many vendors are accepted in each; the choice with the highest count wins, and every vendor is considered once — no duplicates. The concrete vendor details and incompatibilities are shown below.
There are 25 vendors in total and 49 num conflict pairs.
| vendor_a | vendor_b |
|---|---|
| 9 | 6 |
| 9 | 10 |
| 9 | 11 |
| 9 | 21 |
| 10 | 1 |
| 10 | 2 |
| 10 | 4 |
| 10 | 11 |
| 18 | 1 |
| 18 | 14 |
| 18 | 15 |
| 18 | 19 |
| 11 | 2 |
| 11 | 4 |
| 11 | 6 |
| 12 | 1 |
| 12 | 24 |
| 5 | 2 |
| 5 | 3 |
| 5 | 16 |
| 1 | 7 |
| 1 | 8 |
| 1 | 13 |
| 1 | 14 |
| 1 | 15 |
| 1 | 21 |
| 1 | 23 |
| 1 | 24 |
| 1 | 25 |
| 8 | 7 |
| 21 | 23 |
| 22 | 2 |
| 22 | 16 |
| 22 | 20 |
| 23 | 6 |
| 23 | 15 |
| 23 | 17 |
| 25 | 15 |
| 6 | 2 |
| 6 | 3 |
| 19 | 20 |
| 2 | 3 |
| 3 | 17 |
| 20 | 15 |
| 20 | 16 |
| 13 | 14 |
| 15 | 16 |
| 15 | 17 |
| 16 | 17 |
Quick note on the answer format — I’ll keep it simple: give me a JSON object with a single key ""solution"" whose value is a list of the vendor identifiers you’re accepting for the row.
{
""solution"": [""vendor_id"", ""vendor_id"", ...]
}
Here ""solution"" is just the list of accepted vendor IDs in the order you like. Treat this like filling in a form: put each chosen vendor's identifier as a string in that array. This JSON is only a sketch of the shape I need, not the actual final choices.
Please use the identifiers exactly as they appear in the instance input — don’t 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': 'MIS', 'num_nodes': 25, 'num_edges': 49, 'edges': [{'u': 9, 'v': 6}, {'u': 9, 'v': 10}, {'u': 9, 'v': 11}, {'u': 9, 'v': 21}, {'u': 10, 'v': 1}, {'u': 10, 'v': 2}, {'u': 10, 'v': 4}, {'u': 10, 'v': 11}, {'u': 18, 'v': 1}, {'u': 18, 'v': 14}, {'u': 18, 'v': 15}, {'u': 18, 'v': 19}, {'u': 11, 'v': 2}, {'u': 11, 'v': 4}, {'u': 11, 'v': 6}, {'u': 12, 'v': 1}, {'u': 12, 'v': 24}, {'u': 5, 'v': 2}, {'u': 5, 'v': 3}, {'u': 5, 'v': 16}, {'u': 1, 'v': 7}, {'u': 1, 'v': 8}, {'u': 1, 'v': 13}, {'u': 1, 'v': 14}, {'u': 1, 'v': 15}, {'u': 1, 'v': 21}, {'u': 1, 'v': 23}, {'u': 1, 'v': 24}, {'u': 1, 'v': 25}, {'u': 8, 'v': 7}, {'u': 21, 'v': 23}, {'u': 22, 'v': 2}, {'u': 22, 'v': 16}, {'u': 22, 'v': 20}, {'u': 23, 'v': 6}, {'u': 23, 'v': 15}, {'u': 23, 'v': 17}, {'u': 25, 'v': 15}, {'u': 6, 'v': 2}, {'u': 6, 'v': 3}, {'u': 19, 'v': 20}, {'u': 2, 'v': 3}, {'u': 3, 'v': 17}, {'u': 20, 'v': 15}, {'u': 20, 'v': 16}, {'u': 13, 'v': 14}, {'u': 15, 'v': 16}, {'u': 15, 'v': 17}, {'u': 16, 'v': 17}], 'source_file': 'vt2010.mtx', 'density': 0.16333333333333333, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0035.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0035.png', 'edge_connectivity': 2}","[4, 5, 6, 8, 12, 13, 17, 18, 20, 21, 25]",11.0,"{'num_nodes': 25, 'num_edges': 49, 'edges': [{'u': 9, 'v': 6}, {'u': 9, 'v': 10}, {'u': 9, 'v': 11}, {'u': 9, 'v': 21}, {'u': 10, 'v': 1}, {'u': 10, 'v': 2}, {'u': 10, 'v': 4}, {'u': 10, 'v': 11}, {'u': 18, 'v': 1}, {'u': 18, 'v': 14}, {'u': 18, 'v': 15}, {'u': 18, 'v': 19}, {'u': 11, 'v': 2}, {'u': 11, 'v': 4}, {'u': 11, 'v': 6}, {'u': 12, 'v': 1}, {'u': 12, 'v': 24}, {'u': 5, 'v': 2}, {'u': 5, 'v': 3}, {'u': 5, 'v': 16}, {'u': 1, 'v': 7}, {'u': 1, 'v': 8}, {'u': 1, 'v': 13}, {'u': 1, 'v': 14}, {'u': 1, 'v': 15}, {'u': 1, 'v': 21}, {'u': 1, 'v': 23}, {'u': 1, 'v': 24}, {'u': 1, 'v': 25}, {'u': 8, 'v': 7}, {'u': 21, 'v': 23}, {'u': 22, 'v': 2}, {'u': 22, 'v': 16}, {'u': 22, 'v': 20}, {'u': 23, 'v': 6}, {'u': 23, 'v': 15}, {'u': 23, 'v': 17}, {'u': 25, 'v': 15}, {'u': 6, 'v': 2}, {'u': 6, 'v': 3}, {'u': 19, 'v': 20}, {'u': 2, 'v': 3}, {'u': 3, 'v': 17}, {'u': 20, 'v': 15}, {'u': 20, 'v': 16}, {'u': 13, 'v': 14}, {'u': 15, 'v': 16}, {'u': 15, 'v': 17}, {'u': 16, 'v': 17}]}","[4, 5, 6, 8, 12, 13, 17, 18, 20, 21, 25]",36,markdown_table,1
MIS,MIS,"I’m the tech lead juggling a stack of feature ideas for the next release, and the task is to pick a pack of features that work together — as many as possible, but never two that clash. The better plan is simply the one that ends up with more features chosen, so success is just counting how many items made the cut. Every picked feature has to come from the list and can only be chosen once, and no pair that’s known to conflict can be included together. The exact feature list and which features clash will be shown below.
Below are the 25 feature ideas and 48 conflict pairs I'll use to pick the largest pack of non-clashing features.
I note that feature 17 conflicts with feature 7.
I note that feature 17 conflicts with feature 9.
I note that feature 17 conflicts with feature 12.
I note that feature 17 conflicts with feature 16.
I note that feature 17 conflicts with feature 19.
I note that feature 17 conflicts with feature 25.
I note that feature 6 conflicts with feature 10.
I note that feature 6 conflicts with feature 16.
I note that feature 6 conflicts with feature 19.
I note that feature 1 conflicts with feature 2.
I note that feature 1 conflicts with feature 3.
I note that feature 1 conflicts with feature 5.
I note that feature 1 conflicts with feature 25.
I note that feature 21 conflicts with feature 5.
I note that feature 21 conflicts with feature 23.
I note that feature 21 conflicts with feature 25.
I note that feature 10 conflicts with feature 18.
I note that feature 10 conflicts with feature 20.
I note that feature 10 conflicts with feature 22.
I note that feature 2 conflicts with feature 3.
I note that feature 2 conflicts with feature 5.
I note that feature 2 conflicts with feature 7.
I note that feature 2 conflicts with feature 11.
I note that feature 8 conflicts with feature 12.
I note that feature 8 conflicts with feature 16.
I note that feature 8 conflicts with feature 20.
I note that feature 8 conflicts with feature 25.
I note that feature 11 conflicts with feature 7.
I note that feature 11 conflicts with feature 9.
I note that feature 7 conflicts with feature 19.
I note that feature 15 conflicts with feature 13.
I note that feature 15 conflicts with feature 23.
I note that feature 18 conflicts with feature 20.
I note that feature 19 conflicts with feature 16.
I note that feature 12 conflicts with feature 25.
I note that feature 5 conflicts with feature 4.
I note that feature 5 conflicts with feature 23.
I note that feature 9 conflicts with feature 3.
I note that feature 9 conflicts with feature 25.
I note that feature 13 conflicts with feature 14.
I note that feature 13 conflicts with feature 20.
I note that feature 14 conflicts with feature 23.
I note that feature 14 conflicts with feature 25.
I note that feature 24 conflicts with feature 20.
I note that feature 25 conflicts with feature 20.
I note that feature 20 conflicts with feature 16.
I note that feature 20 conflicts with feature 22.
I note that feature 16 conflicts with feature 22.
I'll pick the biggest compatible subset from these 25 ideas.
Also, when you send back your final pick, just drop a tiny JSON snippet in the same shape as below so it's easy to parse:
{
""solution"": [""feature_id"", ""feature_id"", ...]
}
This is just a sketch of the expected shape — ""solution"" is the list of features you want to include in the pack. Treat each string in the array as one chosen feature from the list shown in the instance; it's like ticking boxes on a simple form.
Important: 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': 'MIS', 'num_nodes': 25, 'num_edges': 48, 'edges': [{'u': 17, 'v': 7}, {'u': 17, 'v': 9}, {'u': 17, 'v': 12}, {'u': 17, 'v': 16}, {'u': 17, 'v': 19}, {'u': 17, 'v': 25}, {'u': 6, 'v': 10}, {'u': 6, 'v': 16}, {'u': 6, 'v': 19}, {'u': 1, 'v': 2}, {'u': 1, 'v': 3}, {'u': 1, 'v': 5}, {'u': 1, 'v': 25}, {'u': 21, 'v': 5}, {'u': 21, 'v': 23}, {'u': 21, 'v': 25}, {'u': 10, 'v': 18}, {'u': 10, 'v': 20}, {'u': 10, 'v': 22}, {'u': 2, 'v': 3}, {'u': 2, 'v': 5}, {'u': 2, 'v': 7}, {'u': 2, 'v': 11}, {'u': 8, 'v': 12}, {'u': 8, 'v': 16}, {'u': 8, 'v': 20}, {'u': 8, 'v': 25}, {'u': 11, 'v': 7}, {'u': 11, 'v': 9}, {'u': 7, 'v': 19}, {'u': 15, 'v': 13}, {'u': 15, 'v': 23}, {'u': 18, 'v': 20}, {'u': 19, 'v': 16}, {'u': 12, 'v': 25}, {'u': 5, 'v': 4}, {'u': 5, 'v': 23}, {'u': 9, 'v': 3}, {'u': 9, 'v': 25}, {'u': 13, 'v': 14}, {'u': 13, 'v': 20}, {'u': 14, 'v': 23}, {'u': 14, 'v': 25}, {'u': 24, 'v': 20}, {'u': 25, 'v': 20}, {'u': 20, 'v': 16}, {'u': 20, 'v': 22}, {'u': 16, 'v': 22}], 'source_file': 'wv2010.mtx', 'density': 0.16, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0036.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0036.png', 'edge_connectivity': 1}","[1, 4, 6, 8, 11, 14, 15, 17, 18, 21, 22, 24]",12.0,"{'num_nodes': 25, 'num_edges': 48, 'edges': [{'u': 17, 'v': 7}, {'u': 17, 'v': 9}, {'u': 17, 'v': 12}, {'u': 17, 'v': 16}, {'u': 17, 'v': 19}, {'u': 17, 'v': 25}, {'u': 6, 'v': 10}, {'u': 6, 'v': 16}, {'u': 6, 'v': 19}, {'u': 1, 'v': 2}, {'u': 1, 'v': 3}, {'u': 1, 'v': 5}, {'u': 1, 'v': 25}, {'u': 21, 'v': 5}, {'u': 21, 'v': 23}, {'u': 21, 'v': 25}, {'u': 10, 'v': 18}, {'u': 10, 'v': 20}, {'u': 10, 'v': 22}, {'u': 2, 'v': 3}, {'u': 2, 'v': 5}, {'u': 2, 'v': 7}, {'u': 2, 'v': 11}, {'u': 8, 'v': 12}, {'u': 8, 'v': 16}, {'u': 8, 'v': 20}, {'u': 8, 'v': 25}, {'u': 11, 'v': 7}, {'u': 11, 'v': 9}, {'u': 7, 'v': 19}, {'u': 15, 'v': 13}, {'u': 15, 'v': 23}, {'u': 18, 'v': 20}, {'u': 19, 'v': 16}, {'u': 12, 'v': 25}, {'u': 5, 'v': 4}, {'u': 5, 'v': 23}, {'u': 9, 'v': 3}, {'u': 9, 'v': 25}, {'u': 13, 'v': 14}, {'u': 13, 'v': 20}, {'u': 14, 'v': 23}, {'u': 14, 'v': 25}, {'u': 24, 'v': 20}, {'u': 25, 'v': 20}, {'u': 20, 'v': 16}, {'u': 20, 'v': 22}, {'u': 16, 'v': 22}]}","[1, 4, 6, 8, 11, 14, 15, 17, 18, 21, 22, 24]",37,nl,1
MIS,MIS,"Someone at the venue office is juggling a long list of bands and soloists and wants to assemble the largest possible show where no two performers have any known personal or contractual beef. The task is to decide who to invite; the winning decision is the one that produces the biggest roster. Success is determined by the number of distinct performers chosen (just add them up), but it’s important that no conflicting pair is included and that each musician appears only once. The specific names and relationships are shown below.
{
""total_performers_count"": 19,
""total_conflict_pairs_count"": 36,
""edges"": [
{
""performer_a"": 7,
""performer_b"": 1
},
{
""performer_a"": 7,
""performer_b"": 9
},
{
""performer_a"": 7,
""performer_b"": 14
},
{
""performer_a"": 10,
""performer_b"": 8
},
{
""performer_a"": 10,
""performer_b"": 9
},
{
""performer_a"": 10,
""performer_b"": 13
},
{
""performer_a"": 10,
""performer_b"": 14
},
{
""performer_a"": 10,
""performer_b"": 16
},
{
""performer_a"": 15,
""performer_b"": 4
},
{
""performer_a"": 15,
""performer_b"": 8
},
{
""performer_a"": 15,
""performer_b"": 14
},
{
""performer_a"": 16,
""performer_b"": 8
},
{
""performer_a"": 16,
""performer_b"": 9
},
{
""performer_a"": 16,
""performer_b"": 17
},
{
""performer_a"": 3,
""performer_b"": 8
},
{
""performer_a"": 3,
""performer_b"": 18
},
{
""performer_a"": 9,
""performer_b"": 1
},
{
""performer_a"": 9,
""performer_b"": 2
},
{
""performer_a"": 9,
""performer_b"": 5
},
{
""performer_a"": 9,
""performer_b"": 14
},
{
""performer_a"": 19,
""performer_b"": 6
},
{
""performer_a"": 19,
""performer_b"": 8
},
{
""performer_a"": 12,
""performer_b"": 4
},
{
""performer_a"": 12,
""performer_b"": 8
},
{
""performer_a"": 12,
""performer_b"": 18
},
{
""performer_a"": 13,
""performer_b"": 8
},
{
""performer_a"": 5,
""performer_b"": 6
},
{
""performer_a"": 5,
""performer_b"": 17
},
{
""performer_a"": 6,
""performer_b"": 8
},
{
""performer_a"": 6,
""performer_b"": 17
},
{
""performer_a"": 4,
""performer_b"": 8
},
{
""performer_a"": 4,
""performer_b"": 11
},
{
""performer_a"": 4,
""performer_b"": 14
},
{
""performer_a"": 4,
""performer_b"": 18
},
{
""performer_a"": 11,
""performer_b"": 14
},
{
""performer_a"": 18,
""performer_b"": 8
}
]
}
Oh, and when you're ready to give the answer, please use a tiny JSON snippet like this so it's easy to check:
{
""solution"": [""performer_id"", ""performer_id"", ...]
}
Here ""solution"" is just the list of performers you're inviting — each entry is the ID of one musician on the roster. Think of it like filling in a short form: put each performer’s exact ID in the array, and that’s your final pick. This is only a template showing the expected shape, not the actual lineup.
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': 'MIS', 'num_nodes': 19, 'num_edges': 36, 'edges': [{'u': 7, 'v': 1}, {'u': 7, 'v': 9}, {'u': 7, 'v': 14}, {'u': 10, 'v': 8}, {'u': 10, 'v': 9}, {'u': 10, 'v': 13}, {'u': 10, 'v': 14}, {'u': 10, 'v': 16}, {'u': 15, 'v': 4}, {'u': 15, 'v': 8}, {'u': 15, 'v': 14}, {'u': 16, 'v': 8}, {'u': 16, 'v': 9}, {'u': 16, 'v': 17}, {'u': 3, 'v': 8}, {'u': 3, 'v': 18}, {'u': 9, 'v': 1}, {'u': 9, 'v': 2}, {'u': 9, 'v': 5}, {'u': 9, 'v': 14}, {'u': 19, 'v': 6}, {'u': 19, 'v': 8}, {'u': 12, 'v': 4}, {'u': 12, 'v': 8}, {'u': 12, 'v': 18}, {'u': 13, 'v': 8}, {'u': 5, 'v': 6}, {'u': 5, 'v': 17}, {'u': 6, 'v': 8}, {'u': 6, 'v': 17}, {'u': 4, 'v': 8}, {'u': 4, 'v': 11}, {'u': 4, 'v': 14}, {'u': 4, 'v': 18}, {'u': 11, 'v': 14}, {'u': 18, 'v': 8}], 'source_file': 'wa2010.mtx', 'density': 0.21052631578947367, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0037.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0037.png', 'edge_connectivity': 1}","[1, 2, 3, 5, 11, 12, 13, 15, 16, 19]",10.0,"{'num_nodes': 19, 'num_edges': 36, 'edges': [{'u': 7, 'v': 1}, {'u': 7, 'v': 9}, {'u': 7, 'v': 14}, {'u': 10, 'v': 8}, {'u': 10, 'v': 9}, {'u': 10, 'v': 13}, {'u': 10, 'v': 14}, {'u': 10, 'v': 16}, {'u': 15, 'v': 4}, {'u': 15, 'v': 8}, {'u': 15, 'v': 14}, {'u': 16, 'v': 8}, {'u': 16, 'v': 9}, {'u': 16, 'v': 17}, {'u': 3, 'v': 8}, {'u': 3, 'v': 18}, {'u': 9, 'v': 1}, {'u': 9, 'v': 2}, {'u': 9, 'v': 5}, {'u': 9, 'v': 14}, {'u': 19, 'v': 6}, {'u': 19, 'v': 8}, {'u': 12, 'v': 4}, {'u': 12, 'v': 8}, {'u': 12, 'v': 18}, {'u': 13, 'v': 8}, {'u': 5, 'v': 6}, {'u': 5, 'v': 17}, {'u': 6, 'v': 8}, {'u': 6, 'v': 17}, {'u': 4, 'v': 8}, {'u': 4, 'v': 11}, {'u': 4, 'v': 14}, {'u': 4, 'v': 18}, {'u': 11, 'v': 14}, {'u': 18, 'v': 8}]}","[1, 2, 3, 5, 11, 12, 13, 15, 16, 19]",38,json,1
MIS,MIS,"Recently a homeowner decided to finally hang up a bunch of frames in the living room and wanted to get as many different pieces up as possible. The catch: if two pictures are known to clash in style, they can’t both be on the wall at the same time. The way to tell which arrangement is best is to count the number of distinct pictures hanging — the higher the number, the better — and make sure each hung item is one of the originals, not a repeat. The exact details about which pictures exist and which pairs conflict are shown below.
# total_pictures_count=25
# total_clashing_pairs_count=47
picture_one_id,picture_two_id
10,19
10,20
10,21
24,0
24,16
11,5
11,6
11,9
11,14
11,22
17,15
17,18
3,19
3,21
9,5
9,8
9,13
9,20
9,22
4,6
4,14
5,8
5,22
6,14
12,0
12,1
12,2
18,13
18,15
18,19
19,20
19,21
20,7
20,13
20,21
21,7
2,0
2,1
23,0
23,1
23,13
23,16
7,8
1,13
1,15
13,14
14,16
Oh, and to keep things tidy, please give the final arrangement in this little JSON shape:
{
""solution"": [""picture_id"", ""picture_id"", ...]
}
Pretty simple: ""solution"" is the list of picture IDs you plan to hang (one entry per picture). Think of it as the form the answer should fill out — just the exact IDs listed in the input, nothing else. This JSON is only a sketch of the expected shape, not the actual answer.
Also, 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': 'MIS', 'num_nodes': 25, 'num_edges': 47, 'edges': [{'u': 11, 'v': 20}, {'u': 11, 'v': 21}, {'u': 11, 'v': 22}, {'u': 25, 'v': 1}, {'u': 25, 'v': 17}, {'u': 12, 'v': 6}, {'u': 12, 'v': 7}, {'u': 12, 'v': 10}, {'u': 12, 'v': 15}, {'u': 12, 'v': 23}, {'u': 18, 'v': 16}, {'u': 18, 'v': 19}, {'u': 4, 'v': 20}, {'u': 4, 'v': 22}, {'u': 10, 'v': 6}, {'u': 10, 'v': 9}, {'u': 10, 'v': 14}, {'u': 10, 'v': 21}, {'u': 10, 'v': 23}, {'u': 5, 'v': 7}, {'u': 5, 'v': 15}, {'u': 6, 'v': 9}, {'u': 6, 'v': 23}, {'u': 7, 'v': 15}, {'u': 13, 'v': 1}, {'u': 13, 'v': 2}, {'u': 13, 'v': 3}, {'u': 19, 'v': 14}, {'u': 19, 'v': 16}, {'u': 19, 'v': 20}, {'u': 20, 'v': 21}, {'u': 20, 'v': 22}, {'u': 21, 'v': 8}, {'u': 21, 'v': 14}, {'u': 21, 'v': 22}, {'u': 22, 'v': 8}, {'u': 3, 'v': 1}, {'u': 3, 'v': 2}, {'u': 24, 'v': 1}, {'u': 24, 'v': 2}, {'u': 24, 'v': 14}, {'u': 24, 'v': 17}, {'u': 8, 'v': 9}, {'u': 2, 'v': 14}, {'u': 2, 'v': 16}, {'u': 14, 'v': 15}, {'u': 15, 'v': 17}], 'source_file': 'wi2010.mtx', 'density': 0.15666666666666668, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0038.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0038.png', 'edge_connectivity': 2}","[3, 4, 5, 9, 11, 14, 17, 18, 23]",9.0,"{'num_nodes': 25, 'num_edges': 47, 'edges': [{'u': 10, 'v': 19}, {'u': 10, 'v': 20}, {'u': 10, 'v': 21}, {'u': 24, 'v': 0}, {'u': 24, 'v': 16}, {'u': 11, 'v': 5}, {'u': 11, 'v': 6}, {'u': 11, 'v': 9}, {'u': 11, 'v': 14}, {'u': 11, 'v': 22}, {'u': 17, 'v': 15}, {'u': 17, 'v': 18}, {'u': 3, 'v': 19}, {'u': 3, 'v': 21}, {'u': 9, 'v': 5}, {'u': 9, 'v': 8}, {'u': 9, 'v': 13}, {'u': 9, 'v': 20}, {'u': 9, 'v': 22}, {'u': 4, 'v': 6}, {'u': 4, 'v': 14}, {'u': 5, 'v': 8}, {'u': 5, 'v': 22}, {'u': 6, 'v': 14}, {'u': 12, 'v': 0}, {'u': 12, 'v': 1}, {'u': 12, 'v': 2}, {'u': 18, 'v': 13}, {'u': 18, 'v': 15}, {'u': 18, 'v': 19}, {'u': 19, 'v': 20}, {'u': 19, 'v': 21}, {'u': 20, 'v': 7}, {'u': 20, 'v': 13}, {'u': 20, 'v': 21}, {'u': 21, 'v': 7}, {'u': 2, 'v': 0}, {'u': 2, 'v': 1}, {'u': 23, 'v': 0}, {'u': 23, 'v': 1}, {'u': 23, 'v': 13}, {'u': 23, 'v': 16}, {'u': 7, 'v': 8}, {'u': 1, 'v': 13}, {'u': 1, 'v': 15}, {'u': 13, 'v': 14}, {'u': 14, 'v': 16}]}","[2, 3, 4, 8, 10, 13, 16, 17, 22]",39,csv,0
MIS,MIS,"Recently the backyard was reorganized and the challenge became: fill the mixed bed with as many kinds of plants as possible, while making sure none of the selected species are known enemies in the soil or sunlight. The choice to make is a selection from the available species that gives the highest total number of different plants — simply count them to see which selection is better. Every item is either in or out (no repeats), and any two chosen species must be compatible. The exact species list and which pairs clash are shown below.
Below are the 52 incompatible pairs among the 25 listed species.
Species 9 and 3 are incompatible and cannot both be planted together.
Species 9 and 14 are incompatible and cannot both be planted together.
Species 9 and 21 are incompatible and cannot both be planted together.
Species 9 and 23 are incompatible and cannot both be planted together.
Species 16 and 2 are incompatible and cannot both be planted together.
Species 16 and 4 are incompatible and cannot both be planted together.
Species 16 and 18 are incompatible and cannot both be planted together.
Species 3 and 17 are incompatible and cannot both be planted together.
Species 4 and 1 are incompatible and cannot both be planted together.
Species 4 and 2 are incompatible and cannot both be planted together.
Species 4 and 10 are incompatible and cannot both be planted together.
Species 4 and 11 are incompatible and cannot both be planted together.
Species 4 and 12 are incompatible and cannot both be planted together.
Species 4 and 18 are incompatible and cannot both be planted together.
Species 4 and 20 are incompatible and cannot both be planted together.
Species 4 and 21 are incompatible and cannot both be planted together.
Species 4 and 22 are incompatible and cannot both be planted together.
Species 4 and 23 are incompatible and cannot both be planted together.
Species 15 and 7 are incompatible and cannot both be planted together.
Species 15 and 8 are incompatible and cannot both be planted together.
Species 15 and 11 are incompatible and cannot both be planted together.
Species 15 and 12 are incompatible and cannot both be planted together.
Species 10 and 18 are incompatible and cannot both be planted together.
Species 6 and 5 are incompatible and cannot both be planted together.
Species 6 and 8 are incompatible and cannot both be planted together.
Species 5 and 8 are incompatible and cannot both be planted together.
Species 5 and 14 are incompatible and cannot both be planted together.
Species 23 and 17 are incompatible and cannot both be planted together.
Species 23 and 19 are incompatible and cannot both be planted together.
Species 23 and 20 are incompatible and cannot both be planted together.
Species 23 and 21 are incompatible and cannot both be planted together.
Species 23 and 25 are incompatible and cannot both be planted together.
Species 24 and 8 are incompatible and cannot both be planted together.
Species 24 and 11 are incompatible and cannot both be planted together.
Species 24 and 21 are incompatible and cannot both be planted together.
Species 7 and 8 are incompatible and cannot both be planted together.
Species 7 and 12 are incompatible and cannot both be planted together.
Species 7 and 13 are incompatible and cannot both be planted together.
Species 8 and 11 are incompatible and cannot both be planted together.
Species 8 and 14 are incompatible and cannot both be planted together.
Species 8 and 21 are incompatible and cannot both be planted together.
Species 20 and 1 are incompatible and cannot both be planted together.
Species 20 and 2 are incompatible and cannot both be planted together.
Species 20 and 25 are incompatible and cannot both be planted together.
Species 17 and 25 are incompatible and cannot both be planted together.
Species 25 and 2 are incompatible and cannot both be planted together.
Species 11 and 12 are incompatible and cannot both be planted together.
Species 2 and 1 are incompatible and cannot both be planted together.
Species 2 and 22 are incompatible and cannot both be planted together.
Species 19 and 21 are incompatible and cannot both be planted together.
Species 12 and 13 are incompatible and cannot both be planted together.
Species 1 and 22 are incompatible and cannot both be planted together.
The objective is to select the largest compatible set of species that avoids all listed incompatible pairs.
If you want to hand me the final pick, just use the tiny JSON sketch below so it's easy to read and parse — nothing fancy, just the shape I expect.
{
""solution"": [""plant_id"", ""plant_id"", ...]
}
Here that JSON means: put the selected species' IDs into the ""solution"" list — one entry per plant you'd like in the bed. Think of each ""plant_id"" as a placeholder for whatever label the instance uses for a species.
This is only a template showing the expected shape, not the actual answer — you'll replace those placeholders with the real IDs from the instance.
Please make sure to use the 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': 'MIS', 'num_nodes': 25, 'num_edges': 52, 'edges': [{'u': 9, 'v': 3}, {'u': 9, 'v': 14}, {'u': 9, 'v': 21}, {'u': 9, 'v': 23}, {'u': 16, 'v': 2}, {'u': 16, 'v': 4}, {'u': 16, 'v': 18}, {'u': 3, 'v': 17}, {'u': 4, 'v': 1}, {'u': 4, 'v': 2}, {'u': 4, 'v': 10}, {'u': 4, 'v': 11}, {'u': 4, 'v': 12}, {'u': 4, 'v': 18}, {'u': 4, 'v': 20}, {'u': 4, 'v': 21}, {'u': 4, 'v': 22}, {'u': 4, 'v': 23}, {'u': 15, 'v': 7}, {'u': 15, 'v': 8}, {'u': 15, 'v': 11}, {'u': 15, 'v': 12}, {'u': 10, 'v': 18}, {'u': 6, 'v': 5}, {'u': 6, 'v': 8}, {'u': 5, 'v': 8}, {'u': 5, 'v': 14}, {'u': 23, 'v': 17}, {'u': 23, 'v': 19}, {'u': 23, 'v': 20}, {'u': 23, 'v': 21}, {'u': 23, 'v': 25}, {'u': 24, 'v': 8}, {'u': 24, 'v': 11}, {'u': 24, 'v': 21}, {'u': 7, 'v': 8}, {'u': 7, 'v': 12}, {'u': 7, 'v': 13}, {'u': 8, 'v': 11}, {'u': 8, 'v': 14}, {'u': 8, 'v': 21}, {'u': 20, 'v': 1}, {'u': 20, 'v': 2}, {'u': 20, 'v': 25}, {'u': 17, 'v': 25}, {'u': 25, 'v': 2}, {'u': 11, 'v': 12}, {'u': 2, 'v': 1}, {'u': 2, 'v': 22}, {'u': 19, 'v': 21}, {'u': 12, 'v': 13}, {'u': 1, 'v': 22}], 'source_file': 'wv2010.mtx', 'density': 0.17333333333333334, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0039.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0039.png', 'edge_connectivity': 2}","[6, 10, 13, 14, 15, 16, 17, 19, 20, 22, 24]",11.0,"{'num_nodes': 25, 'num_edges': 52, 'edges': [{'u': 9, 'v': 3}, {'u': 9, 'v': 14}, {'u': 9, 'v': 21}, {'u': 9, 'v': 23}, {'u': 16, 'v': 2}, {'u': 16, 'v': 4}, {'u': 16, 'v': 18}, {'u': 3, 'v': 17}, {'u': 4, 'v': 1}, {'u': 4, 'v': 2}, {'u': 4, 'v': 10}, {'u': 4, 'v': 11}, {'u': 4, 'v': 12}, {'u': 4, 'v': 18}, {'u': 4, 'v': 20}, {'u': 4, 'v': 21}, {'u': 4, 'v': 22}, {'u': 4, 'v': 23}, {'u': 15, 'v': 7}, {'u': 15, 'v': 8}, {'u': 15, 'v': 11}, {'u': 15, 'v': 12}, {'u': 10, 'v': 18}, {'u': 6, 'v': 5}, {'u': 6, 'v': 8}, {'u': 5, 'v': 8}, {'u': 5, 'v': 14}, {'u': 23, 'v': 17}, {'u': 23, 'v': 19}, {'u': 23, 'v': 20}, {'u': 23, 'v': 21}, {'u': 23, 'v': 25}, {'u': 24, 'v': 8}, {'u': 24, 'v': 11}, {'u': 24, 'v': 21}, {'u': 7, 'v': 8}, {'u': 7, 'v': 12}, {'u': 7, 'v': 13}, {'u': 8, 'v': 11}, {'u': 8, 'v': 14}, {'u': 8, 'v': 21}, {'u': 20, 'v': 1}, {'u': 20, 'v': 2}, {'u': 20, 'v': 25}, {'u': 17, 'v': 25}, {'u': 25, 'v': 2}, {'u': 11, 'v': 12}, {'u': 2, 'v': 1}, {'u': 2, 'v': 22}, {'u': 19, 'v': 21}, {'u': 12, 'v': 13}, {'u': 1, 'v': 22}]}","[6, 10, 13, 14, 15, 16, 17, 19, 20, 22, 24]",40,nl,1
MIS,MIS,"I’m a curator juggling a pile of artifacts and a bulletin of ownership notes — the task is to pick one single exhibit from the collection that shows as many different pieces as possible. The trick is any two items that have provenance or ownership problems can’t be shown together, so the better choice is the set that includes the most non-conflicting items. That “best” set is just the one with the highest headcount, which you get by counting how many artifacts are chosen, and each artifact can only be included once or left out. The exact list of items and who conflicts with whom is shown below.
I've got 20 artifacts and 39 recorded conflict pairs:
Artifact 0 conflicts with 7, so I won't exhibit them together.
Artifact 0 conflicts with 8, so I won't exhibit them together.
Artifact 1 conflicts with 5, so I won't exhibit them together.
Artifact 1 conflicts with 12, so I won't exhibit them together.
Artifact 1 conflicts with 19, so I won't exhibit them together.
Artifact 6 conflicts with 4, so I won't exhibit them together.
Artifact 6 conflicts with 8, so I won't exhibit them together.
Artifact 6 conflicts with 9, so I won't exhibit them together.
Artifact 6 conflicts with 18, so I won't exhibit them together.
Artifact 9 conflicts with 2, so I won't exhibit them together.
Artifact 9 conflicts with 8, so I won't exhibit them together.
Artifact 9 conflicts with 14, so I won't exhibit them together.
Artifact 5 conflicts with 3, so I won't exhibit them together.
Artifact 5 conflicts with 8, so I won't exhibit them together.
Artifact 5 conflicts with 11, so I won't exhibit them together.
Artifact 5 conflicts with 19, so I won't exhibit them together.
Artifact 12 conflicts with 3, so I won't exhibit them together.
Artifact 17 conflicts with 7, so I won't exhibit them together.
Artifact 17 conflicts with 8, so I won't exhibit them together.
Artifact 17 conflicts with 16, so I won't exhibit them together.
Artifact 17 conflicts with 19, so I won't exhibit them together.
Artifact 18 conflicts with 3, so I won't exhibit them together.
Artifact 18 conflicts with 4, so I won't exhibit them together.
Artifact 18 conflicts with 8, so I won't exhibit them together.
Artifact 11 conflicts with 3, so I won't exhibit them together.
Artifact 11 conflicts with 8, so I won't exhibit them together.
Artifact 10 conflicts with 16, so I won't exhibit them together.
Artifact 10 conflicts with 19, so I won't exhibit them together.
Artifact 2 conflicts with 8, so I won't exhibit them together.
Artifact 2 conflicts with 14, so I won't exhibit them together.
Artifact 2 conflicts with 15, so I won't exhibit them together.
Artifact 3 conflicts with 4, so I won't exhibit them together.
Artifact 13 conflicts with 7, so I won't exhibit them together.
Artifact 13 conflicts with 8, so I won't exhibit them together.
Artifact 14 conflicts with 15, so I won't exhibit them together.
Artifact 7 conflicts with 8, so I won't exhibit them together.
Artifact 19 conflicts with 8, so I won't exhibit them together.
Artifact 16 conflicts with 15, so I won't exhibit them together.
Artifact 8 conflicts with 15, so I won't exhibit them together.
I'll use these notes to pick the single exhibit that shows the most non-conflicting artifacts.
I'll hand you the result in a tiny, predictable shape so it's easy to plug into whatever you're using next. Something like this will do:
{
""solution"": [""artifact_id"", ""artifact_id"", ...]
}
Here ""solution"" is just the list of artifacts I pick for the exhibition — each entry is an artifact identifier from the instance input. Think of it like filling out a form field called ""solution"" with the IDs of the pieces you want to show. This JSON is only a sketch of the expected shape, not the actual answer.
Please use the exact 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': 'MIS', 'num_nodes': 20, 'num_edges': 39, 'edges': [{'u': 1, 'v': 8}, {'u': 1, 'v': 9}, {'u': 2, 'v': 6}, {'u': 2, 'v': 13}, {'u': 2, 'v': 20}, {'u': 7, 'v': 5}, {'u': 7, 'v': 9}, {'u': 7, 'v': 10}, {'u': 7, 'v': 19}, {'u': 10, 'v': 3}, {'u': 10, 'v': 9}, {'u': 10, 'v': 15}, {'u': 6, 'v': 4}, {'u': 6, 'v': 9}, {'u': 6, 'v': 12}, {'u': 6, 'v': 20}, {'u': 13, 'v': 4}, {'u': 18, 'v': 8}, {'u': 18, 'v': 9}, {'u': 18, 'v': 17}, {'u': 18, 'v': 20}, {'u': 19, 'v': 4}, {'u': 19, 'v': 5}, {'u': 19, 'v': 9}, {'u': 12, 'v': 4}, {'u': 12, 'v': 9}, {'u': 11, 'v': 17}, {'u': 11, 'v': 20}, {'u': 3, 'v': 9}, {'u': 3, 'v': 15}, {'u': 3, 'v': 16}, {'u': 4, 'v': 5}, {'u': 14, 'v': 8}, {'u': 14, 'v': 9}, {'u': 15, 'v': 16}, {'u': 8, 'v': 9}, {'u': 20, 'v': 9}, {'u': 17, 'v': 16}, {'u': 9, 'v': 16}], 'source_file': 'wa2010.mtx', 'density': 0.20526315789473684, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0040.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0040.png', 'edge_connectivity': 2}","[1, 5, 10, 11, 12, 13, 14, 16, 18]",9.0,"{'num_nodes': 20, 'num_edges': 39, 'edges': [{'u': 0, 'v': 7}, {'u': 0, 'v': 8}, {'u': 1, 'v': 5}, {'u': 1, 'v': 12}, {'u': 1, 'v': 19}, {'u': 6, 'v': 4}, {'u': 6, 'v': 8}, {'u': 6, 'v': 9}, {'u': 6, 'v': 18}, {'u': 9, 'v': 2}, {'u': 9, 'v': 8}, {'u': 9, 'v': 14}, {'u': 5, 'v': 3}, {'u': 5, 'v': 8}, {'u': 5, 'v': 11}, {'u': 5, 'v': 19}, {'u': 12, 'v': 3}, {'u': 17, 'v': 7}, {'u': 17, 'v': 8}, {'u': 17, 'v': 16}, {'u': 17, 'v': 19}, {'u': 18, 'v': 3}, {'u': 18, 'v': 4}, {'u': 18, 'v': 8}, {'u': 11, 'v': 3}, {'u': 11, 'v': 8}, {'u': 10, 'v': 16}, {'u': 10, 'v': 19}, {'u': 2, 'v': 8}, {'u': 2, 'v': 14}, {'u': 2, 'v': 15}, {'u': 3, 'v': 4}, {'u': 13, 'v': 7}, {'u': 13, 'v': 8}, {'u': 14, 'v': 15}, {'u': 7, 'v': 8}, {'u': 19, 'v': 8}, {'u': 16, 'v': 15}, {'u': 8, 'v': 15}]}","[0, 4, 9, 10, 11, 12, 13, 15, 17]",41,nl,0
MIS,MIS,"Many libraries run into this: a curator wants a front table packed with titles, yet a few specific combinations are off-limits for display together. The curator must pick a set of distinct books, and the better selection is simply the one that results in the greatest number of books on the table while never placing any disallowed pair together. The concrete details will be shown below.
# total_books=24
# num_restricted_pairs=44
book_id_u,book_id_v
5,7
5,9
5,17
6,1
6,8
6,11
6,12
6,13
6,14
6,16
6,19
6,20
6,23
6,24
16,3
16,8
16,13
16,15
16,18
15,3
18,3
18,9
18,13
18,23
9,3
9,4
9,19
9,21
9,22
9,23
1,10
1,14
2,11
2,17
2,24
4,21
19,12
19,22
19,23
22,17
23,13
20,24
17,11
17,12
Oh, and to keep things tidy, please send your pick in this simple JSON layout so it’s easy to read and process:
{
""solution"": [""book_id"", ""book_id"", ...]
}
This just means ""solution"" is the list of books you’d put on the front table. Each entry in the array should be the identifier for a book from the instance (you're just filling in the labels). Think of it like a little form — this is the shape I expect, not the actual final answer.
Please use each identifier exactly as it appears in the instance input — don’t rename them or invent new labels. For example:
- plain numbers such as ""1"" or ""23""
- single capital letters like ""A"" or ""B""
- a capital letter followed by digits like ""A1"" or ""X7""","{'problem_type': 'MIS', 'num_nodes': 24, 'num_edges': 44, 'edges': [{'u': 5, 'v': 7}, {'u': 5, 'v': 9}, {'u': 5, 'v': 17}, {'u': 6, 'v': 1}, {'u': 6, 'v': 8}, {'u': 6, 'v': 11}, {'u': 6, 'v': 12}, {'u': 6, 'v': 13}, {'u': 6, 'v': 14}, {'u': 6, 'v': 16}, {'u': 6, 'v': 19}, {'u': 6, 'v': 20}, {'u': 6, 'v': 23}, {'u': 6, 'v': 24}, {'u': 16, 'v': 3}, {'u': 16, 'v': 8}, {'u': 16, 'v': 13}, {'u': 16, 'v': 15}, {'u': 16, 'v': 18}, {'u': 15, 'v': 3}, {'u': 18, 'v': 3}, {'u': 18, 'v': 9}, {'u': 18, 'v': 13}, {'u': 18, 'v': 23}, {'u': 9, 'v': 3}, {'u': 9, 'v': 4}, {'u': 9, 'v': 19}, {'u': 9, 'v': 21}, {'u': 9, 'v': 22}, {'u': 9, 'v': 23}, {'u': 1, 'v': 10}, {'u': 1, 'v': 14}, {'u': 2, 'v': 11}, {'u': 2, 'v': 17}, {'u': 2, 'v': 24}, {'u': 4, 'v': 21}, {'u': 19, 'v': 12}, {'u': 19, 'v': 22}, {'u': 19, 'v': 23}, {'u': 22, 'v': 17}, {'u': 23, 'v': 13}, {'u': 20, 'v': 24}, {'u': 17, 'v': 11}, {'u': 17, 'v': 12}], 'source_file': 'wa2010.mtx', 'density': 0.15942028985507245, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0041.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0041.png', 'edge_connectivity': 1}","[4, 7, 8, 10, 11, 12, 14, 15, 18, 20, 22]",11.0,"{'num_nodes': 24, 'num_edges': 44, 'edges': [{'u': 5, 'v': 7}, {'u': 5, 'v': 9}, {'u': 5, 'v': 17}, {'u': 6, 'v': 1}, {'u': 6, 'v': 8}, {'u': 6, 'v': 11}, {'u': 6, 'v': 12}, {'u': 6, 'v': 13}, {'u': 6, 'v': 14}, {'u': 6, 'v': 16}, {'u': 6, 'v': 19}, {'u': 6, 'v': 20}, {'u': 6, 'v': 23}, {'u': 6, 'v': 24}, {'u': 16, 'v': 3}, {'u': 16, 'v': 8}, {'u': 16, 'v': 13}, {'u': 16, 'v': 15}, {'u': 16, 'v': 18}, {'u': 15, 'v': 3}, {'u': 18, 'v': 3}, {'u': 18, 'v': 9}, {'u': 18, 'v': 13}, {'u': 18, 'v': 23}, {'u': 9, 'v': 3}, {'u': 9, 'v': 4}, {'u': 9, 'v': 19}, {'u': 9, 'v': 21}, {'u': 9, 'v': 22}, {'u': 9, 'v': 23}, {'u': 1, 'v': 10}, {'u': 1, 'v': 14}, {'u': 2, 'v': 11}, {'u': 2, 'v': 17}, {'u': 2, 'v': 24}, {'u': 4, 'v': 21}, {'u': 19, 'v': 12}, {'u': 19, 'v': 22}, {'u': 19, 'v': 23}, {'u': 22, 'v': 17}, {'u': 23, 'v': 13}, {'u': 20, 'v': 24}, {'u': 17, 'v': 11}, {'u': 17, 'v': 12}]}","[4, 7, 8, 10, 11, 12, 14, 15, 18, 20, 22]",42,csv,1
MIS,MIS,"Many people forget that plugins can clash, so the admin’s goal is to get as many helpful add-ons running as possible without turning on any two that are incompatible. The decision is about which set to pick so the number of enabled plugins is maximized — measure that by simply counting enabled, distinct plugins, and make sure no conflicting duo is included. The exact list of plugins and the conflict pairs are shown below.
There are 22 num plugins in total and 40 num conflicts.
| plugin_a | plugin_b |
|---|---|
| F | A |
| F | B |
| F | J |
| J | B |
| J | M |
| J | N |
| J | T |
| J | U |
| P | H |
| P | N |
| P | O |
| K | D |
| K | N |
| K | O |
| K | U |
| S | H |
| S | V |
| C | A |
| C | G |
| D | A |
| D | E |
| E | O |
| H | O |
| H | Q |
| H | R |
| H | V |
| L | T |
| T | G |
| T | I |
| T | M |
| T | N |
| T | R |
| N | O |
| N | R |
| O | V |
| A | B |
| A | U |
| Q | I |
| Q | R |
| R | I |
Oh, and when you send the chosen set back, just toss it into a tiny JSON object like this — super simple:
{
""solution"": [""plugin_id"", ""plugin_id"", ...]
}
Here ""solution"" is just the list of plugins you want enabled, and each ""plugin_id"" is a placeholder for one of the actual plugin identifiers from the instance. Think of it like filling out a form: put each chosen plugin’s exact ID into that array. This block is only a sketch of the shape I expect, not the actual answer.
Please use the 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': 'MIS', 'num_nodes': 22, 'num_edges': 40, 'edges': [{'u': 6, 'v': 1}, {'u': 6, 'v': 2}, {'u': 6, 'v': 10}, {'u': 10, 'v': 2}, {'u': 10, 'v': 13}, {'u': 10, 'v': 14}, {'u': 10, 'v': 20}, {'u': 10, 'v': 21}, {'u': 16, 'v': 8}, {'u': 16, 'v': 14}, {'u': 16, 'v': 15}, {'u': 11, 'v': 4}, {'u': 11, 'v': 14}, {'u': 11, 'v': 15}, {'u': 11, 'v': 21}, {'u': 19, 'v': 8}, {'u': 19, 'v': 22}, {'u': 3, 'v': 1}, {'u': 3, 'v': 7}, {'u': 4, 'v': 1}, {'u': 4, 'v': 5}, {'u': 5, 'v': 15}, {'u': 8, 'v': 15}, {'u': 8, 'v': 17}, {'u': 8, 'v': 18}, {'u': 8, 'v': 22}, {'u': 12, 'v': 20}, {'u': 20, 'v': 7}, {'u': 20, 'v': 9}, {'u': 20, 'v': 13}, {'u': 20, 'v': 14}, {'u': 20, 'v': 18}, {'u': 14, 'v': 15}, {'u': 14, 'v': 18}, {'u': 15, 'v': 22}, {'u': 1, 'v': 2}, {'u': 1, 'v': 21}, {'u': 17, 'v': 9}, {'u': 17, 'v': 18}, {'u': 18, 'v': 9}], 'source_file': 'wy2010.mtx', 'density': 0.17316017316017315, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0042.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0042.png', 'edge_connectivity': 1}","[2, 5, 7, 9, 12, 13, 16, 19, 21]",9.0,"{'num_nodes': 22, 'num_edges': 40, 'edges': [{'u': 'F', 'v': 'A'}, {'u': 'F', 'v': 'B'}, {'u': 'F', 'v': 'J'}, {'u': 'J', 'v': 'B'}, {'u': 'J', 'v': 'M'}, {'u': 'J', 'v': 'N'}, {'u': 'J', 'v': 'T'}, {'u': 'J', 'v': 'U'}, {'u': 'P', 'v': 'H'}, {'u': 'P', 'v': 'N'}, {'u': 'P', 'v': 'O'}, {'u': 'K', 'v': 'D'}, {'u': 'K', 'v': 'N'}, {'u': 'K', 'v': 'O'}, {'u': 'K', 'v': 'U'}, {'u': 'S', 'v': 'H'}, {'u': 'S', 'v': 'V'}, {'u': 'C', 'v': 'A'}, {'u': 'C', 'v': 'G'}, {'u': 'D', 'v': 'A'}, {'u': 'D', 'v': 'E'}, {'u': 'E', 'v': 'O'}, {'u': 'H', 'v': 'O'}, {'u': 'H', 'v': 'Q'}, {'u': 'H', 'v': 'R'}, {'u': 'H', 'v': 'V'}, {'u': 'L', 'v': 'T'}, {'u': 'T', 'v': 'G'}, {'u': 'T', 'v': 'I'}, {'u': 'T', 'v': 'M'}, {'u': 'T', 'v': 'N'}, {'u': 'T', 'v': 'R'}, {'u': 'N', 'v': 'O'}, {'u': 'N', 'v': 'R'}, {'u': 'O', 'v': 'V'}, {'u': 'A', 'v': 'B'}, {'u': 'A', 'v': 'U'}, {'u': 'Q', 'v': 'I'}, {'u': 'Q', 'v': 'R'}, {'u': 'R', 'v': 'I'}]}","['B', 'E', 'G', 'I', 'L', 'M', 'P', 'S', 'U']",43,markdown_table,names
MIS,MIS,"At the planning meeting the team wanted to pack the special issue with as many articles as it could hold while respecting that certain pairs were known to overlap and therefore shouldn’t both be included. The decision becomes selecting a collection of pieces that have no mutual overlap marks, and the way to compare collections is straightforward — count how many items are in each and prefer the one with the greatest count. No duplicate acceptances, and any pair flagged as overlapping cannot both appear. The concrete submission details and their overlaps are listed below.
# total_submissions=21
# total_overlap_flags=37
article_a_id,article_b_id
19,12
12,1
12,5
12,9
12,16
18,2
18,4
18,5
18,6
18,11
18,17
13,11
13,21
20,3
20,4
20,6
20,11
5,2
5,15
5,16
5,17
1,9
1,10
1,15
6,11
2,16
3,4
4,7
8,14
8,17
21,16
7,17
11,16
14,10
14,15
14,17
15,17
Oh, and one more thing — when you send back the chosen set, a simple JSON snippet like this is perfect:
{
""solution"": [""article_id"", ""article_id"", ...]
}
Think of ""solution"" as just the list of article IDs you want to include in the special issue — one entry per chosen piece. This is just a sketch of the expected shape, not the actual selection.
Please make sure to use the exact identifiers from 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': 'MIS', 'num_nodes': 21, 'num_edges': 37, 'edges': [{'u': 19, 'v': 12}, {'u': 12, 'v': 1}, {'u': 12, 'v': 5}, {'u': 12, 'v': 9}, {'u': 12, 'v': 16}, {'u': 18, 'v': 2}, {'u': 18, 'v': 4}, {'u': 18, 'v': 5}, {'u': 18, 'v': 6}, {'u': 18, 'v': 11}, {'u': 18, 'v': 17}, {'u': 13, 'v': 11}, {'u': 13, 'v': 21}, {'u': 20, 'v': 3}, {'u': 20, 'v': 4}, {'u': 20, 'v': 6}, {'u': 20, 'v': 11}, {'u': 5, 'v': 2}, {'u': 5, 'v': 15}, {'u': 5, 'v': 16}, {'u': 5, 'v': 17}, {'u': 1, 'v': 9}, {'u': 1, 'v': 10}, {'u': 1, 'v': 15}, {'u': 6, 'v': 11}, {'u': 2, 'v': 16}, {'u': 3, 'v': 4}, {'u': 4, 'v': 7}, {'u': 8, 'v': 14}, {'u': 8, 'v': 17}, {'u': 21, 'v': 16}, {'u': 7, 'v': 17}, {'u': 11, 'v': 16}, {'u': 14, 'v': 10}, {'u': 14, 'v': 15}, {'u': 14, 'v': 17}, {'u': 15, 'v': 17}], 'source_file': 'wv2010.mtx', 'density': 0.1761904761904762, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0043.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0043.png', 'edge_connectivity': 1}","[3, 6, 7, 8, 9, 10, 13, 15, 16, 19]",10.0,"{'num_nodes': 21, 'num_edges': 37, 'edges': [{'u': 19, 'v': 12}, {'u': 12, 'v': 1}, {'u': 12, 'v': 5}, {'u': 12, 'v': 9}, {'u': 12, 'v': 16}, {'u': 18, 'v': 2}, {'u': 18, 'v': 4}, {'u': 18, 'v': 5}, {'u': 18, 'v': 6}, {'u': 18, 'v': 11}, {'u': 18, 'v': 17}, {'u': 13, 'v': 11}, {'u': 13, 'v': 21}, {'u': 20, 'v': 3}, {'u': 20, 'v': 4}, {'u': 20, 'v': 6}, {'u': 20, 'v': 11}, {'u': 5, 'v': 2}, {'u': 5, 'v': 15}, {'u': 5, 'v': 16}, {'u': 5, 'v': 17}, {'u': 1, 'v': 9}, {'u': 1, 'v': 10}, {'u': 1, 'v': 15}, {'u': 6, 'v': 11}, {'u': 2, 'v': 16}, {'u': 3, 'v': 4}, {'u': 4, 'v': 7}, {'u': 8, 'v': 14}, {'u': 8, 'v': 17}, {'u': 21, 'v': 16}, {'u': 7, 'v': 17}, {'u': 11, 'v': 16}, {'u': 14, 'v': 10}, {'u': 14, 'v': 15}, {'u': 14, 'v': 17}, {'u': 15, 'v': 17}]}","[3, 6, 7, 8, 9, 10, 13, 15, 16, 19]",44,csv,1
MIS,MIS,"Someone on the block is trying to deck their house with every cool string of lights they own, but they can’t run certain pairs at the same time because they interfere with each other. The decision is which combination of light sets to put up so the house looks fullest — measured by the total number of distinct sets used — while avoiding any incompatible pair. No set gets duplicated, and every set that’s chosen must be compatible with all the others; the aim is simply to maximize that count. The exact inventory and the incompatibility notes are shown below.
They have 21 distinct light sets and 40 incompatible pairs:
Light set 5 cannot be used with light set 6.
Light set 5 cannot be used with light set 8.
Light set 5 cannot be used with light set 9.
Light set 5 cannot be used with light set 15.
Light set 3 cannot be used with light set 2.
Light set 3 cannot be used with light set 4.
Light set 3 cannot be used with light set 9.
Light set 3 cannot be used with light set 10.
Light set 21 cannot be used with light set 4.
Light set 21 cannot be used with light set 17.
Light set 21 cannot be used with light set 19.
Light set 16 cannot be used with light set 1.
Light set 16 cannot be used with light set 12.
Light set 16 cannot be used with light set 18.
Light set 16 cannot be used with light set 20.
Light set 20 cannot be used with light set 11.
Light set 20 cannot be used with light set 18.
Light set 6 cannot be used with light set 8.
Light set 6 cannot be used with light set 15.
Light set 11 cannot be used with light set 1.
Light set 11 cannot be used with light set 2.
Light set 11 cannot be used with light set 7.
Light set 11 cannot be used with light set 10.
Light set 11 cannot be used with light set 18.
Light set 17 cannot be used with light set 4.
Light set 17 cannot be used with light set 7.
Light set 17 cannot be used with light set 15.
Light set 17 cannot be used with light set 18.
Light set 17 cannot be used with light set 19.
Light set 7 cannot be used with light set 4.
Light set 7 cannot be used with light set 10.
Light set 8 cannot be used with light set 9.
Light set 15 cannot be used with light set 4.
Light set 14 cannot be used with light set 2.
Light set 14 cannot be used with light set 13.
Light set 19 cannot be used with light set 4.
Light set 1 cannot be used with light set 2.
Light set 1 cannot be used with light set 12.
Light set 10 cannot be used with light set 4.
Light set 9 cannot be used with light set 4.
They want to maximize the number of chosen light sets that are pairwise compatible.
If you want to give the answer in a neat, machine-friendly way, just follow this simple JSON shape when you reply — nothing fancy, just a plain list of the light sets you picked:
{
""solution"": [""light_id"", ""light_id"", ...]
}
""solution"" is the list of sets you'll hang up — each entry is the identifier for one of the light sets from the problem. Think of it like filling in a short form: list each chosen set's ID in that array. This block is just a sketch of the shape I expect, not the actual answer itself.
Please make 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': 'MIS', 'num_nodes': 21, 'num_edges': 40, 'edges': [{'u': 5, 'v': 6}, {'u': 5, 'v': 8}, {'u': 5, 'v': 9}, {'u': 5, 'v': 15}, {'u': 3, 'v': 2}, {'u': 3, 'v': 4}, {'u': 3, 'v': 9}, {'u': 3, 'v': 10}, {'u': 21, 'v': 4}, {'u': 21, 'v': 17}, {'u': 21, 'v': 19}, {'u': 16, 'v': 1}, {'u': 16, 'v': 12}, {'u': 16, 'v': 18}, {'u': 16, 'v': 20}, {'u': 20, 'v': 11}, {'u': 20, 'v': 18}, {'u': 6, 'v': 8}, {'u': 6, 'v': 15}, {'u': 11, 'v': 1}, {'u': 11, 'v': 2}, {'u': 11, 'v': 7}, {'u': 11, 'v': 10}, {'u': 11, 'v': 18}, {'u': 17, 'v': 4}, {'u': 17, 'v': 7}, {'u': 17, 'v': 15}, {'u': 17, 'v': 18}, {'u': 17, 'v': 19}, {'u': 7, 'v': 4}, {'u': 7, 'v': 10}, {'u': 8, 'v': 9}, {'u': 15, 'v': 4}, {'u': 14, 'v': 2}, {'u': 14, 'v': 13}, {'u': 19, 'v': 4}, {'u': 1, 'v': 2}, {'u': 1, 'v': 12}, {'u': 10, 'v': 4}, {'u': 9, 'v': 4}], 'source_file': 'wi2010.mtx', 'density': 0.19047619047619047, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0044.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0044.png', 'edge_connectivity': 1}","[2, 7, 8, 12, 13, 15, 20, 21]",8.0,"{'num_nodes': 21, 'num_edges': 40, 'edges': [{'u': 5, 'v': 6}, {'u': 5, 'v': 8}, {'u': 5, 'v': 9}, {'u': 5, 'v': 15}, {'u': 3, 'v': 2}, {'u': 3, 'v': 4}, {'u': 3, 'v': 9}, {'u': 3, 'v': 10}, {'u': 21, 'v': 4}, {'u': 21, 'v': 17}, {'u': 21, 'v': 19}, {'u': 16, 'v': 1}, {'u': 16, 'v': 12}, {'u': 16, 'v': 18}, {'u': 16, 'v': 20}, {'u': 20, 'v': 11}, {'u': 20, 'v': 18}, {'u': 6, 'v': 8}, {'u': 6, 'v': 15}, {'u': 11, 'v': 1}, {'u': 11, 'v': 2}, {'u': 11, 'v': 7}, {'u': 11, 'v': 10}, {'u': 11, 'v': 18}, {'u': 17, 'v': 4}, {'u': 17, 'v': 7}, {'u': 17, 'v': 15}, {'u': 17, 'v': 18}, {'u': 17, 'v': 19}, {'u': 7, 'v': 4}, {'u': 7, 'v': 10}, {'u': 8, 'v': 9}, {'u': 15, 'v': 4}, {'u': 14, 'v': 2}, {'u': 14, 'v': 13}, {'u': 19, 'v': 4}, {'u': 1, 'v': 2}, {'u': 1, 'v': 12}, {'u': 10, 'v': 4}, {'u': 9, 'v': 4}]}","[2, 7, 8, 12, 13, 15, 20, 21]",45,nl,1
MIS,MIS,"There’s a festival director juggling invitations: the goal is to invite the largest possible group of filmmakers while making sure no two of them are publicly at odds and would refuse to share the program. The difference between choices is just how many filmmakers end up on the final list — the better plan is the one with the highest count of distinct, non-conflicting guests. Each person on the list has to be a different filmmaker and can’t be paired with someone they’re feuding with, and the exact lineup options and dispute pairs are shown below.
{
""total_filmmakers"": 20,
""total_dispute_pairs"": 40,
""edges"": [
{
""filmmaker_one_id"": ""A"",
""filmmaker_two_id"": ""B""
},
{
""filmmaker_one_id"": ""A"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""A"",
""filmmaker_two_id"": ""M""
},
{
""filmmaker_one_id"": ""A"",
""filmmaker_two_id"": ""O""
},
{
""filmmaker_one_id"": ""A"",
""filmmaker_two_id"": ""P""
},
{
""filmmaker_one_id"": ""B"",
""filmmaker_two_id"": ""I""
},
{
""filmmaker_one_id"": ""B"",
""filmmaker_two_id"": ""R""
},
{
""filmmaker_one_id"": ""C"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""O"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""O"",
""filmmaker_two_id"": ""P""
},
{
""filmmaker_one_id"": ""P"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""J"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""J"",
""filmmaker_two_id"": ""H""
},
{
""filmmaker_one_id"": ""D"",
""filmmaker_two_id"": ""H""
},
{
""filmmaker_one_id"": ""D"",
""filmmaker_two_id"": ""L""
},
{
""filmmaker_one_id"": ""D"",
""filmmaker_two_id"": ""N""
},
{
""filmmaker_one_id"": ""K"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""K"",
""filmmaker_two_id"": ""M""
},
{
""filmmaker_one_id"": ""K"",
""filmmaker_two_id"": ""R""
},
{
""filmmaker_one_id"": ""S"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""S"",
""filmmaker_two_id"": ""Q""
},
{
""filmmaker_one_id"": ""T"",
""filmmaker_two_id"": ""F""
},
{
""filmmaker_one_id"": ""T"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""T"",
""filmmaker_two_id"": ""H""
},
{
""filmmaker_one_id"": ""T"",
""filmmaker_two_id"": ""R""
},
{
""filmmaker_one_id"": ""M"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""M"",
""filmmaker_two_id"": ""R""
},
{
""filmmaker_one_id"": ""Q"",
""filmmaker_two_id"": ""E""
},
{
""filmmaker_one_id"": ""Q"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""R"",
""filmmaker_two_id"": ""F""
},
{
""filmmaker_one_id"": ""R"",
""filmmaker_two_id"": ""G""
},
{
""filmmaker_one_id"": ""R"",
""filmmaker_two_id"": ""I""
},
{
""filmmaker_one_id"": ""R"",
""filmmaker_two_id"": ""L""
},
{
""filmmaker_one_id"": ""I"",
""filmmaker_two_id"": ""L""
},
{
""filmmaker_one_id"": ""I"",
""filmmaker_two_id"": ""N""
},
{
""filmmaker_one_id"": ""G"",
""filmmaker_two_id"": ""E""
},
{
""filmmaker_one_id"": ""G"",
""filmmaker_two_id"": ""H""
},
{
""filmmaker_one_id"": ""H"",
""filmmaker_two_id"": ""F""
},
{
""filmmaker_one_id"": ""N"",
""filmmaker_two_id"": ""L""
},
{
""filmmaker_one_id"": ""L"",
""filmmaker_two_id"": ""F""
}
]
}
If you want to hand me the final guest list, just drop it in a tiny JSON snippet like this — real simple:
{
""solution"": [""filmmaker_id"", ""filmmaker_id"", ...]
}
Here, ""solution"" is the list of chosen filmmakers (one entry per invited person). Think of each string in the array as the exact ID from the instance — like filling out a short form with the names or codes you were given. This JSON 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 — don't 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': 'MIS', 'num_nodes': 20, 'num_edges': 40, 'edges': [{'u': 1, 'v': 2}, {'u': 1, 'v': 7}, {'u': 1, 'v': 13}, {'u': 1, 'v': 15}, {'u': 1, 'v': 16}, {'u': 2, 'v': 9}, {'u': 2, 'v': 18}, {'u': 3, 'v': 7}, {'u': 15, 'v': 7}, {'u': 15, 'v': 16}, {'u': 16, 'v': 7}, {'u': 10, 'v': 7}, {'u': 10, 'v': 8}, {'u': 4, 'v': 8}, {'u': 4, 'v': 12}, {'u': 4, 'v': 14}, {'u': 11, 'v': 7}, {'u': 11, 'v': 13}, {'u': 11, 'v': 18}, {'u': 19, 'v': 7}, {'u': 19, 'v': 17}, {'u': 20, 'v': 6}, {'u': 20, 'v': 7}, {'u': 20, 'v': 8}, {'u': 20, 'v': 18}, {'u': 13, 'v': 7}, {'u': 13, 'v': 18}, {'u': 17, 'v': 5}, {'u': 17, 'v': 7}, {'u': 18, 'v': 6}, {'u': 18, 'v': 7}, {'u': 18, 'v': 9}, {'u': 18, 'v': 12}, {'u': 9, 'v': 12}, {'u': 9, 'v': 14}, {'u': 7, 'v': 5}, {'u': 7, 'v': 8}, {'u': 8, 'v': 6}, {'u': 14, 'v': 12}, {'u': 12, 'v': 6}], 'source_file': 'wy2010.mtx', 'density': 0.21052631578947367, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0045.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0045.png', 'edge_connectivity': 1}","[2, 3, 4, 5, 10, 11, 15, 19, 20]",9.0,"{'num_nodes': 20, 'num_edges': 40, 'edges': [{'u': 'A', 'v': 'B'}, {'u': 'A', 'v': 'G'}, {'u': 'A', 'v': 'M'}, {'u': 'A', 'v': 'O'}, {'u': 'A', 'v': 'P'}, {'u': 'B', 'v': 'I'}, {'u': 'B', 'v': 'R'}, {'u': 'C', 'v': 'G'}, {'u': 'O', 'v': 'G'}, {'u': 'O', 'v': 'P'}, {'u': 'P', 'v': 'G'}, {'u': 'J', 'v': 'G'}, {'u': 'J', 'v': 'H'}, {'u': 'D', 'v': 'H'}, {'u': 'D', 'v': 'L'}, {'u': 'D', 'v': 'N'}, {'u': 'K', 'v': 'G'}, {'u': 'K', 'v': 'M'}, {'u': 'K', 'v': 'R'}, {'u': 'S', 'v': 'G'}, {'u': 'S', 'v': 'Q'}, {'u': 'T', 'v': 'F'}, {'u': 'T', 'v': 'G'}, {'u': 'T', 'v': 'H'}, {'u': 'T', 'v': 'R'}, {'u': 'M', 'v': 'G'}, {'u': 'M', 'v': 'R'}, {'u': 'Q', 'v': 'E'}, {'u': 'Q', 'v': 'G'}, {'u': 'R', 'v': 'F'}, {'u': 'R', 'v': 'G'}, {'u': 'R', 'v': 'I'}, {'u': 'R', 'v': 'L'}, {'u': 'I', 'v': 'L'}, {'u': 'I', 'v': 'N'}, {'u': 'G', 'v': 'E'}, {'u': 'G', 'v': 'H'}, {'u': 'H', 'v': 'F'}, {'u': 'N', 'v': 'L'}, {'u': 'L', 'v': 'F'}]}","['B', 'C', 'D', 'E', 'J', 'K', 'O', 'S', 'T']",46,json,names
MIS,MIS,"A neighborhood group is trying to form a volunteer team for a fundraiser, trying to cram in as many helpers as they can without putting any two people together who have past disagreements. The decision is picking the final lineup; the superior lineup is the one with more people, determined by counting how many volunteers are on it. Each person may appear only once on the roster and no conflicting pair may both be included; the specific roster choices and conflict notes are detailed below.
# total_volunteers=20
# total_conflict_pairs=39
volunteer_a,volunteer_b
M,A
M,C
M,D
M,F
M,G
M,I
M,J
M,K
M,O
N,I
N,O
N,R
E,B
E,C
E,H
P,C
P,Q
P,S
P,T
Q,R
F,C
F,T
S,R
S,T
R,O
L,C
A,C
A,D
A,J
O,T
D,C
D,K
G,H
G,I
J,B
J,C
H,I
K,C
B,C
Also, when you send the final lineup back, please use this simple JSON shape so it's easy to read automatically:
{
""solution"": [""volunteer_id"", ""volunteer_id"", ...]
}
Think of ""solution"" as the roster: a list of volunteer IDs (one per chosen person). The example values are just placeholders showing the shape of the reply — they aren't the actual picks.
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': 'MIS', 'num_nodes': 20, 'num_edges': 39, 'edges': [{'u': 13, 'v': 1}, {'u': 13, 'v': 3}, {'u': 13, 'v': 4}, {'u': 13, 'v': 6}, {'u': 13, 'v': 7}, {'u': 13, 'v': 9}, {'u': 13, 'v': 10}, {'u': 13, 'v': 11}, {'u': 13, 'v': 15}, {'u': 14, 'v': 9}, {'u': 14, 'v': 15}, {'u': 14, 'v': 18}, {'u': 5, 'v': 2}, {'u': 5, 'v': 3}, {'u': 5, 'v': 8}, {'u': 16, 'v': 3}, {'u': 16, 'v': 17}, {'u': 16, 'v': 19}, {'u': 16, 'v': 20}, {'u': 17, 'v': 18}, {'u': 6, 'v': 3}, {'u': 6, 'v': 20}, {'u': 19, 'v': 18}, {'u': 19, 'v': 20}, {'u': 18, 'v': 15}, {'u': 12, 'v': 3}, {'u': 1, 'v': 3}, {'u': 1, 'v': 4}, {'u': 1, 'v': 10}, {'u': 15, 'v': 20}, {'u': 4, 'v': 3}, {'u': 4, 'v': 11}, {'u': 7, 'v': 8}, {'u': 7, 'v': 9}, {'u': 10, 'v': 2}, {'u': 10, 'v': 3}, {'u': 8, 'v': 9}, {'u': 11, 'v': 3}, {'u': 2, 'v': 3}], 'source_file': 'vt2010.mtx', 'density': 0.20526315789473684, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0046.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0046.png', 'edge_connectivity': 1}","[1, 5, 6, 7, 11, 12, 14, 17, 19]",9.0,"{'num_nodes': 20, 'num_edges': 39, 'edges': [{'u': 'M', 'v': 'A'}, {'u': 'M', 'v': 'C'}, {'u': 'M', 'v': 'D'}, {'u': 'M', 'v': 'F'}, {'u': 'M', 'v': 'G'}, {'u': 'M', 'v': 'I'}, {'u': 'M', 'v': 'J'}, {'u': 'M', 'v': 'K'}, {'u': 'M', 'v': 'O'}, {'u': 'N', 'v': 'I'}, {'u': 'N', 'v': 'O'}, {'u': 'N', 'v': 'R'}, {'u': 'E', 'v': 'B'}, {'u': 'E', 'v': 'C'}, {'u': 'E', 'v': 'H'}, {'u': 'P', 'v': 'C'}, {'u': 'P', 'v': 'Q'}, {'u': 'P', 'v': 'S'}, {'u': 'P', 'v': 'T'}, {'u': 'Q', 'v': 'R'}, {'u': 'F', 'v': 'C'}, {'u': 'F', 'v': 'T'}, {'u': 'S', 'v': 'R'}, {'u': 'S', 'v': 'T'}, {'u': 'R', 'v': 'O'}, {'u': 'L', 'v': 'C'}, {'u': 'A', 'v': 'C'}, {'u': 'A', 'v': 'D'}, {'u': 'A', 'v': 'J'}, {'u': 'O', 'v': 'T'}, {'u': 'D', 'v': 'C'}, {'u': 'D', 'v': 'K'}, {'u': 'G', 'v': 'H'}, {'u': 'G', 'v': 'I'}, {'u': 'J', 'v': 'B'}, {'u': 'J', 'v': 'C'}, {'u': 'H', 'v': 'I'}, {'u': 'K', 'v': 'C'}, {'u': 'B', 'v': 'C'}]}","['A', 'E', 'F', 'G', 'K', 'L', 'N', 'Q', 'S']",47,csv,names
MIS,MIS,"Out in the market, an angel has a shortlist and wants to back the biggest possible group of startups, but some pairs of startups have exclusivity pacts so it’s off-limits to fund both at once. What counts as a better decision is obvious — it’s the one that funds more different startups; to compare plans, simply count how many distinct companies are included. The practical rules are: picks come only from the shortlist, each startup appears only once in the picks, and no two picked startups can be in an exclusivity relationship. The detailed shortlist and the exclusivity pairings follow below.
# total_shortlist_startups=25
# num_exclusivity_agreements=48
startup_id_one,startup_id_two
25,4
25,7
25,10
4,7
4,10
24,8
24,12
24,23
11,10
11,22
12,10
16,9
16,10
16,17
16,19
17,10
17,13
17,19
2,10
2,15
2,21
2,23
5,6
5,10
5,21
6,10
6,14
7,10
8,10
8,23
21,10
21,15
21,23
14,10
14,20
22,10
22,18
18,10
18,13
19,3
19,10
20,10
10,3
10,9
10,13
10,15
10,23
3,1
Oh, and when you send your picks back, just use this simple JSON shape so it's easy to parse:
{
""solution"": [""startup_id"", ""startup_id"", ...]
}
This is just a sketch of the shape I expect: ""solution"" should be an array containing the identifiers of the startups you choose (one entry per startup). Keep it informal—think of it like filling in a short form listing which startups to back.
Please use the exact 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': 'MIS', 'num_nodes': 25, 'num_edges': 48, 'edges': [{'u': 25, 'v': 4}, {'u': 25, 'v': 7}, {'u': 25, 'v': 10}, {'u': 4, 'v': 7}, {'u': 4, 'v': 10}, {'u': 24, 'v': 8}, {'u': 24, 'v': 12}, {'u': 24, 'v': 23}, {'u': 11, 'v': 10}, {'u': 11, 'v': 22}, {'u': 12, 'v': 10}, {'u': 16, 'v': 9}, {'u': 16, 'v': 10}, {'u': 16, 'v': 17}, {'u': 16, 'v': 19}, {'u': 17, 'v': 10}, {'u': 17, 'v': 13}, {'u': 17, 'v': 19}, {'u': 2, 'v': 10}, {'u': 2, 'v': 15}, {'u': 2, 'v': 21}, {'u': 2, 'v': 23}, {'u': 5, 'v': 6}, {'u': 5, 'v': 10}, {'u': 5, 'v': 21}, {'u': 6, 'v': 10}, {'u': 6, 'v': 14}, {'u': 7, 'v': 10}, {'u': 8, 'v': 10}, {'u': 8, 'v': 23}, {'u': 21, 'v': 10}, {'u': 21, 'v': 15}, {'u': 21, 'v': 23}, {'u': 14, 'v': 10}, {'u': 14, 'v': 20}, {'u': 22, 'v': 10}, {'u': 22, 'v': 18}, {'u': 18, 'v': 10}, {'u': 18, 'v': 13}, {'u': 19, 'v': 3}, {'u': 19, 'v': 10}, {'u': 20, 'v': 10}, {'u': 10, 'v': 3}, {'u': 10, 'v': 9}, {'u': 10, 'v': 13}, {'u': 10, 'v': 15}, {'u': 10, 'v': 23}, {'u': 3, 'v': 1}], 'source_file': 'wa2010.mtx', 'density': 0.16, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0047.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0047.png', 'edge_connectivity': 1}","[1, 4, 6, 8, 9, 11, 12, 13, 15, 19, 20]",11.0,"{'num_nodes': 25, 'num_edges': 48, 'edges': [{'u': 25, 'v': 4}, {'u': 25, 'v': 7}, {'u': 25, 'v': 10}, {'u': 4, 'v': 7}, {'u': 4, 'v': 10}, {'u': 24, 'v': 8}, {'u': 24, 'v': 12}, {'u': 24, 'v': 23}, {'u': 11, 'v': 10}, {'u': 11, 'v': 22}, {'u': 12, 'v': 10}, {'u': 16, 'v': 9}, {'u': 16, 'v': 10}, {'u': 16, 'v': 17}, {'u': 16, 'v': 19}, {'u': 17, 'v': 10}, {'u': 17, 'v': 13}, {'u': 17, 'v': 19}, {'u': 2, 'v': 10}, {'u': 2, 'v': 15}, {'u': 2, 'v': 21}, {'u': 2, 'v': 23}, {'u': 5, 'v': 6}, {'u': 5, 'v': 10}, {'u': 5, 'v': 21}, {'u': 6, 'v': 10}, {'u': 6, 'v': 14}, {'u': 7, 'v': 10}, {'u': 8, 'v': 10}, {'u': 8, 'v': 23}, {'u': 21, 'v': 10}, {'u': 21, 'v': 15}, {'u': 21, 'v': 23}, {'u': 14, 'v': 10}, {'u': 14, 'v': 20}, {'u': 22, 'v': 10}, {'u': 22, 'v': 18}, {'u': 18, 'v': 10}, {'u': 18, 'v': 13}, {'u': 19, 'v': 3}, {'u': 19, 'v': 10}, {'u': 20, 'v': 10}, {'u': 10, 'v': 3}, {'u': 10, 'v': 9}, {'u': 10, 'v': 13}, {'u': 10, 'v': 15}, {'u': 10, 'v': 23}, {'u': 3, 'v': 1}]}","[1, 4, 6, 8, 9, 11, 12, 13, 15, 19, 20]",48,csv,1
MIS,MIS,"Recently the grounds crew was put in charge of picking trees for several new beds and the brief was to maximize diversity. In plain terms: build the largest possible list of distinct tree varieties — the plan with the higher number of unique types is better, so the tally of selected varieties decides it. The limitation is botanical: any pair of varieties that are known to cross-inhibit can’t both be included, and selections must be single, non-repeated entries from the available list. The exact options and which pairs clash follow below.
There are 21 distinct tree varieties available and 38 known cross-inhibiting pairs listed below.
Varieties C and O cannot both be selected because they cross-inhibit.
Varieties C and P cannot both be selected because they cross-inhibit.
Varieties C and Q cannot both be selected because they cross-inhibit.
Varieties C and U cannot both be selected because they cross-inhibit.
Varieties Q and A cannot both be selected because they cross-inhibit.
Varieties Q and N cannot both be selected because they cross-inhibit.
Varieties T and G cannot both be selected because they cross-inhibit.
Varieties T and N cannot both be selected because they cross-inhibit.
Varieties R and I cannot both be selected because they cross-inhibit.
Varieties R and M cannot both be selected because they cross-inhibit.
Varieties R and N cannot both be selected because they cross-inhibit.
Varieties K and B cannot both be selected because they cross-inhibit.
Varieties K and F cannot both be selected because they cross-inhibit.
Varieties K and N cannot both be selected because they cross-inhibit.
Varieties E and F cannot both be selected because they cross-inhibit.
Varieties E and M cannot both be selected because they cross-inhibit.
Varieties U and F cannot both be selected because they cross-inhibit.
Varieties U and H cannot both be selected because they cross-inhibit.
Varieties U and J cannot both be selected because they cross-inhibit.
Varieties U and N cannot both be selected because they cross-inhibit.
Varieties U and P cannot both be selected because they cross-inhibit.
Varieties M and F cannot both be selected because they cross-inhibit.
Varieties M and N cannot both be selected because they cross-inhibit.
Varieties N and A cannot both be selected because they cross-inhibit.
Varieties N and B cannot both be selected because they cross-inhibit.
Varieties N and D cannot both be selected because they cross-inhibit.
Varieties N and F cannot both be selected because they cross-inhibit.
Varieties N and G cannot both be selected because they cross-inhibit.
Varieties N and H cannot both be selected because they cross-inhibit.
Varieties N and I cannot both be selected because they cross-inhibit.
Varieties N and S cannot both be selected because they cross-inhibit.
Varieties L and O cannot both be selected because they cross-inhibit.
Varieties G and D cannot both be selected because they cross-inhibit.
Varieties H and B cannot both be selected because they cross-inhibit.
Varieties A and S cannot both be selected because they cross-inhibit.
Varieties B and F cannot both be selected because they cross-inhibit.
Varieties O and P cannot both be selected because they cross-inhibit.
Varieties J and F cannot both be selected because they cross-inhibit.
From the 21 options and given the 38 conflicts above, the grounds crew will pick single, non-repeated varieties that avoid these forbidden pairs to maximize diversity.
Oh, and when you're ready to send the picks back, please follow this simple JSON layout so it's easy to read and check:
{
""solution"": [""variety_id"", ""variety_id"", ...]
}
This just means ""solution"" is a list of the tree-variety identifiers you've chosen (one identifier per chosen variety). The placeholder variety_id stands for whatever labels the instance uses for each variety — it's just showing the shape we expect, not the real answer.
The JSON above is only a sketch of the expected shape, not your final selection. Make sure to use the exact identifiers from the instance input — no renaming, 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': 'MIS', 'num_nodes': 21, 'num_edges': 38, 'edges': [{'u': 3, 'v': 15}, {'u': 3, 'v': 16}, {'u': 3, 'v': 17}, {'u': 3, 'v': 21}, {'u': 17, 'v': 1}, {'u': 17, 'v': 14}, {'u': 20, 'v': 7}, {'u': 20, 'v': 14}, {'u': 18, 'v': 9}, {'u': 18, 'v': 13}, {'u': 18, 'v': 14}, {'u': 11, 'v': 2}, {'u': 11, 'v': 6}, {'u': 11, 'v': 14}, {'u': 5, 'v': 6}, {'u': 5, 'v': 13}, {'u': 21, 'v': 6}, {'u': 21, 'v': 8}, {'u': 21, 'v': 10}, {'u': 21, 'v': 14}, {'u': 21, 'v': 16}, {'u': 13, 'v': 6}, {'u': 13, 'v': 14}, {'u': 14, 'v': 1}, {'u': 14, 'v': 2}, {'u': 14, 'v': 4}, {'u': 14, 'v': 6}, {'u': 14, 'v': 7}, {'u': 14, 'v': 8}, {'u': 14, 'v': 9}, {'u': 14, 'v': 19}, {'u': 12, 'v': 15}, {'u': 7, 'v': 4}, {'u': 8, 'v': 2}, {'u': 1, 'v': 19}, {'u': 2, 'v': 6}, {'u': 15, 'v': 16}, {'u': 10, 'v': 6}], 'source_file': 'wv2010.mtx', 'density': 0.18095238095238095, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0048.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0048.png', 'edge_connectivity': 1}","[4, 5, 8, 9, 10, 11, 12, 16, 17, 19, 20]",11.0,"{'num_nodes': 21, 'num_edges': 38, 'edges': [{'u': 'C', 'v': 'O'}, {'u': 'C', 'v': 'P'}, {'u': 'C', 'v': 'Q'}, {'u': 'C', 'v': 'U'}, {'u': 'Q', 'v': 'A'}, {'u': 'Q', 'v': 'N'}, {'u': 'T', 'v': 'G'}, {'u': 'T', 'v': 'N'}, {'u': 'R', 'v': 'I'}, {'u': 'R', 'v': 'M'}, {'u': 'R', 'v': 'N'}, {'u': 'K', 'v': 'B'}, {'u': 'K', 'v': 'F'}, {'u': 'K', 'v': 'N'}, {'u': 'E', 'v': 'F'}, {'u': 'E', 'v': 'M'}, {'u': 'U', 'v': 'F'}, {'u': 'U', 'v': 'H'}, {'u': 'U', 'v': 'J'}, {'u': 'U', 'v': 'N'}, {'u': 'U', 'v': 'P'}, {'u': 'M', 'v': 'F'}, {'u': 'M', 'v': 'N'}, {'u': 'N', 'v': 'A'}, {'u': 'N', 'v': 'B'}, {'u': 'N', 'v': 'D'}, {'u': 'N', 'v': 'F'}, {'u': 'N', 'v': 'G'}, {'u': 'N', 'v': 'H'}, {'u': 'N', 'v': 'I'}, {'u': 'N', 'v': 'S'}, {'u': 'L', 'v': 'O'}, {'u': 'G', 'v': 'D'}, {'u': 'H', 'v': 'B'}, {'u': 'A', 'v': 'S'}, {'u': 'B', 'v': 'F'}, {'u': 'O', 'v': 'P'}, {'u': 'J', 'v': 'F'}]}","['D', 'E', 'H', 'I', 'J', 'K', 'L', 'P', 'Q', 'S', 'T']",49,nl,names
MIS,MIS,"Someone in the neighborhood is arranging mantelpieces and wants to show off the most decorations they can without putting any two that interfere side by side. The job is to pick which decorations to display so the mantel ends up with the highest possible number of items, while ensuring no known-wobbly or interfering pair is included at the same time. Every item is considered individually — no duplicates, no half-placements — and the way to tell which setup wins is by counting the number of decorations that remain after removing any arrangements that include a bad pair. The list of actual ornaments and the problem pairs follows below.
# total_ornaments=19
# conflicting_pairs_count=40
ornament_one,ornament_two
12,1
12,2
12,6
12,14
12,15
12,17
6,0
6,2
6,17
6,18
13,8
13,16
13,17
13,18
3,5
3,7
3,8
3,11
3,14
17,14
2,0
2,4
18,9
18,16
7,1
7,10
7,15
8,9
8,11
8,14
8,16
4,0
4,15
16,9
9,11
10,1
10,15
5,11
14,1
15,1
Oh, and when you send back your selection, please use this simple JSON shape — it's just the form I expect:
{
""solution"": [""decoration_id"", ""decoration_id"", ...]
}
Think of ""solution"" as the list of decoration IDs you want to display on the mantel. Keep it light and exact: each entry should be the exact ID from the problem input (don't rename them or invent new labels). The JSON above is just a sketch of the shape I need, not the actual answer.
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': 'MIS', 'num_nodes': 19, 'num_edges': 40, 'edges': [{'u': 13, 'v': 2}, {'u': 13, 'v': 3}, {'u': 13, 'v': 7}, {'u': 13, 'v': 15}, {'u': 13, 'v': 16}, {'u': 13, 'v': 18}, {'u': 7, 'v': 1}, {'u': 7, 'v': 3}, {'u': 7, 'v': 18}, {'u': 7, 'v': 19}, {'u': 14, 'v': 9}, {'u': 14, 'v': 17}, {'u': 14, 'v': 18}, {'u': 14, 'v': 19}, {'u': 4, 'v': 6}, {'u': 4, 'v': 8}, {'u': 4, 'v': 9}, {'u': 4, 'v': 12}, {'u': 4, 'v': 15}, {'u': 18, 'v': 15}, {'u': 3, 'v': 1}, {'u': 3, 'v': 5}, {'u': 19, 'v': 10}, {'u': 19, 'v': 17}, {'u': 8, 'v': 2}, {'u': 8, 'v': 11}, {'u': 8, 'v': 16}, {'u': 9, 'v': 10}, {'u': 9, 'v': 12}, {'u': 9, 'v': 15}, {'u': 9, 'v': 17}, {'u': 5, 'v': 1}, {'u': 5, 'v': 16}, {'u': 17, 'v': 10}, {'u': 10, 'v': 12}, {'u': 11, 'v': 2}, {'u': 11, 'v': 16}, {'u': 6, 'v': 12}, {'u': 15, 'v': 2}, {'u': 16, 'v': 2}], 'source_file': 'wv2010.mtx', 'density': 0.23391812865497075, 'viz_instance': 'generated_data/MIS/viz/MIS_L/instance_0049.png', 'viz_solution': 'generated_data/MIS/viz/MIS_L/solution_0049.png', 'edge_connectivity': 2}","[5, 6, 7, 10, 11, 14, 15]",7.0,"{'num_nodes': 19, 'num_edges': 40, 'edges': [{'u': 12, 'v': 1}, {'u': 12, 'v': 2}, {'u': 12, 'v': 6}, {'u': 12, 'v': 14}, {'u': 12, 'v': 15}, {'u': 12, 'v': 17}, {'u': 6, 'v': 0}, {'u': 6, 'v': 2}, {'u': 6, 'v': 17}, {'u': 6, 'v': 18}, {'u': 13, 'v': 8}, {'u': 13, 'v': 16}, {'u': 13, 'v': 17}, {'u': 13, 'v': 18}, {'u': 3, 'v': 5}, {'u': 3, 'v': 7}, {'u': 3, 'v': 8}, {'u': 3, 'v': 11}, {'u': 3, 'v': 14}, {'u': 17, 'v': 14}, {'u': 2, 'v': 0}, {'u': 2, 'v': 4}, {'u': 18, 'v': 9}, {'u': 18, 'v': 16}, {'u': 7, 'v': 1}, {'u': 7, 'v': 10}, {'u': 7, 'v': 15}, {'u': 8, 'v': 9}, {'u': 8, 'v': 11}, {'u': 8, 'v': 14}, {'u': 8, 'v': 16}, {'u': 4, 'v': 0}, {'u': 4, 'v': 15}, {'u': 16, 'v': 9}, {'u': 9, 'v': 11}, {'u': 10, 'v': 1}, {'u': 10, 'v': 15}, {'u': 5, 'v': 11}, {'u': 14, 'v': 1}, {'u': 15, 'v': 1}]}","[4, 5, 6, 9, 10, 13, 14]",50,csv,0
|