File size: 266,479 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 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770 4771 4772 4773 4774 4775 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805 4806 4807 4808 4809 4810 4811 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 4962 4963 4964 4965 4966 4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 4989 4990 4991 4992 4993 4994 4995 4996 4997 4998 4999 5000 5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 | task_name,problem_type,instruction,instance,solution,obj,instance_variant,solution_variant,context_index,input_format,input_index_base
MAXCUT,MAXCUT,"Someone is organizing a reunion and wants to seat people left versus right so that friends are separated across the table as much as possible — the stronger the plan, the more friendship pairs will be across the left-right split. Every attendee must be assigned to one side only, with no repeats or omissions. The success of a seating is simply the count of friend-pairs that sit on opposite sides; more counted pairs means a better seating. The detailed guest list and their friendships follow below.
There are 22 guests in total and 43 friendships.
| guest_a | guest_b |
|---|---|
| 11 | 6 |
| 11 | 18 |
| 11 | 19 |
| 12 | 1 |
| 12 | 10 |
| 12 | 14 |
| 13 | 2 |
| 13 | 9 |
| 13 | 16 |
| 6 | 4 |
| 6 | 7 |
| 6 | 8 |
| 6 | 15 |
| 6 | 16 |
| 6 | 17 |
| 6 | 18 |
| 6 | 19 |
| 6 | 20 |
| 6 | 21 |
| 7 | 5 |
| 7 | 17 |
| 7 | 20 |
| 1 | 5 |
| 1 | 10 |
| 1 | 14 |
| 1 | 22 |
| 14 | 5 |
| 14 | 17 |
| 17 | 3 |
| 17 | 21 |
| 18 | 15 |
| 8 | 4 |
| 9 | 16 |
| 9 | 20 |
| 9 | 22 |
| 4 | 3 |
| 4 | 21 |
| 5 | 20 |
| 5 | 22 |
| 3 | 21 |
| 2 | 10 |
| 2 | 22 |
| 22 | 10 |
Also, when you send back a seating plan, please use this simple JSON shape so it's easy to read and check automatically:
{
""solution"": [
[""guest_id"", ""guest_id"", ...],
[""guest_id"", ""guest_id"", ...]
]
}
This just means ""solution"" contains two lists: the first list is everyone seated on the left side, the second list is everyone seated on the right side. Think of each ""guest_id"" as the exact label for a person from the guest list — it's just a placeholder here to show the shape. This JSON is only a sketch of the expected shape, not the actual seating.
Please make sure to use the exact identifiers from the instance input — no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as ""1"" or ""23"", single capital letters like ""A"" or ""B"", or a capital letter followed by digits like ""A1"" or ""X7"".""","{'problem_type': 'MAXCUT', 'num_nodes': 22, 'num_edges': 43, 'edges': [{'u': 11, 'v': 6}, {'u': 11, 'v': 18}, {'u': 11, 'v': 19}, {'u': 12, 'v': 1}, {'u': 12, 'v': 10}, {'u': 12, 'v': 14}, {'u': 13, 'v': 2}, {'u': 13, 'v': 9}, {'u': 13, 'v': 16}, {'u': 6, 'v': 4}, {'u': 6, 'v': 7}, {'u': 6, 'v': 8}, {'u': 6, 'v': 15}, {'u': 6, 'v': 16}, {'u': 6, 'v': 17}, {'u': 6, 'v': 18}, {'u': 6, 'v': 19}, {'u': 6, 'v': 20}, {'u': 6, 'v': 21}, {'u': 7, 'v': 5}, {'u': 7, 'v': 17}, {'u': 7, 'v': 20}, {'u': 1, 'v': 5}, {'u': 1, 'v': 10}, {'u': 1, 'v': 14}, {'u': 1, 'v': 22}, {'u': 14, 'v': 5}, {'u': 14, 'v': 17}, {'u': 17, 'v': 3}, {'u': 17, 'v': 21}, {'u': 18, 'v': 15}, {'u': 8, 'v': 4}, {'u': 9, 'v': 16}, {'u': 9, 'v': 20}, {'u': 9, 'v': 22}, {'u': 4, 'v': 3}, {'u': 4, 'v': 21}, {'u': 5, 'v': 20}, {'u': 5, 'v': 22}, {'u': 3, 'v': 21}, {'u': 2, 'v': 10}, {'u': 2, 'v': 22}, {'u': 22, 'v': 10}], 'source_file': 'wv2010.mtx', 'density': 0.18614718614718614, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0000.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0000.png', 'edge_connectivity': 2}","[[1, 2, 4, 5, 6, 9, 12, 17, 18, 19], [3, 7, 8, 10, 11, 13, 14, 15, 16, 20, 21, 22]]",33.0,"{'num_nodes': 22, 'num_edges': 43, 'edges': [{'u': 11, 'v': 6}, {'u': 11, 'v': 18}, {'u': 11, 'v': 19}, {'u': 12, 'v': 1}, {'u': 12, 'v': 10}, {'u': 12, 'v': 14}, {'u': 13, 'v': 2}, {'u': 13, 'v': 9}, {'u': 13, 'v': 16}, {'u': 6, 'v': 4}, {'u': 6, 'v': 7}, {'u': 6, 'v': 8}, {'u': 6, 'v': 15}, {'u': 6, 'v': 16}, {'u': 6, 'v': 17}, {'u': 6, 'v': 18}, {'u': 6, 'v': 19}, {'u': 6, 'v': 20}, {'u': 6, 'v': 21}, {'u': 7, 'v': 5}, {'u': 7, 'v': 17}, {'u': 7, 'v': 20}, {'u': 1, 'v': 5}, {'u': 1, 'v': 10}, {'u': 1, 'v': 14}, {'u': 1, 'v': 22}, {'u': 14, 'v': 5}, {'u': 14, 'v': 17}, {'u': 17, 'v': 3}, {'u': 17, 'v': 21}, {'u': 18, 'v': 15}, {'u': 8, 'v': 4}, {'u': 9, 'v': 16}, {'u': 9, 'v': 20}, {'u': 9, 'v': 22}, {'u': 4, 'v': 3}, {'u': 4, 'v': 21}, {'u': 5, 'v': 20}, {'u': 5, 'v': 22}, {'u': 3, 'v': 21}, {'u': 2, 'v': 10}, {'u': 2, 'v': 22}, {'u': 22, 'v': 10}]}","[[1, 2, 4, 5, 6, 9, 12, 17, 18, 19], [3, 7, 8, 10, 11, 13, 14, 15, 16, 20, 21, 22]]",1,markdown_table,1
MAXCUT,MAXCUT,"I have a stack of books that need to go on either the left shelf or the right shelf, and the trick is to place every single title on exactly one shelf so nothing is left out or duplicated. The goal is to arrange them so as many citation links as possible run from a book on one shelf to a book on the other shelf — count those cross-shelf links and try to make that count as big as possible. The exact list of books and which ones cite which will be shown below.
# total_books=20
# total_citation_links=32
book_a_id,book_b_id
3,8
3,12
3,13
3,17
8,11
8,16
8,18
9,5
9,19
10,2
10,6
10,14
11,17
11,18
12,7
12,15
12,16
13,0
13,4
13,7
4,17
18,1
19,7
19,15
5,0
5,7
6,15
14,1
14,2
15,2
16,1
16,2
Also, when you send back your placement, it'd be great if you follow a tiny JSON layout so it's easy to check. Something simple like this will do:
{
""solution"": [
[""book_id"", ""book_id"", ...],
[""book_id"", ""book_id"", ...]
]
}
Think of the first inner list as the left shelf and the second inner list as the right shelf, and each ""book_id"" is just a placeholder where you'll put the actual book identifier from the instance. This is just the shape I expect — not the actual answer.
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”.
Make sure every book appears exactly once, in one of the two lists.","{'problem_type': 'MAXCUT', 'num_nodes': 20, 'num_edges': 32, 'edges': [{'u': 4, 'v': 9}, {'u': 4, 'v': 13}, {'u': 4, 'v': 14}, {'u': 4, 'v': 18}, {'u': 9, 'v': 12}, {'u': 9, 'v': 17}, {'u': 9, 'v': 19}, {'u': 10, 'v': 6}, {'u': 10, 'v': 20}, {'u': 11, 'v': 3}, {'u': 11, 'v': 7}, {'u': 11, 'v': 15}, {'u': 12, 'v': 18}, {'u': 12, 'v': 19}, {'u': 13, 'v': 8}, {'u': 13, 'v': 16}, {'u': 13, 'v': 17}, {'u': 14, 'v': 1}, {'u': 14, 'v': 5}, {'u': 14, 'v': 8}, {'u': 5, 'v': 18}, {'u': 19, 'v': 2}, {'u': 20, 'v': 8}, {'u': 20, 'v': 16}, {'u': 6, 'v': 1}, {'u': 6, 'v': 8}, {'u': 7, 'v': 16}, {'u': 15, 'v': 2}, {'u': 15, 'v': 3}, {'u': 16, 'v': 3}, {'u': 17, 'v': 2}, {'u': 17, 'v': 3}], 'source_file': 'wi2010.mtx', 'density': 0.16842105263157894, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0001.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0001.png', 'edge_connectivity': 2}","[[1, 4, 5, 8, 10, 11, 12, 15, 16, 17, 19], [2, 3, 6, 7, 9, 13, 14, 18, 20]]",30.0,"{'num_nodes': 20, 'num_edges': 32, 'edges': [{'u': 3, 'v': 8}, {'u': 3, 'v': 12}, {'u': 3, 'v': 13}, {'u': 3, 'v': 17}, {'u': 8, 'v': 11}, {'u': 8, 'v': 16}, {'u': 8, 'v': 18}, {'u': 9, 'v': 5}, {'u': 9, 'v': 19}, {'u': 10, 'v': 2}, {'u': 10, 'v': 6}, {'u': 10, 'v': 14}, {'u': 11, 'v': 17}, {'u': 11, 'v': 18}, {'u': 12, 'v': 7}, {'u': 12, 'v': 15}, {'u': 12, 'v': 16}, {'u': 13, 'v': 0}, {'u': 13, 'v': 4}, {'u': 13, 'v': 7}, {'u': 4, 'v': 17}, {'u': 18, 'v': 1}, {'u': 19, 'v': 7}, {'u': 19, 'v': 15}, {'u': 5, 'v': 0}, {'u': 5, 'v': 7}, {'u': 6, 'v': 15}, {'u': 14, 'v': 1}, {'u': 14, 'v': 2}, {'u': 15, 'v': 2}, {'u': 16, 'v': 1}, {'u': 16, 'v': 2}]}","[[0, 3, 4, 7, 9, 10, 11, 14, 15, 16, 18], [1, 2, 5, 6, 8, 12, 13, 17, 19]]",2,csv,0
MAXCUT,MAXCUT,"Someone in the club suggested dividing members into a pro-debate group and a con-debate group, and they wanted the split to separate as many acquainted pairs as possible. For every pair of people who know each other, it counts as a “crossed” pair if they end up on different sides; the aim is to get as many of those crossed pairs as possible. Each person must go to either the pro side or the con side and can’t be in both or left out. The full details of the class and the relationships are shown below.
{
""total_students"": 22,
""acquainted_pairs_count"": 38,
""edges"": [
{
""student_a"": 16,
""student_b"": 5
},
{
""student_a"": 16,
""student_b"": 10
},
{
""student_a"": 16,
""student_b"": 17
},
{
""student_a"": 4,
""student_b"": 1
},
{
""student_a"": 4,
""student_b"": 10
},
{
""student_a"": 2,
""student_b"": 0
},
{
""student_a"": 2,
""student_b"": 8
},
{
""student_a"": 2,
""student_b"": 21
},
{
""student_a"": 3,
""student_b"": 9
},
{
""student_a"": 3,
""student_b"": 10
},
{
""student_a"": 8,
""student_b"": 7
},
{
""student_a"": 8,
""student_b"": 21
},
{
""student_a"": 5,
""student_b"": 10
},
{
""student_a"": 11,
""student_b"": 7
},
{
""student_a"": 11,
""student_b"": 21
},
{
""student_a"": 21,
""student_b"": 1
},
{
""student_a"": 21,
""student_b"": 7
},
{
""student_a"": 21,
""student_b"": 10
},
{
""student_a"": 21,
""student_b"": 15
},
{
""student_a"": 21,
""student_b"": 19
},
{
""student_a"": 17,
""student_b"": 6
},
{
""student_a"": 17,
""student_b"": 10
},
{
""student_a"": 0,
""student_b"": 10
},
{
""student_a"": 19,
""student_b"": 10
},
{
""student_a"": 20,
""student_b"": 10
},
{
""student_a"": 20,
""student_b"": 13
},
{
""student_a"": 10,
""student_b"": 1
},
{
""student_a"": 10,
""student_b"": 6
},
{
""student_a"": 10,
""student_b"": 9
},
{
""student_a"": 10,
""student_b"": 12
},
{
""student_a"": 10,
""student_b"": 13
},
{
""student_a"": 10,
""student_b"": 14
},
{
""student_a"": 10,
""student_b"": 15
},
{
""student_a"": 10,
""student_b"": 18
},
{
""student_a"": 9,
""student_b"": 15
},
{
""student_a"": 18,
""student_b"": 6
},
{
""student_a"": 14,
""student_b"": 12
},
{
""student_a"": 15,
""student_b"": 13
}
]
}
Oh, and when you send back the split, please stick to this little JSON layout so it's easy to check:
{
""solution"": [
[""member_id"", ""member_id"", ...],
[""member_id"", ""member_id"", ...]
]
}
Think of it like a simple form: ""solution"" holds two lists — the first list is everyone on the pro-debate side, the second list is everyone on the con-debate side. Each item should be the exact person identifier from the instance. This JSON is just a sketch of the shape I want, not the actual answer.
Please make sure to use the identifiers exactly as they appear in the problem 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': 'MAXCUT', 'num_nodes': 22, 'num_edges': 38, 'edges': [{'u': 17, 'v': 6}, {'u': 17, 'v': 11}, {'u': 17, 'v': 18}, {'u': 5, 'v': 2}, {'u': 5, 'v': 11}, {'u': 3, 'v': 1}, {'u': 3, 'v': 9}, {'u': 3, 'v': 22}, {'u': 4, 'v': 10}, {'u': 4, 'v': 11}, {'u': 9, 'v': 8}, {'u': 9, 'v': 22}, {'u': 6, 'v': 11}, {'u': 12, 'v': 8}, {'u': 12, 'v': 22}, {'u': 22, 'v': 2}, {'u': 22, 'v': 8}, {'u': 22, 'v': 11}, {'u': 22, 'v': 16}, {'u': 22, 'v': 20}, {'u': 18, 'v': 7}, {'u': 18, 'v': 11}, {'u': 1, 'v': 11}, {'u': 20, 'v': 11}, {'u': 21, 'v': 11}, {'u': 21, 'v': 14}, {'u': 11, 'v': 2}, {'u': 11, 'v': 7}, {'u': 11, 'v': 10}, {'u': 11, 'v': 13}, {'u': 11, 'v': 14}, {'u': 11, 'v': 15}, {'u': 11, 'v': 16}, {'u': 11, 'v': 19}, {'u': 10, 'v': 16}, {'u': 19, 'v': 7}, {'u': 15, 'v': 13}, {'u': 16, 'v': 14}], 'source_file': 'wv2010.mtx', 'density': 0.1645021645021645, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0002.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0002.png', 'edge_connectivity': 2}","[[1, 2, 4, 6, 9, 12, 15, 16, 18, 19, 20, 21], [3, 5, 7, 8, 10, 11, 13, 14, 17, 22]]",29.0,"{'num_nodes': 22, 'num_edges': 38, 'edges': [{'u': 16, 'v': 5}, {'u': 16, 'v': 10}, {'u': 16, 'v': 17}, {'u': 4, 'v': 1}, {'u': 4, 'v': 10}, {'u': 2, 'v': 0}, {'u': 2, 'v': 8}, {'u': 2, 'v': 21}, {'u': 3, 'v': 9}, {'u': 3, 'v': 10}, {'u': 8, 'v': 7}, {'u': 8, 'v': 21}, {'u': 5, 'v': 10}, {'u': 11, 'v': 7}, {'u': 11, 'v': 21}, {'u': 21, 'v': 1}, {'u': 21, 'v': 7}, {'u': 21, 'v': 10}, {'u': 21, 'v': 15}, {'u': 21, 'v': 19}, {'u': 17, 'v': 6}, {'u': 17, 'v': 10}, {'u': 0, 'v': 10}, {'u': 19, 'v': 10}, {'u': 20, 'v': 10}, {'u': 20, 'v': 13}, {'u': 10, 'v': 1}, {'u': 10, 'v': 6}, {'u': 10, 'v': 9}, {'u': 10, 'v': 12}, {'u': 10, 'v': 13}, {'u': 10, 'v': 14}, {'u': 10, 'v': 15}, {'u': 10, 'v': 18}, {'u': 9, 'v': 15}, {'u': 18, 'v': 6}, {'u': 14, 'v': 12}, {'u': 15, 'v': 13}]}","[[0, 1, 3, 5, 8, 11, 14, 15, 17, 18, 19, 20], [2, 4, 6, 7, 9, 10, 12, 13, 16, 21]]",3,json,0
MAXCUT,MAXCUT,"Someone needed to rearrange equipment so that half the gear went into the left rack and the rest into the right rack, with the rule that every server must be placed in one of the two racks and none duplicated. The simple takeaway was to try to make as many cables as possible span the gap between racks — each time a cable connects a server in the left to a server in the right, it gets counted toward how good the arrangement is. The specific details of the case are shown below.
There were 24 servers to split between the two racks and 47 cables connecting them.
A cable connected server 19 to server 3.
A cable connected server 19 to server 6.
A cable connected server 19 to server 8.
A cable connected server 19 to server 9.
A cable connected server 19 to server 10.
A cable connected server 19 to server 11.
A cable connected server 19 to server 12.
A cable connected server 19 to server 13.
A cable connected server 12 to server 22.
A cable connected server 13 to server 14.
A cable connected server 13 to server 16.
A cable connected server 13 to server 21.
A cable connected server 20 to server 4.
A cable connected server 20 to server 5.
A cable connected server 20 to server 7.
A cable connected server 20 to server 15.
A cable connected server 20 to server 16.
A cable connected server 20 to server 21.
A cable connected server 21 to server 11.
A cable connected server 21 to server 16.
A cable connected server 6 to server 2.
A cable connected server 6 to server 4.
A cable connected server 6 to server 22.
A cable connected server 7 to server 11.
A cable connected server 4 to server 5.
A cable connected server 4 to server 10.
A cable connected server 4 to server 11.
A cable connected server 5 to server 2.
A cable connected server 5 to server 22.
A cable connected server 5 to server 24.
A cable connected server 23 to server 1.
A cable connected server 23 to server 15.
A cable connected server 23 to server 17.
A cable connected server 23 to server 22.
A cable connected server 23 to server 24.
A cable connected server 22 to server 1.
A cable connected server 22 to server 2.
A cable connected server 22 to server 3.
A cable connected server 22 to server 18.
A cable connected server 22 to server 24.
A cable connected server 24 to server 15.
A cable connected server 1 to server 18.
A cable connected server 14 to server 16.
A cable connected server 16 to server 15.
A cable connected server 16 to server 17.
A cable connected server 3 to server 18.
A cable connected server 18 to server 9.
The aim was to maximize how many of the 47 cables ran between the left and right racks.
I’ll just say up front how I’d like the answer packaged — a tiny JSON object with two lists: the servers that go in the left rack and the ones that go in the right rack. Something that looks like this:
{
""solution"": [
[""server_id"", ""server_id"", ...],
[""server_id"", ""server_id"", ...]
]
}
The first inner list is the set of server IDs you’d put in the left rack, and the second list is the servers for the right rack. It’s just a sketch of the shape I expect, not the actual placement — the real reply should fill those lists with the exact server identifiers from the instance.
Please be sure to 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': 'MAXCUT', 'num_nodes': 24, 'num_edges': 47, 'edges': [{'u': 19, 'v': 3}, {'u': 19, 'v': 6}, {'u': 19, 'v': 8}, {'u': 19, 'v': 9}, {'u': 19, 'v': 10}, {'u': 19, 'v': 11}, {'u': 19, 'v': 12}, {'u': 19, 'v': 13}, {'u': 12, 'v': 22}, {'u': 13, 'v': 14}, {'u': 13, 'v': 16}, {'u': 13, 'v': 21}, {'u': 20, 'v': 4}, {'u': 20, 'v': 5}, {'u': 20, 'v': 7}, {'u': 20, 'v': 15}, {'u': 20, 'v': 16}, {'u': 20, 'v': 21}, {'u': 21, 'v': 11}, {'u': 21, 'v': 16}, {'u': 6, 'v': 2}, {'u': 6, 'v': 4}, {'u': 6, 'v': 22}, {'u': 7, 'v': 11}, {'u': 4, 'v': 5}, {'u': 4, 'v': 10}, {'u': 4, 'v': 11}, {'u': 5, 'v': 2}, {'u': 5, 'v': 22}, {'u': 5, 'v': 24}, {'u': 23, 'v': 1}, {'u': 23, 'v': 15}, {'u': 23, 'v': 17}, {'u': 23, 'v': 22}, {'u': 23, 'v': 24}, {'u': 22, 'v': 1}, {'u': 22, 'v': 2}, {'u': 22, 'v': 3}, {'u': 22, 'v': 18}, {'u': 22, 'v': 24}, {'u': 24, 'v': 15}, {'u': 1, 'v': 18}, {'u': 14, 'v': 16}, {'u': 16, 'v': 15}, {'u': 16, 'v': 17}, {'u': 3, 'v': 18}, {'u': 18, 'v': 9}], 'source_file': 'wy2010.mtx', 'density': 0.17028985507246377, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0003.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0003.png', 'edge_connectivity': 1}","[[1, 3, 5, 6, 8, 9, 10, 11, 12, 13, 16, 20, 23], [2, 4, 7, 14, 15, 17, 18, 19, 21, 22, 24]]",39.0,"{'num_nodes': 24, 'num_edges': 47, 'edges': [{'u': 19, 'v': 3}, {'u': 19, 'v': 6}, {'u': 19, 'v': 8}, {'u': 19, 'v': 9}, {'u': 19, 'v': 10}, {'u': 19, 'v': 11}, {'u': 19, 'v': 12}, {'u': 19, 'v': 13}, {'u': 12, 'v': 22}, {'u': 13, 'v': 14}, {'u': 13, 'v': 16}, {'u': 13, 'v': 21}, {'u': 20, 'v': 4}, {'u': 20, 'v': 5}, {'u': 20, 'v': 7}, {'u': 20, 'v': 15}, {'u': 20, 'v': 16}, {'u': 20, 'v': 21}, {'u': 21, 'v': 11}, {'u': 21, 'v': 16}, {'u': 6, 'v': 2}, {'u': 6, 'v': 4}, {'u': 6, 'v': 22}, {'u': 7, 'v': 11}, {'u': 4, 'v': 5}, {'u': 4, 'v': 10}, {'u': 4, 'v': 11}, {'u': 5, 'v': 2}, {'u': 5, 'v': 22}, {'u': 5, 'v': 24}, {'u': 23, 'v': 1}, {'u': 23, 'v': 15}, {'u': 23, 'v': 17}, {'u': 23, 'v': 22}, {'u': 23, 'v': 24}, {'u': 22, 'v': 1}, {'u': 22, 'v': 2}, {'u': 22, 'v': 3}, {'u': 22, 'v': 18}, {'u': 22, 'v': 24}, {'u': 24, 'v': 15}, {'u': 1, 'v': 18}, {'u': 14, 'v': 16}, {'u': 16, 'v': 15}, {'u': 16, 'v': 17}, {'u': 3, 'v': 18}, {'u': 18, 'v': 9}]}","[[1, 3, 5, 6, 8, 9, 10, 11, 12, 13, 16, 20, 23], [2, 4, 7, 14, 15, 17, 18, 19, 21, 22, 24]]",4,nl,1
MAXCUT,MAXCUT,"At the garden club meeting someone sketched a plan: take every plant and put it in either the front bed or the back bed, making sure each plant is assigned once and only once, and try to arrange them so the most pollination pairs have their members on different beds. To judge any layout, go down the pairing list and count how many pairs are split between front and back; a higher count means a better split. The concrete list of plants and the pollination pairs follows below.
# total_plants=21
# total_pollination_pairs=36
plant_a,plant_b
2,16
2,18
3,11
3,18
4,1
4,17
4,21
6,5
6,17
7,11
7,13
7,17
14,16
14,18
15,18
16,10
16,18
13,5
13,17
20,17
17,1
17,5
17,8
17,9
17,12
17,18
17,21
21,1
21,18
18,1
18,8
18,19
8,12
12,19
19,11
9,1
If you want to hand me a layout, just follow this little JSON sketch so I can read it easily—two lists, one for each bed.
{
""solution"": [
[""plant_id"", ""plant_id"", ...],
[""plant_id"", ""plant_id"", ...]
]
}
The first inner list is the plants you put in the front bed, the second inner list is the plants you put in the back bed. Each ""plant_id"" is a placeholder for a plant identifier from the instance (so put the actual IDs there, separated by commas). This is just the expected shape of the answer—not your final filled-in layout.
Please use the exact identifiers 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': 'MAXCUT', 'num_nodes': 21, 'num_edges': 36, 'edges': [{'u': 2, 'v': 16}, {'u': 2, 'v': 18}, {'u': 3, 'v': 11}, {'u': 3, 'v': 18}, {'u': 4, 'v': 1}, {'u': 4, 'v': 17}, {'u': 4, 'v': 21}, {'u': 6, 'v': 5}, {'u': 6, 'v': 17}, {'u': 7, 'v': 11}, {'u': 7, 'v': 13}, {'u': 7, 'v': 17}, {'u': 14, 'v': 16}, {'u': 14, 'v': 18}, {'u': 15, 'v': 18}, {'u': 16, 'v': 10}, {'u': 16, 'v': 18}, {'u': 13, 'v': 5}, {'u': 13, 'v': 17}, {'u': 20, 'v': 17}, {'u': 17, 'v': 1}, {'u': 17, 'v': 5}, {'u': 17, 'v': 8}, {'u': 17, 'v': 9}, {'u': 17, 'v': 12}, {'u': 17, 'v': 18}, {'u': 17, 'v': 21}, {'u': 21, 'v': 1}, {'u': 21, 'v': 18}, {'u': 18, 'v': 1}, {'u': 18, 'v': 8}, {'u': 18, 'v': 19}, {'u': 8, 'v': 12}, {'u': 12, 'v': 19}, {'u': 19, 'v': 11}, {'u': 9, 'v': 1}], 'source_file': 'wa2010.mtx', 'density': 0.17142857142857143, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0004.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0004.png', 'edge_connectivity': 1}","[[1, 2, 3, 5, 7, 8, 10, 14, 15, 17, 19, 21], [4, 6, 9, 11, 12, 13, 16, 18, 20]]",29.0,"{'num_nodes': 21, 'num_edges': 36, 'edges': [{'u': 2, 'v': 16}, {'u': 2, 'v': 18}, {'u': 3, 'v': 11}, {'u': 3, 'v': 18}, {'u': 4, 'v': 1}, {'u': 4, 'v': 17}, {'u': 4, 'v': 21}, {'u': 6, 'v': 5}, {'u': 6, 'v': 17}, {'u': 7, 'v': 11}, {'u': 7, 'v': 13}, {'u': 7, 'v': 17}, {'u': 14, 'v': 16}, {'u': 14, 'v': 18}, {'u': 15, 'v': 18}, {'u': 16, 'v': 10}, {'u': 16, 'v': 18}, {'u': 13, 'v': 5}, {'u': 13, 'v': 17}, {'u': 20, 'v': 17}, {'u': 17, 'v': 1}, {'u': 17, 'v': 5}, {'u': 17, 'v': 8}, {'u': 17, 'v': 9}, {'u': 17, 'v': 12}, {'u': 17, 'v': 18}, {'u': 17, 'v': 21}, {'u': 21, 'v': 1}, {'u': 21, 'v': 18}, {'u': 18, 'v': 1}, {'u': 18, 'v': 8}, {'u': 18, 'v': 19}, {'u': 8, 'v': 12}, {'u': 12, 'v': 19}, {'u': 19, 'v': 11}, {'u': 9, 'v': 1}]}","[[1, 2, 3, 5, 7, 8, 10, 14, 15, 17, 19, 21], [4, 6, 9, 11, 12, 13, 16, 18, 20]]",5,csv,1
MAXCUT,MAXCUT,"We’ve got a two-sided display to set up: every photograph gets mounted either on the inner ring or the outer ring, exactly once. Some photos belong together in pairs, and the goal is to get as many of those pairs separated between the inner and outer walls as possible. A layout’s quality is simply the number of related pairs that end up on opposite walls — tally those split pairs to compare layouts. The exact list of photos and their pairings appears below.
We have 24 photos and 52 related pairs:
Photo D is paired with photo A.
Photo D is paired with photo B.
Photo D is paired with photo H.
Photo C is paired with photo A.
Photo C is paired with photo F.
Photo C is paired with photo N.
Photo C is paired with photo Q.
Photo C is paired with photo S.
Photo C is paired with photo V.
Photo C is paired with photo X.
Photo O is paired with photo I.
Photo O is paired with photo L.
Photo G is paired with photo E.
Photo G is paired with photo I.
Photo G is paired with photo K.
Photo K is paired with photo E.
Photo K is paired with photo I.
Photo K is paired with photo W.
Photo L is paired with photo I.
Photo L is paired with photo J.
Photo L is paired with photo M.
Photo L is paired with photo T.
Photo L is paired with photo U.
Photo Q is paired with photo J.
Photo Q is paired with photo U.
Photo R is paired with photo E.
Photo R is paired with photo F.
Photo R is paired with photo N.
Photo H is paired with photo A.
Photo H is paired with photo B.
Photo H is paired with photo E.
Photo H is paired with photo N.
Photo E is paired with photo B.
Photo M is paired with photo I.
Photo M is paired with photo W.
Photo T is paired with photo J.
Photo T is paired with photo U.
Photo I is paired with photo B.
Photo I is paired with photo P.
Photo I is paired with photo U.
Photo I is paired with photo W.
Photo I is paired with photo X.
Photo J is paired with photo U.
Photo N is paired with photo A.
Photo N is paired with photo F.
Photo V is paired with photo S.
Photo A is paired with photo B.
Photo A is paired with photo P.
Photo A is paired with photo X.
Photo B is paired with photo P.
Photo X is paired with photo P.
Photo X is paired with photo U.
We place each of the 24 photos on the inner or outer ring to maximize the number of split pairs.
When you send back a layout, just use a simple JSON object in that same shape so it's easy to parse. Something like this:
{
""solution"": [
[""photo_id"", ""photo_id"", ...],
[""photo_id"", ""photo_id"", ...]
]
}
The first inner list is the photos you put on the inner ring, the second is the photos on the outer ring — each string is a photo identifier. Think of it as a little form: list the inner ones, then the outer ones. This JSON is only a sketch of the shape I expect, not the actual answer.
Please make sure to use the exact identifiers from the instance input — 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': 'MAXCUT', 'num_nodes': 24, 'num_edges': 52, 'edges': [{'u': 4, 'v': 1}, {'u': 4, 'v': 2}, {'u': 4, 'v': 8}, {'u': 3, 'v': 1}, {'u': 3, 'v': 6}, {'u': 3, 'v': 14}, {'u': 3, 'v': 17}, {'u': 3, 'v': 19}, {'u': 3, 'v': 22}, {'u': 3, 'v': 24}, {'u': 15, 'v': 9}, {'u': 15, 'v': 12}, {'u': 7, 'v': 5}, {'u': 7, 'v': 9}, {'u': 7, 'v': 11}, {'u': 11, 'v': 5}, {'u': 11, 'v': 9}, {'u': 11, 'v': 23}, {'u': 12, 'v': 9}, {'u': 12, 'v': 10}, {'u': 12, 'v': 13}, {'u': 12, 'v': 20}, {'u': 12, 'v': 21}, {'u': 17, 'v': 10}, {'u': 17, 'v': 21}, {'u': 18, 'v': 5}, {'u': 18, 'v': 6}, {'u': 18, 'v': 14}, {'u': 8, 'v': 1}, {'u': 8, 'v': 2}, {'u': 8, 'v': 5}, {'u': 8, 'v': 14}, {'u': 5, 'v': 2}, {'u': 13, 'v': 9}, {'u': 13, 'v': 23}, {'u': 20, 'v': 10}, {'u': 20, 'v': 21}, {'u': 9, 'v': 2}, {'u': 9, 'v': 16}, {'u': 9, 'v': 21}, {'u': 9, 'v': 23}, {'u': 9, 'v': 24}, {'u': 10, 'v': 21}, {'u': 14, 'v': 1}, {'u': 14, 'v': 6}, {'u': 22, 'v': 19}, {'u': 1, 'v': 2}, {'u': 1, 'v': 16}, {'u': 1, 'v': 24}, {'u': 2, 'v': 16}, {'u': 24, 'v': 16}, {'u': 24, 'v': 21}], 'source_file': 'wy2010.mtx', 'density': 0.18840579710144928, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0005.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0005.png', 'edge_connectivity': 2}","[[1, 4, 5, 6, 9, 12, 14, 17, 20, 22, 23, 24], [2, 3, 7, 8, 10, 11, 13, 15, 16, 18, 19, 21]]",39.0,"{'num_nodes': 24, 'num_edges': 52, 'edges': [{'u': 'D', 'v': 'A'}, {'u': 'D', 'v': 'B'}, {'u': 'D', 'v': 'H'}, {'u': 'C', 'v': 'A'}, {'u': 'C', 'v': 'F'}, {'u': 'C', 'v': 'N'}, {'u': 'C', 'v': 'Q'}, {'u': 'C', 'v': 'S'}, {'u': 'C', 'v': 'V'}, {'u': 'C', 'v': 'X'}, {'u': 'O', 'v': 'I'}, {'u': 'O', 'v': 'L'}, {'u': 'G', 'v': 'E'}, {'u': 'G', 'v': 'I'}, {'u': 'G', 'v': 'K'}, {'u': 'K', 'v': 'E'}, {'u': 'K', 'v': 'I'}, {'u': 'K', 'v': 'W'}, {'u': 'L', 'v': 'I'}, {'u': 'L', 'v': 'J'}, {'u': 'L', 'v': 'M'}, {'u': 'L', 'v': 'T'}, {'u': 'L', 'v': 'U'}, {'u': 'Q', 'v': 'J'}, {'u': 'Q', 'v': 'U'}, {'u': 'R', 'v': 'E'}, {'u': 'R', 'v': 'F'}, {'u': 'R', 'v': 'N'}, {'u': 'H', 'v': 'A'}, {'u': 'H', 'v': 'B'}, {'u': 'H', 'v': 'E'}, {'u': 'H', 'v': 'N'}, {'u': 'E', 'v': 'B'}, {'u': 'M', 'v': 'I'}, {'u': 'M', 'v': 'W'}, {'u': 'T', 'v': 'J'}, {'u': 'T', 'v': 'U'}, {'u': 'I', 'v': 'B'}, {'u': 'I', 'v': 'P'}, {'u': 'I', 'v': 'U'}, {'u': 'I', 'v': 'W'}, {'u': 'I', 'v': 'X'}, {'u': 'J', 'v': 'U'}, {'u': 'N', 'v': 'A'}, {'u': 'N', 'v': 'F'}, {'u': 'V', 'v': 'S'}, {'u': 'A', 'v': 'B'}, {'u': 'A', 'v': 'P'}, {'u': 'A', 'v': 'X'}, {'u': 'B', 'v': 'P'}, {'u': 'X', 'v': 'P'}, {'u': 'X', 'v': 'U'}]}","[['A', 'D', 'E', 'F', 'I', 'L', 'N', 'Q', 'T', 'V', 'W', 'X'], ['B', 'C', 'G', 'H', 'J', 'K', 'M', 'O', 'P', 'R', 'S', 'U']]",6,nl,names
MAXCUT,MAXCUT,"Back at the kitchen bench, the line cooks were assigning every ingredient to either table A or table B, trying to set things up so recipe pairings ended up on opposite tables as often as possible. A better setup is the one that separates more pairings, and its score comes from counting each pairing whose members sit on different tables. Each ingredient has to be placed on one of the two tables and cannot be placed twice or left out. The concrete ingredients and pairing details follow below.
{
""total_ingredients"": 23,
""total_pairings"": 48,
""edges"": [
{
""ingredient_a"": ""W"",
""ingredient_b"": ""A""
},
{
""ingredient_a"": ""W"",
""ingredient_b"": ""C""
},
{
""ingredient_a"": ""W"",
""ingredient_b"": ""G""
},
{
""ingredient_a"": ""S"",
""ingredient_b"": ""H""
},
{
""ingredient_a"": ""S"",
""ingredient_b"": ""N""
},
{
""ingredient_a"": ""S"",
""ingredient_b"": ""O""
},
{
""ingredient_a"": ""T"",
""ingredient_b"": ""F""
},
{
""ingredient_a"": ""T"",
""ingredient_b"": ""G""
},
{
""ingredient_a"": ""T"",
""ingredient_b"": ""H""
},
{
""ingredient_a"": ""T"",
""ingredient_b"": ""J""
},
{
""ingredient_a"": ""U"",
""ingredient_b"": ""C""
},
{
""ingredient_a"": ""U"",
""ingredient_b"": ""M""
},
{
""ingredient_a"": ""U"",
""ingredient_b"": ""P""
},
{
""ingredient_a"": ""I"",
""ingredient_b"": ""C""
},
{
""ingredient_a"": ""I"",
""ingredient_b"": ""E""
},
{
""ingredient_a"": ""I"",
""ingredient_b"": ""H""
},
{
""ingredient_a"": ""I"",
""ingredient_b"": ""M""
},
{
""ingredient_a"": ""I"",
""ingredient_b"": ""N""
},
{
""ingredient_a"": ""P"",
""ingredient_b"": ""A""
},
{
""ingredient_a"": ""P"",
""ingredient_b"": ""C""
},
{
""ingredient_a"": ""J"",
""ingredient_b"": ""B""
},
{
""ingredient_a"": ""J"",
""ingredient_b"": ""G""
},
{
""ingredient_a"": ""J"",
""ingredient_b"": ""H""
},
{
""ingredient_a"": ""J"",
""ingredient_b"": ""L""
},
{
""ingredient_a"": ""J"",
""ingredient_b"": ""O""
},
{
""ingredient_a"": ""K"",
""ingredient_b"": ""H""
},
{
""ingredient_a"": ""K"",
""ingredient_b"": ""V""
},
{
""ingredient_a"": ""Q"",
""ingredient_b"": ""H""
},
{
""ingredient_a"": ""A"",
""ingredient_b"": ""C""
},
{
""ingredient_a"": ""A"",
""ingredient_b"": ""G""
},
{
""ingredient_a"": ""A"",
""ingredient_b"": ""R""
},
{
""ingredient_a"": ""E"",
""ingredient_b"": ""C""
},
{
""ingredient_a"": ""E"",
""ingredient_b"": ""N""
},
{
""ingredient_a"": ""F"",
""ingredient_b"": ""H""
},
{
""ingredient_a"": ""F"",
""ingredient_b"": ""R""
},
{
""ingredient_a"": ""C"",
""ingredient_b"": ""G""
},
{
""ingredient_a"": ""C"",
""ingredient_b"": ""M""
},
{
""ingredient_a"": ""C"",
""ingredient_b"": ""O""
},
{
""ingredient_a"": ""L"",
""ingredient_b"": ""B""
},
{
""ingredient_a"": ""L"",
""ingredient_b"": ""O""
},
{
""ingredient_a"": ""R"",
""ingredient_b"": ""G""
},
{
""ingredient_a"": ""B"",
""ingredient_b"": ""H""
},
{
""ingredient_a"": ""V"",
""ingredient_b"": ""H""
},
{
""ingredient_a"": ""H"",
""ingredient_b"": ""D""
},
{
""ingredient_a"": ""H"",
""ingredient_b"": ""N""
},
{
""ingredient_a"": ""H"",
""ingredient_b"": ""O""
},
{
""ingredient_a"": ""M"",
""ingredient_b"": ""D""
},
{
""ingredient_a"": ""N"",
""ingredient_b"": ""O""
}
]
}
Oh, and when you’re ready to hand me the seating plan, just drop it in this little JSON shape so I can read it easily:
{
""solution"": [
[""ingredient_id"", ""ingredient_id"", ...],
[""ingredient_id"", ""ingredient_id"", ...]
]
}
Think of it like a simple form: ""solution"" holds two lists — the first list is whatever ingredients you put on table A, and the second list is the ingredients on table B. Each entry should be the ingredient identifier exactly as given in the instance. This is just a sketch of the expected shape, not the actual answer.
Please use the same 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': 'MAXCUT', 'num_nodes': 23, 'num_edges': 48, 'edges': [{'u': 23, 'v': 1}, {'u': 23, 'v': 3}, {'u': 23, 'v': 7}, {'u': 19, 'v': 8}, {'u': 19, 'v': 14}, {'u': 19, 'v': 15}, {'u': 20, 'v': 6}, {'u': 20, 'v': 7}, {'u': 20, 'v': 8}, {'u': 20, 'v': 10}, {'u': 21, 'v': 3}, {'u': 21, 'v': 13}, {'u': 21, 'v': 16}, {'u': 9, 'v': 3}, {'u': 9, 'v': 5}, {'u': 9, 'v': 8}, {'u': 9, 'v': 13}, {'u': 9, 'v': 14}, {'u': 16, 'v': 1}, {'u': 16, 'v': 3}, {'u': 10, 'v': 2}, {'u': 10, 'v': 7}, {'u': 10, 'v': 8}, {'u': 10, 'v': 12}, {'u': 10, 'v': 15}, {'u': 11, 'v': 8}, {'u': 11, 'v': 22}, {'u': 17, 'v': 8}, {'u': 1, 'v': 3}, {'u': 1, 'v': 7}, {'u': 1, 'v': 18}, {'u': 5, 'v': 3}, {'u': 5, 'v': 14}, {'u': 6, 'v': 8}, {'u': 6, 'v': 18}, {'u': 3, 'v': 7}, {'u': 3, 'v': 13}, {'u': 3, 'v': 15}, {'u': 12, 'v': 2}, {'u': 12, 'v': 15}, {'u': 18, 'v': 7}, {'u': 2, 'v': 8}, {'u': 22, 'v': 8}, {'u': 8, 'v': 4}, {'u': 8, 'v': 14}, {'u': 8, 'v': 15}, {'u': 13, 'v': 4}, {'u': 14, 'v': 15}], 'source_file': 'wa2010.mtx', 'density': 0.18972332015810275, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0006.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0006.png', 'edge_connectivity': 1}","[[3, 8, 11, 12, 13, 14, 16, 18, 20, 23], [1, 2, 4, 5, 6, 7, 9, 10, 15, 17, 19, 21, 22]]",36.0,"{'num_nodes': 23, 'num_edges': 48, 'edges': [{'u': 'W', 'v': 'A'}, {'u': 'W', 'v': 'C'}, {'u': 'W', 'v': 'G'}, {'u': 'S', 'v': 'H'}, {'u': 'S', 'v': 'N'}, {'u': 'S', 'v': 'O'}, {'u': 'T', 'v': 'F'}, {'u': 'T', 'v': 'G'}, {'u': 'T', 'v': 'H'}, {'u': 'T', 'v': 'J'}, {'u': 'U', 'v': 'C'}, {'u': 'U', 'v': 'M'}, {'u': 'U', 'v': 'P'}, {'u': 'I', 'v': 'C'}, {'u': 'I', 'v': 'E'}, {'u': 'I', 'v': 'H'}, {'u': 'I', 'v': 'M'}, {'u': 'I', 'v': 'N'}, {'u': 'P', 'v': 'A'}, {'u': 'P', 'v': 'C'}, {'u': 'J', 'v': 'B'}, {'u': 'J', 'v': 'G'}, {'u': 'J', 'v': 'H'}, {'u': 'J', 'v': 'L'}, {'u': 'J', 'v': 'O'}, {'u': 'K', 'v': 'H'}, {'u': 'K', 'v': 'V'}, {'u': 'Q', 'v': 'H'}, {'u': 'A', 'v': 'C'}, {'u': 'A', 'v': 'G'}, {'u': 'A', 'v': 'R'}, {'u': 'E', 'v': 'C'}, {'u': 'E', 'v': 'N'}, {'u': 'F', 'v': 'H'}, {'u': 'F', 'v': 'R'}, {'u': 'C', 'v': 'G'}, {'u': 'C', 'v': 'M'}, {'u': 'C', 'v': 'O'}, {'u': 'L', 'v': 'B'}, {'u': 'L', 'v': 'O'}, {'u': 'R', 'v': 'G'}, {'u': 'B', 'v': 'H'}, {'u': 'V', 'v': 'H'}, {'u': 'H', 'v': 'D'}, {'u': 'H', 'v': 'N'}, {'u': 'H', 'v': 'O'}, {'u': 'M', 'v': 'D'}, {'u': 'N', 'v': 'O'}]}","[['C', 'H', 'K', 'L', 'M', 'N', 'P', 'R', 'T', 'W'], ['A', 'B', 'D', 'E', 'F', 'G', 'I', 'J', 'O', 'Q', 'S', 'U', 'V']]",7,json,names
MAXCUT,MAXCUT,"At my place I imagined moving each household appliance into either the kitchen side or the living side, aiming to have as many utility links as possible go from one room to the other. You judge a layout by counting how many of those connections cross the room divide — higher counts mean a preferable setup. Every appliance must be placed in one of the two rooms and none can be duplicated or skipped. The detailed list of appliances and which ones are connected is shown below.
# num_appliances=22
# num_utility_links=40
appliance_a,appliance_b
13,2
13,5
13,10
13,14
13,16
13,21
16,0
16,10
16,14
9,0
9,10
9,14
9,15
19,6
19,8
19,14
19,15
18,14
14,0
14,2
14,5
14,12
14,15
6,1
6,8
6,10
20,7
20,10
17,10
17,15
3,12
0,10
5,2
4,10
4,11
10,1
10,7
10,15
1,7
1,8
You can hand me the placement in a tiny JSON shape like this — nothing fancy, just two lists inside a ""solution"" field:
{
""solution"": [
[""appliance_id"", ""appliance_id"", ...],
[""appliance_id"", ""appliance_id"", ...]
]
}
Think of it like a quick form: the first list is everything you drop on the kitchen side, the second list is everything you drop on the living side. Each item is an appliance identifier (just use the same exact labels from the instance). This JSON is only a sketch of the shape I expect, not the final answer.
- 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”"".
Please be sure to use the identifiers exactly as they appear in the instance input — no renaming and no new labels.","{'problem_type': 'MAXCUT', 'num_nodes': 22, 'num_edges': 40, 'edges': [{'u': 14, 'v': 3}, {'u': 14, 'v': 6}, {'u': 14, 'v': 11}, {'u': 14, 'v': 15}, {'u': 14, 'v': 17}, {'u': 14, 'v': 22}, {'u': 17, 'v': 1}, {'u': 17, 'v': 11}, {'u': 17, 'v': 15}, {'u': 10, 'v': 1}, {'u': 10, 'v': 11}, {'u': 10, 'v': 15}, {'u': 10, 'v': 16}, {'u': 20, 'v': 7}, {'u': 20, 'v': 9}, {'u': 20, 'v': 15}, {'u': 20, 'v': 16}, {'u': 19, 'v': 15}, {'u': 15, 'v': 1}, {'u': 15, 'v': 3}, {'u': 15, 'v': 6}, {'u': 15, 'v': 13}, {'u': 15, 'v': 16}, {'u': 7, 'v': 2}, {'u': 7, 'v': 9}, {'u': 7, 'v': 11}, {'u': 21, 'v': 8}, {'u': 21, 'v': 11}, {'u': 18, 'v': 11}, {'u': 18, 'v': 16}, {'u': 4, 'v': 13}, {'u': 1, 'v': 11}, {'u': 6, 'v': 3}, {'u': 5, 'v': 11}, {'u': 5, 'v': 12}, {'u': 11, 'v': 2}, {'u': 11, 'v': 8}, {'u': 11, 'v': 16}, {'u': 2, 'v': 8}, {'u': 2, 'v': 9}], 'source_file': 'wv2010.mtx', 'density': 0.17316017316017315, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0007.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0007.png', 'edge_connectivity': 1}","[[3, 4, 7, 8, 9, 11, 12, 15, 16, 17, 22], [1, 2, 5, 6, 10, 13, 14, 18, 19, 20, 21]]",30.0,"{'num_nodes': 22, 'num_edges': 40, 'edges': [{'u': 13, 'v': 2}, {'u': 13, 'v': 5}, {'u': 13, 'v': 10}, {'u': 13, 'v': 14}, {'u': 13, 'v': 16}, {'u': 13, 'v': 21}, {'u': 16, 'v': 0}, {'u': 16, 'v': 10}, {'u': 16, 'v': 14}, {'u': 9, 'v': 0}, {'u': 9, 'v': 10}, {'u': 9, 'v': 14}, {'u': 9, 'v': 15}, {'u': 19, 'v': 6}, {'u': 19, 'v': 8}, {'u': 19, 'v': 14}, {'u': 19, 'v': 15}, {'u': 18, 'v': 14}, {'u': 14, 'v': 0}, {'u': 14, 'v': 2}, {'u': 14, 'v': 5}, {'u': 14, 'v': 12}, {'u': 14, 'v': 15}, {'u': 6, 'v': 1}, {'u': 6, 'v': 8}, {'u': 6, 'v': 10}, {'u': 20, 'v': 7}, {'u': 20, 'v': 10}, {'u': 17, 'v': 10}, {'u': 17, 'v': 15}, {'u': 3, 'v': 12}, {'u': 0, 'v': 10}, {'u': 5, 'v': 2}, {'u': 4, 'v': 10}, {'u': 4, 'v': 11}, {'u': 10, 'v': 1}, {'u': 10, 'v': 7}, {'u': 10, 'v': 15}, {'u': 1, 'v': 7}, {'u': 1, 'v': 8}]}","[[2, 3, 6, 7, 8, 10, 11, 14, 15, 16, 21], [0, 1, 4, 5, 9, 12, 13, 17, 18, 19, 20]]",8,csv,0
MAXCUT,MAXCUT,"In a small theater the stage manager needs to assign every musician to either the left or right wing of the stage. What makes one assignment better than another is how many known collaboration pairs get separated by that split — simply count the pairs where one person is left and the other is right; the higher that number, the more successful the placement. Everyone must be placed once and only once, and the specific musicians and their collaborating partners are listed below.
{
""total_musicians"": 24,
""total_collaborations"": 50,
""edges"": [
{
""musician_id_a"": ""A"",
""musician_id_b"": ""C""
},
{
""musician_id_a"": ""A"",
""musician_id_b"": ""G""
},
{
""musician_id_a"": ""A"",
""musician_id_b"": ""L""
},
{
""musician_id_a"": ""A"",
""musician_id_b"": ""Q""
},
{
""musician_id_a"": ""B"",
""musician_id_b"": ""E""
},
{
""musician_id_a"": ""B"",
""musician_id_b"": ""J""
},
{
""musician_id_a"": ""B"",
""musician_id_b"": ""N""
},
{
""musician_id_a"": ""C"",
""musician_id_b"": ""L""
},
{
""musician_id_a"": ""C"",
""musician_id_b"": ""Q""
},
{
""musician_id_a"": ""O"",
""musician_id_b"": ""H""
},
{
""musician_id_a"": ""O"",
""musician_id_b"": ""M""
},
{
""musician_id_a"": ""O"",
""musician_id_b"": ""V""
},
{
""musician_id_a"": ""P"",
""musician_id_b"": ""E""
},
{
""musician_id_a"": ""P"",
""musician_id_b"": ""H""
},
{
""musician_id_a"": ""P"",
""musician_id_b"": ""M""
},
{
""musician_id_a"": ""D"",
""musician_id_b"": ""S""
},
{
""musician_id_a"": ""D"",
""musician_id_b"": ""W""
},
{
""musician_id_a"": ""F"",
""musician_id_b"": ""E""
},
{
""musician_id_a"": ""F"",
""musician_id_b"": ""R""
},
{
""musician_id_a"": ""F"",
""musician_id_b"": ""T""
},
{
""musician_id_a"": ""F"",
""musician_id_b"": ""U""
},
{
""musician_id_a"": ""G"",
""musician_id_b"": ""H""
},
{
""musician_id_a"": ""G"",
""musician_id_b"": ""K""
},
{
""musician_id_a"": ""G"",
""musician_id_b"": ""L""
},
{
""musician_id_a"": ""G"",
""musician_id_b"": ""M""
},
{
""musician_id_a"": ""G"",
""musician_id_b"": ""Q""
},
{
""musician_id_a"": ""H"",
""musician_id_b"": ""E""
},
{
""musician_id_a"": ""H"",
""musician_id_b"": ""I""
},
{
""musician_id_a"": ""H"",
""musician_id_b"": ""L""
},
{
""musician_id_a"": ""H"",
""musician_id_b"": ""M""
},
{
""musician_id_a"": ""H"",
""musician_id_b"": ""V""
},
{
""musician_id_a"": ""I"",
""musician_id_b"": ""L""
},
{
""musician_id_a"": ""I"",
""musician_id_b"": ""U""
},
{
""musician_id_a"": ""N"",
""musician_id_b"": ""E""
},
{
""musician_id_a"": ""Q"",
""musician_id_b"": ""K""
},
{
""musician_id_a"": ""Q"",
""musician_id_b"": ""S""
},
{
""musician_id_a"": ""M"",
""musician_id_b"": ""E""
},
{
""musician_id_a"": ""M"",
""musician_id_b"": ""K""
},
{
""musician_id_a"": ""M"",
""musician_id_b"": ""V""
},
{
""musician_id_a"": ""M"",
""musician_id_b"": ""W""
},
{
""musician_id_a"": ""M"",
""musician_id_b"": ""X""
},
{
""musician_id_a"": ""J"",
""musician_id_b"": ""E""
},
{
""musician_id_a"": ""J"",
""musician_id_b"": ""W""
},
{
""musician_id_a"": ""K"",
""musician_id_b"": ""S""
},
{
""musician_id_a"": ""L"",
""musician_id_b"": ""U""
},
{
""musician_id_a"": ""E"",
""musician_id_b"": ""T""
},
{
""musician_id_a"": ""E"",
""musician_id_b"": ""U""
},
{
""musician_id_a"": ""E"",
""musician_id_b"": ""W""
},
{
""musician_id_a"": ""E"",
""musician_id_b"": ""X""
},
{
""musician_id_a"": ""W"",
""musician_id_b"": ""S""
}
]
}
Oh — when you send back the placement, please use this simple JSON shape so it's easy to read and check:
{
""solution"": [
[""musician_id"", ""musician_id"", ...],
[""musician_id"", ""musician_id"", ...]
]
}
Here ""solution"" holds two lists: the first list is the musicians assigned to the left wing, the second list is the musicians assigned to the right wing. The ""musician_id"" entries are just placeholders showing where each musician's exact identifier from the input should go. This is only a sketch of the shape I expect — not the actual assignment.
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': 'MAXCUT', 'num_nodes': 24, 'num_edges': 50, 'edges': [{'u': 1, 'v': 3}, {'u': 1, 'v': 7}, {'u': 1, 'v': 12}, {'u': 1, 'v': 17}, {'u': 2, 'v': 5}, {'u': 2, 'v': 10}, {'u': 2, 'v': 14}, {'u': 3, 'v': 12}, {'u': 3, 'v': 17}, {'u': 15, 'v': 8}, {'u': 15, 'v': 13}, {'u': 15, 'v': 22}, {'u': 16, 'v': 5}, {'u': 16, 'v': 8}, {'u': 16, 'v': 13}, {'u': 4, 'v': 19}, {'u': 4, 'v': 23}, {'u': 6, 'v': 5}, {'u': 6, 'v': 18}, {'u': 6, 'v': 20}, {'u': 6, 'v': 21}, {'u': 7, 'v': 8}, {'u': 7, 'v': 11}, {'u': 7, 'v': 12}, {'u': 7, 'v': 13}, {'u': 7, 'v': 17}, {'u': 8, 'v': 5}, {'u': 8, 'v': 9}, {'u': 8, 'v': 12}, {'u': 8, 'v': 13}, {'u': 8, 'v': 22}, {'u': 9, 'v': 12}, {'u': 9, 'v': 21}, {'u': 14, 'v': 5}, {'u': 17, 'v': 11}, {'u': 17, 'v': 19}, {'u': 13, 'v': 5}, {'u': 13, 'v': 11}, {'u': 13, 'v': 22}, {'u': 13, 'v': 23}, {'u': 13, 'v': 24}, {'u': 10, 'v': 5}, {'u': 10, 'v': 23}, {'u': 11, 'v': 19}, {'u': 12, 'v': 21}, {'u': 5, 'v': 20}, {'u': 5, 'v': 21}, {'u': 5, 'v': 23}, {'u': 5, 'v': 24}, {'u': 23, 'v': 19}], 'source_file': 'vt2010.mtx', 'density': 0.18115942028985507, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0008.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0008.png', 'edge_connectivity': 1}","[[1, 2, 3, 8, 11, 15, 16, 18, 19, 20, 21, 23, 24], [4, 5, 6, 7, 9, 10, 12, 13, 14, 17, 22]]",36.0,"{'num_nodes': 24, 'num_edges': 50, 'edges': [{'u': 'A', 'v': 'C'}, {'u': 'A', 'v': 'G'}, {'u': 'A', 'v': 'L'}, {'u': 'A', 'v': 'Q'}, {'u': 'B', 'v': 'E'}, {'u': 'B', 'v': 'J'}, {'u': 'B', 'v': 'N'}, {'u': 'C', 'v': 'L'}, {'u': 'C', 'v': 'Q'}, {'u': 'O', 'v': 'H'}, {'u': 'O', 'v': 'M'}, {'u': 'O', 'v': 'V'}, {'u': 'P', 'v': 'E'}, {'u': 'P', 'v': 'H'}, {'u': 'P', 'v': 'M'}, {'u': 'D', 'v': 'S'}, {'u': 'D', 'v': 'W'}, {'u': 'F', 'v': 'E'}, {'u': 'F', 'v': 'R'}, {'u': 'F', 'v': 'T'}, {'u': 'F', 'v': 'U'}, {'u': 'G', 'v': 'H'}, {'u': 'G', 'v': 'K'}, {'u': 'G', 'v': 'L'}, {'u': 'G', 'v': 'M'}, {'u': 'G', 'v': 'Q'}, {'u': 'H', 'v': 'E'}, {'u': 'H', 'v': 'I'}, {'u': 'H', 'v': 'L'}, {'u': 'H', 'v': 'M'}, {'u': 'H', 'v': 'V'}, {'u': 'I', 'v': 'L'}, {'u': 'I', 'v': 'U'}, {'u': 'N', 'v': 'E'}, {'u': 'Q', 'v': 'K'}, {'u': 'Q', 'v': 'S'}, {'u': 'M', 'v': 'E'}, {'u': 'M', 'v': 'K'}, {'u': 'M', 'v': 'V'}, {'u': 'M', 'v': 'W'}, {'u': 'M', 'v': 'X'}, {'u': 'J', 'v': 'E'}, {'u': 'J', 'v': 'W'}, {'u': 'K', 'v': 'S'}, {'u': 'L', 'v': 'U'}, {'u': 'E', 'v': 'T'}, {'u': 'E', 'v': 'U'}, {'u': 'E', 'v': 'W'}, {'u': 'E', 'v': 'X'}, {'u': 'W', 'v': 'S'}]}","[['A', 'B', 'C', 'H', 'K', 'O', 'P', 'R', 'S', 'T', 'U', 'W', 'X'], ['D', 'E', 'F', 'G', 'I', 'J', 'L', 'M', 'N', 'Q', 'V']]",9,json,names
MAXCUT,MAXCUT,"I set up a little office challenge: everyone gets put on either Team Red or Team Blue, and the idea is to arrange people so as many working pairs as possible end up split across the two teams. The way to judge a setup is simple — count every working relationship where one person is on Red and the other is on Blue, and try to make that count as big as possible. Make sure every staff member is on one team or the other — nobody left unassigned and nobody on both. The concrete list of who works with whom is shown below.
There are 23 staff count in total and 44 working relationship count.
| person_a_id | person_b_id |
|---|---|
| 19 | 10 |
| 19 | 14 |
| 19 | 20 |
| 19 | 21 |
| 12 | 4 |
| 12 | 7 |
| 13 | 4 |
| 13 | 7 |
| 13 | 15 |
| 13 | 18 |
| 0 | 1 |
| 0 | 3 |
| 0 | 4 |
| 0 | 5 |
| 0 | 6 |
| 2 | 10 |
| 2 | 16 |
| 1 | 5 |
| 1 | 9 |
| 1 | 11 |
| 20 | 7 |
| 20 | 21 |
| 6 | 9 |
| 6 | 18 |
| 7 | 14 |
| 8 | 9 |
| 8 | 14 |
| 8 | 18 |
| 8 | 22 |
| 16 | 10 |
| 17 | 14 |
| 17 | 15 |
| 17 | 18 |
| 18 | 3 |
| 18 | 4 |
| 18 | 14 |
| 3 | 4 |
| 9 | 10 |
| 10 | 11 |
| 10 | 14 |
| 10 | 21 |
| 10 | 22 |
| 11 | 5 |
| 14 | 15 |
Also, when you send the team assignment back, please use this simple JSON layout so it's easy to check — two lists inside ""solution"", one list per team.
{
""solution"": [
[""staff_id"", ""staff_id"", ...],
[""staff_id"", ""staff_id"", ...]
]
}
This just shows the shape I expect: the first inner list is the people on Team Red, the second is Team Blue. Put each person's identifier (exactly as it appears in the instance) as a string in one of the lists — everyone should appear once and only once. The JSON above is just a sketch of the format, not the actual answer.
Please make sure to use the identifiers exactly as given in the instance input — no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'MAXCUT', 'num_nodes': 23, 'num_edges': 44, 'edges': [{'u': 20, 'v': 11}, {'u': 20, 'v': 15}, {'u': 20, 'v': 21}, {'u': 20, 'v': 22}, {'u': 13, 'v': 5}, {'u': 13, 'v': 8}, {'u': 14, 'v': 5}, {'u': 14, 'v': 8}, {'u': 14, 'v': 16}, {'u': 14, 'v': 19}, {'u': 1, 'v': 2}, {'u': 1, 'v': 4}, {'u': 1, 'v': 5}, {'u': 1, 'v': 6}, {'u': 1, 'v': 7}, {'u': 3, 'v': 11}, {'u': 3, 'v': 17}, {'u': 2, 'v': 6}, {'u': 2, 'v': 10}, {'u': 2, 'v': 12}, {'u': 21, 'v': 8}, {'u': 21, 'v': 22}, {'u': 7, 'v': 10}, {'u': 7, 'v': 19}, {'u': 8, 'v': 15}, {'u': 9, 'v': 10}, {'u': 9, 'v': 15}, {'u': 9, 'v': 19}, {'u': 9, 'v': 23}, {'u': 17, 'v': 11}, {'u': 18, 'v': 15}, {'u': 18, 'v': 16}, {'u': 18, 'v': 19}, {'u': 19, 'v': 4}, {'u': 19, 'v': 5}, {'u': 19, 'v': 15}, {'u': 4, 'v': 5}, {'u': 10, 'v': 11}, {'u': 11, 'v': 12}, {'u': 11, 'v': 15}, {'u': 11, 'v': 22}, {'u': 11, 'v': 23}, {'u': 12, 'v': 6}, {'u': 15, 'v': 16}], 'source_file': 'wi2010.mtx', 'density': 0.17391304347826086, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0009.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0009.png', 'edge_connectivity': 2}","[[2, 4, 6, 7, 9, 11, 13, 14, 15, 18, 21], [1, 3, 5, 8, 10, 12, 16, 17, 19, 20, 22, 23]]",36.0,"{'num_nodes': 23, 'num_edges': 44, 'edges': [{'u': 19, 'v': 10}, {'u': 19, 'v': 14}, {'u': 19, 'v': 20}, {'u': 19, 'v': 21}, {'u': 12, 'v': 4}, {'u': 12, 'v': 7}, {'u': 13, 'v': 4}, {'u': 13, 'v': 7}, {'u': 13, 'v': 15}, {'u': 13, 'v': 18}, {'u': 0, 'v': 1}, {'u': 0, 'v': 3}, {'u': 0, 'v': 4}, {'u': 0, 'v': 5}, {'u': 0, 'v': 6}, {'u': 2, 'v': 10}, {'u': 2, 'v': 16}, {'u': 1, 'v': 5}, {'u': 1, 'v': 9}, {'u': 1, 'v': 11}, {'u': 20, 'v': 7}, {'u': 20, 'v': 21}, {'u': 6, 'v': 9}, {'u': 6, 'v': 18}, {'u': 7, 'v': 14}, {'u': 8, 'v': 9}, {'u': 8, 'v': 14}, {'u': 8, 'v': 18}, {'u': 8, 'v': 22}, {'u': 16, 'v': 10}, {'u': 17, 'v': 14}, {'u': 17, 'v': 15}, {'u': 17, 'v': 18}, {'u': 18, 'v': 3}, {'u': 18, 'v': 4}, {'u': 18, 'v': 14}, {'u': 3, 'v': 4}, {'u': 9, 'v': 10}, {'u': 10, 'v': 11}, {'u': 10, 'v': 14}, {'u': 10, 'v': 21}, {'u': 10, 'v': 22}, {'u': 11, 'v': 5}, {'u': 14, 'v': 15}]}","[[1, 3, 5, 6, 8, 10, 12, 13, 14, 17, 20], [0, 2, 4, 7, 9, 11, 15, 16, 18, 19, 21, 22]]",10,markdown_table,0
MAXCUT,MAXCUT,"Someone in the production office wants the cast split into leads and supporting players in a way that maximizes the number of scenes where a lead is paired with a support. To compare different splits, just tally up how many scenes involve actors from different sides — the bigger that tally, the better the split. Each actor must be assigned to exactly one side; nobody can be left out or duplicated. The exact roster and scene map are listed below.
There are 23 actors and 46 scenes listed below.
Scene pairing T with A.
Scene pairing T with B.
Scene pairing T with M.
Scene pairing T with R.
Scene pairing A with M.
Scene pairing A with R.
Scene pairing M with B.
Scene pairing M with F.
Scene pairing L with J.
Scene pairing L with Q.
Scene pairing L with U.
Scene pairing K with N.
Scene pairing K with V.
Scene pairing N with H.
Scene pairing N with I.
Scene pairing N with O.
Scene pairing N with V.
Scene pairing O with H.
Scene pairing O with I.
Scene pairing O with R.
Scene pairing P with C.
Scene pairing P with D.
Scene pairing P with E.
Scene pairing P with W.
Scene pairing G with C.
Scene pairing G with D.
Scene pairing G with R.
Scene pairing G with S.
Scene pairing Q with F.
Scene pairing Q with J.
Scene pairing Q with U.
Scene pairing H with R.
Scene pairing I with C.
Scene pairing I with R.
Scene pairing I with V.
Scene pairing J with D.
Scene pairing J with W.
Scene pairing V with C.
Scene pairing W with E.
Scene pairing U with F.
Scene pairing R with B.
Scene pairing R with S.
Scene pairing S with B.
Scene pairing S with F.
Scene pairing C with E.
Scene pairing D with F.
Assign each of the 23 actors to exactly one side so the tally across these 46 scenes is maximized.
If you want to send me a proposed split, just drop it in a little JSON blob like this:
{
""solution"": [
[""actor_id"", ""actor_id"", ...],
[""actor_id"", ""actor_id"", ...]
]
}
Think of that as: the ""solution"" field holds two lists — the first list is the actors you’d call the leads, the second list is the supporting players. Each entry is an actor identifier from the instance (I put ""actor_id"" as a placeholder here). This is just the shape I need, not the actual assignment — fill in the real actor IDs from the scene map when you reply.
Please use the exact identifiers given in the instance input — no renaming, no new labels. Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'MAXCUT', 'num_nodes': 23, 'num_edges': 46, 'edges': [{'u': 20, 'v': 1}, {'u': 20, 'v': 2}, {'u': 20, 'v': 13}, {'u': 20, 'v': 18}, {'u': 1, 'v': 13}, {'u': 1, 'v': 18}, {'u': 13, 'v': 2}, {'u': 13, 'v': 6}, {'u': 12, 'v': 10}, {'u': 12, 'v': 17}, {'u': 12, 'v': 21}, {'u': 11, 'v': 14}, {'u': 11, 'v': 22}, {'u': 14, 'v': 8}, {'u': 14, 'v': 9}, {'u': 14, 'v': 15}, {'u': 14, 'v': 22}, {'u': 15, 'v': 8}, {'u': 15, 'v': 9}, {'u': 15, 'v': 18}, {'u': 16, 'v': 3}, {'u': 16, 'v': 4}, {'u': 16, 'v': 5}, {'u': 16, 'v': 23}, {'u': 7, 'v': 3}, {'u': 7, 'v': 4}, {'u': 7, 'v': 18}, {'u': 7, 'v': 19}, {'u': 17, 'v': 6}, {'u': 17, 'v': 10}, {'u': 17, 'v': 21}, {'u': 8, 'v': 18}, {'u': 9, 'v': 3}, {'u': 9, 'v': 18}, {'u': 9, 'v': 22}, {'u': 10, 'v': 4}, {'u': 10, 'v': 23}, {'u': 22, 'v': 3}, {'u': 23, 'v': 5}, {'u': 21, 'v': 6}, {'u': 18, 'v': 2}, {'u': 18, 'v': 19}, {'u': 19, 'v': 2}, {'u': 19, 'v': 6}, {'u': 3, 'v': 5}, {'u': 4, 'v': 6}], 'source_file': 'wi2010.mtx', 'density': 0.18181818181818182, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0010.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0010.png', 'edge_connectivity': 2}","[[1, 2, 5, 6, 7, 8, 9, 10, 16, 21, 22], [3, 4, 11, 12, 13, 14, 15, 17, 18, 19, 20, 23]]",36.0,"{'num_nodes': 23, 'num_edges': 46, 'edges': [{'u': 'T', 'v': 'A'}, {'u': 'T', 'v': 'B'}, {'u': 'T', 'v': 'M'}, {'u': 'T', 'v': 'R'}, {'u': 'A', 'v': 'M'}, {'u': 'A', 'v': 'R'}, {'u': 'M', 'v': 'B'}, {'u': 'M', 'v': 'F'}, {'u': 'L', 'v': 'J'}, {'u': 'L', 'v': 'Q'}, {'u': 'L', 'v': 'U'}, {'u': 'K', 'v': 'N'}, {'u': 'K', 'v': 'V'}, {'u': 'N', 'v': 'H'}, {'u': 'N', 'v': 'I'}, {'u': 'N', 'v': 'O'}, {'u': 'N', 'v': 'V'}, {'u': 'O', 'v': 'H'}, {'u': 'O', 'v': 'I'}, {'u': 'O', 'v': 'R'}, {'u': 'P', 'v': 'C'}, {'u': 'P', 'v': 'D'}, {'u': 'P', 'v': 'E'}, {'u': 'P', 'v': 'W'}, {'u': 'G', 'v': 'C'}, {'u': 'G', 'v': 'D'}, {'u': 'G', 'v': 'R'}, {'u': 'G', 'v': 'S'}, {'u': 'Q', 'v': 'F'}, {'u': 'Q', 'v': 'J'}, {'u': 'Q', 'v': 'U'}, {'u': 'H', 'v': 'R'}, {'u': 'I', 'v': 'C'}, {'u': 'I', 'v': 'R'}, {'u': 'I', 'v': 'V'}, {'u': 'J', 'v': 'D'}, {'u': 'J', 'v': 'W'}, {'u': 'V', 'v': 'C'}, {'u': 'W', 'v': 'E'}, {'u': 'U', 'v': 'F'}, {'u': 'R', 'v': 'B'}, {'u': 'R', 'v': 'S'}, {'u': 'S', 'v': 'B'}, {'u': 'S', 'v': 'F'}, {'u': 'C', 'v': 'E'}, {'u': 'D', 'v': 'F'}]}","[['A', 'B', 'E', 'F', 'G', 'H', 'I', 'J', 'P', 'U', 'V'], ['C', 'D', 'K', 'L', 'M', 'N', 'O', 'Q', 'R', 'S', 'T', 'W']]",11,nl,names
MAXCUT,MAXCUT,"We gathered a bunch of variable icons on a canvas and need to split them into two groups, left and right, so that the strongest relationships fall across the divide instead of sitting inside the same group. That means making a choice for every variable (each one goes in exactly one group), then tallying up the number of strong correlations that connect a variable on the left with a variable on the right — the goal is to make that tally as large as possible. The concrete details will be shown below.
There are 25 variables in total and 62 strong correlations.
| variable_a_id | variable_b_id |
|---|---|
| 22 | 1 |
| 22 | 3 |
| 22 | 5 |
| 22 | 6 |
| 22 | 8 |
| 22 | 9 |
| 22 | 11 |
| 22 | 12 |
| 22 | 13 |
| 22 | 17 |
| 22 | 20 |
| 22 | 24 |
| 11 | 6 |
| 11 | 12 |
| 11 | 20 |
| 10 | 1 |
| 10 | 4 |
| 10 | 14 |
| 10 | 20 |
| 1 | 3 |
| 1 | 4 |
| 1 | 7 |
| 1 | 13 |
| 1 | 20 |
| 1 | 23 |
| 2 | 20 |
| 2 | 25 |
| 8 | 20 |
| 8 | 24 |
| 13 | 17 |
| 3 | 5 |
| 3 | 7 |
| 19 | 9 |
| 19 | 12 |
| 19 | 17 |
| 19 | 20 |
| 14 | 4 |
| 14 | 16 |
| 14 | 18 |
| 14 | 20 |
| 15 | 20 |
| 15 | 21 |
| 4 | 16 |
| 4 | 23 |
| 20 | 5 |
| 20 | 6 |
| 20 | 7 |
| 20 | 12 |
| 20 | 16 |
| 20 | 17 |
| 20 | 18 |
| 20 | 21 |
| 20 | 23 |
| 20 | 24 |
| 20 | 25 |
| 24 | 6 |
| 9 | 12 |
| 9 | 17 |
| 21 | 23 |
| 18 | 16 |
| 18 | 25 |
| 16 | 23 |
You can just drop the two groups into this simple JSON shape when you reply — keeps things tidy and easy to read:
{
""solution"": [
[""variable_id"", ""variable_id"", ...],
[""variable_id"", ""variable_id"", ...]
]
}
Each of the two inner lists is one side of the split (left and right), and each placeholder is where you'd put a variable's identifier. Think of it like a form: first list = left group, second list = right group. This is just the expected shape — not the actual solution itself.
Please use the exact identifiers given in the instance input — do not rename them or invent new ones.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'MAXCUT', 'num_nodes': 25, 'num_edges': 62, 'edges': [{'u': 22, 'v': 1}, {'u': 22, 'v': 3}, {'u': 22, 'v': 5}, {'u': 22, 'v': 6}, {'u': 22, 'v': 8}, {'u': 22, 'v': 9}, {'u': 22, 'v': 11}, {'u': 22, 'v': 12}, {'u': 22, 'v': 13}, {'u': 22, 'v': 17}, {'u': 22, 'v': 20}, {'u': 22, 'v': 24}, {'u': 11, 'v': 6}, {'u': 11, 'v': 12}, {'u': 11, 'v': 20}, {'u': 10, 'v': 1}, {'u': 10, 'v': 4}, {'u': 10, 'v': 14}, {'u': 10, 'v': 20}, {'u': 1, 'v': 3}, {'u': 1, 'v': 4}, {'u': 1, 'v': 7}, {'u': 1, 'v': 13}, {'u': 1, 'v': 20}, {'u': 1, 'v': 23}, {'u': 2, 'v': 20}, {'u': 2, 'v': 25}, {'u': 8, 'v': 20}, {'u': 8, 'v': 24}, {'u': 13, 'v': 17}, {'u': 3, 'v': 5}, {'u': 3, 'v': 7}, {'u': 19, 'v': 9}, {'u': 19, 'v': 12}, {'u': 19, 'v': 17}, {'u': 19, 'v': 20}, {'u': 14, 'v': 4}, {'u': 14, 'v': 16}, {'u': 14, 'v': 18}, {'u': 14, 'v': 20}, {'u': 15, 'v': 20}, {'u': 15, 'v': 21}, {'u': 4, 'v': 16}, {'u': 4, 'v': 23}, {'u': 20, 'v': 5}, {'u': 20, 'v': 6}, {'u': 20, 'v': 7}, {'u': 20, 'v': 12}, {'u': 20, 'v': 16}, {'u': 20, 'v': 17}, {'u': 20, 'v': 18}, {'u': 20, 'v': 21}, {'u': 20, 'v': 23}, {'u': 20, 'v': 24}, {'u': 20, 'v': 25}, {'u': 24, 'v': 6}, {'u': 9, 'v': 12}, {'u': 9, 'v': 17}, {'u': 21, 'v': 23}, {'u': 18, 'v': 16}, {'u': 18, 'v': 25}, {'u': 16, 'v': 23}], 'source_file': 'wv2010.mtx', 'density': 0.20666666666666667, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0011.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0011.png', 'edge_connectivity': 2}","[[3, 4, 9, 13, 14, 19, 20, 22, 23, 24, 25], [1, 2, 5, 6, 7, 8, 10, 11, 12, 15, 16, 17, 18, 21]]",43.0,"{'num_nodes': 25, 'num_edges': 62, 'edges': [{'u': 22, 'v': 1}, {'u': 22, 'v': 3}, {'u': 22, 'v': 5}, {'u': 22, 'v': 6}, {'u': 22, 'v': 8}, {'u': 22, 'v': 9}, {'u': 22, 'v': 11}, {'u': 22, 'v': 12}, {'u': 22, 'v': 13}, {'u': 22, 'v': 17}, {'u': 22, 'v': 20}, {'u': 22, 'v': 24}, {'u': 11, 'v': 6}, {'u': 11, 'v': 12}, {'u': 11, 'v': 20}, {'u': 10, 'v': 1}, {'u': 10, 'v': 4}, {'u': 10, 'v': 14}, {'u': 10, 'v': 20}, {'u': 1, 'v': 3}, {'u': 1, 'v': 4}, {'u': 1, 'v': 7}, {'u': 1, 'v': 13}, {'u': 1, 'v': 20}, {'u': 1, 'v': 23}, {'u': 2, 'v': 20}, {'u': 2, 'v': 25}, {'u': 8, 'v': 20}, {'u': 8, 'v': 24}, {'u': 13, 'v': 17}, {'u': 3, 'v': 5}, {'u': 3, 'v': 7}, {'u': 19, 'v': 9}, {'u': 19, 'v': 12}, {'u': 19, 'v': 17}, {'u': 19, 'v': 20}, {'u': 14, 'v': 4}, {'u': 14, 'v': 16}, {'u': 14, 'v': 18}, {'u': 14, 'v': 20}, {'u': 15, 'v': 20}, {'u': 15, 'v': 21}, {'u': 4, 'v': 16}, {'u': 4, 'v': 23}, {'u': 20, 'v': 5}, {'u': 20, 'v': 6}, {'u': 20, 'v': 7}, {'u': 20, 'v': 12}, {'u': 20, 'v': 16}, {'u': 20, 'v': 17}, {'u': 20, 'v': 18}, {'u': 20, 'v': 21}, {'u': 20, 'v': 23}, {'u': 20, 'v': 24}, {'u': 20, 'v': 25}, {'u': 24, 'v': 6}, {'u': 9, 'v': 12}, {'u': 9, 'v': 17}, {'u': 21, 'v': 23}, {'u': 18, 'v': 16}, {'u': 18, 'v': 25}, {'u': 16, 'v': 23}]}","[[3, 4, 9, 13, 14, 19, 20, 22, 23, 24, 25], [1, 2, 5, 6, 7, 8, 10, 11, 12, 15, 16, 17, 18, 21]]",12,markdown_table,1
MAXCUT,MAXCUT,"I live on a long street with buildings on both sides, and the town wants to label each building as either part of the north block or the south block. The job is to decide, for every single building, whether it belongs to the north side or the south side — no building can be skipped or put in both places. What makes one assignment better than another is how many utility lines end up running between a north building and a south building: count every line that links a building on the north block to one on the south block, and try to make that count as big as possible. Concrete details of the street layout are shown below.
# num_buildings=24
# num_utility_lines=48
building_u_id,building_v_id
16,13
16,14
16,15
10,3
10,7
10,8
10,17
10,18
12,2
12,8
12,18
13,4
13,5
13,7
13,11
13,18
5,6
5,18
21,7
21,8
21,18
0,1
0,18
0,23
9,1
9,18
9,20
22,18
22,19
3,7
3,8
4,11
4,18
19,18
19,23
20,1
20,18
14,7
11,15
6,7
6,18
23,18
1,18
7,8
8,2
8,18
17,18
2,18
Oh, and when you send back the assignment, it helps a lot if you stick to a tiny JSON shape like this so it's easy to read:
{
""solution"": [
[""building_id"", ""building_id"", ...],
[""building_id"", ""building_id"", ...]
]
}
The two inner lists are the two sides of the street (one list for the north block, one for the south block). Each quoted placeholder is just showing where a building identifier goes — in your real reply, swap those placeholders for the actual building IDs from the instance. This is just a sketch of the format I expect, not the actual answer.
Please 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': 'MAXCUT', 'num_nodes': 24, 'num_edges': 48, 'edges': [{'u': 17, 'v': 14}, {'u': 17, 'v': 15}, {'u': 17, 'v': 16}, {'u': 11, 'v': 4}, {'u': 11, 'v': 8}, {'u': 11, 'v': 9}, {'u': 11, 'v': 18}, {'u': 11, 'v': 19}, {'u': 13, 'v': 3}, {'u': 13, 'v': 9}, {'u': 13, 'v': 19}, {'u': 14, 'v': 5}, {'u': 14, 'v': 6}, {'u': 14, 'v': 8}, {'u': 14, 'v': 12}, {'u': 14, 'v': 19}, {'u': 6, 'v': 7}, {'u': 6, 'v': 19}, {'u': 22, 'v': 8}, {'u': 22, 'v': 9}, {'u': 22, 'v': 19}, {'u': 1, 'v': 2}, {'u': 1, 'v': 19}, {'u': 1, 'v': 24}, {'u': 10, 'v': 2}, {'u': 10, 'v': 19}, {'u': 10, 'v': 21}, {'u': 23, 'v': 19}, {'u': 23, 'v': 20}, {'u': 4, 'v': 8}, {'u': 4, 'v': 9}, {'u': 5, 'v': 12}, {'u': 5, 'v': 19}, {'u': 20, 'v': 19}, {'u': 20, 'v': 24}, {'u': 21, 'v': 2}, {'u': 21, 'v': 19}, {'u': 15, 'v': 8}, {'u': 12, 'v': 16}, {'u': 7, 'v': 8}, {'u': 7, 'v': 19}, {'u': 24, 'v': 19}, {'u': 2, 'v': 19}, {'u': 8, 'v': 9}, {'u': 9, 'v': 3}, {'u': 9, 'v': 19}, {'u': 18, 'v': 19}, {'u': 3, 'v': 19}], 'source_file': 'wv2010.mtx', 'density': 0.17391304347826086, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0012.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0012.png', 'edge_connectivity': 2}","[[1, 3, 4, 5, 7, 10, 11, 13, 14, 15, 16, 18, 20, 21, 22], [2, 6, 8, 9, 12, 17, 19, 23, 24]]",37.0,"{'num_nodes': 24, 'num_edges': 48, 'edges': [{'u': 16, 'v': 13}, {'u': 16, 'v': 14}, {'u': 16, 'v': 15}, {'u': 10, 'v': 3}, {'u': 10, 'v': 7}, {'u': 10, 'v': 8}, {'u': 10, 'v': 17}, {'u': 10, 'v': 18}, {'u': 12, 'v': 2}, {'u': 12, 'v': 8}, {'u': 12, 'v': 18}, {'u': 13, 'v': 4}, {'u': 13, 'v': 5}, {'u': 13, 'v': 7}, {'u': 13, 'v': 11}, {'u': 13, 'v': 18}, {'u': 5, 'v': 6}, {'u': 5, 'v': 18}, {'u': 21, 'v': 7}, {'u': 21, 'v': 8}, {'u': 21, 'v': 18}, {'u': 0, 'v': 1}, {'u': 0, 'v': 18}, {'u': 0, 'v': 23}, {'u': 9, 'v': 1}, {'u': 9, 'v': 18}, {'u': 9, 'v': 20}, {'u': 22, 'v': 18}, {'u': 22, 'v': 19}, {'u': 3, 'v': 7}, {'u': 3, 'v': 8}, {'u': 4, 'v': 11}, {'u': 4, 'v': 18}, {'u': 19, 'v': 18}, {'u': 19, 'v': 23}, {'u': 20, 'v': 1}, {'u': 20, 'v': 18}, {'u': 14, 'v': 7}, {'u': 11, 'v': 15}, {'u': 6, 'v': 7}, {'u': 6, 'v': 18}, {'u': 23, 'v': 18}, {'u': 1, 'v': 18}, {'u': 7, 'v': 8}, {'u': 8, 'v': 2}, {'u': 8, 'v': 18}, {'u': 17, 'v': 18}, {'u': 2, 'v': 18}]}","[[0, 2, 3, 4, 6, 9, 10, 12, 13, 14, 15, 17, 19, 20, 21], [1, 5, 7, 8, 11, 16, 18, 22, 23]]",13,csv,0
MAXCUT,MAXCUT,"I run the small dog room at a daycare and the task is simple-sounding: every dog has to live either in the indoor run or the outdoor run, and certain pairs of dogs are marked as compatible. The aim is to split the pack so that as many of those compatible pairs as possible end up in different runs — the “score” for any arrangement is just the count of compatible pairs that are separated between indoor and outdoor. Every dog has to be placed in exactly one of the two runs (no dog left out and none put in both). The exact list of dogs and their compatibility pairs is shown below.
There are 22 num dogs in total and 47 num compatibility pairs.
| dog_u_id | dog_v_id |
|---|---|
| 7 | 5 |
| 7 | 16 |
| 7 | 20 |
| 5 | 1 |
| 5 | 3 |
| 5 | 4 |
| 5 | 9 |
| 5 | 16 |
| 5 | 19 |
| 5 | 20 |
| 4 | 3 |
| 4 | 18 |
| 4 | 19 |
| 3 | 9 |
| 3 | 13 |
| 15 | 1 |
| 15 | 8 |
| 15 | 18 |
| 15 | 19 |
| 2 | 9 |
| 2 | 12 |
| 2 | 20 |
| 2 | 21 |
| 2 | 22 |
| 9 | 10 |
| 9 | 13 |
| 9 | 14 |
| 9 | 16 |
| 9 | 17 |
| 9 | 21 |
| 14 | 10 |
| 14 | 13 |
| 14 | 17 |
| 10 | 12 |
| 11 | 1 |
| 11 | 8 |
| 11 | 20 |
| 17 | 13 |
| 12 | 6 |
| 12 | 22 |
| 20 | 16 |
| 20 | 22 |
| 19 | 1 |
| 21 | 16 |
| 1 | 8 |
| 13 | 8 |
| 22 | 6 |
If you want to hand me the final split in a computer-friendly way, just drop it in a tiny JSON like this:
{
""solution"": [
[""dog_id"", ""dog_id"", ...],
[""dog_id"", ""dog_id"", ...]
]
}
Think of the first list as the dogs you put in the indoor run and the second list as the dogs in the outdoor run. Each entry should be the exact dog identifier from the instance (this JSON is just the shape I need, not the actual assignment).
Please make sure you use the identifiers exactly as they appear in the 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': 'MAXCUT', 'num_nodes': 22, 'num_edges': 47, 'edges': [{'u': 7, 'v': 5}, {'u': 7, 'v': 16}, {'u': 7, 'v': 20}, {'u': 5, 'v': 1}, {'u': 5, 'v': 3}, {'u': 5, 'v': 4}, {'u': 5, 'v': 9}, {'u': 5, 'v': 16}, {'u': 5, 'v': 19}, {'u': 5, 'v': 20}, {'u': 4, 'v': 3}, {'u': 4, 'v': 18}, {'u': 4, 'v': 19}, {'u': 3, 'v': 9}, {'u': 3, 'v': 13}, {'u': 15, 'v': 1}, {'u': 15, 'v': 8}, {'u': 15, 'v': 18}, {'u': 15, 'v': 19}, {'u': 2, 'v': 9}, {'u': 2, 'v': 12}, {'u': 2, 'v': 20}, {'u': 2, 'v': 21}, {'u': 2, 'v': 22}, {'u': 9, 'v': 10}, {'u': 9, 'v': 13}, {'u': 9, 'v': 14}, {'u': 9, 'v': 16}, {'u': 9, 'v': 17}, {'u': 9, 'v': 21}, {'u': 14, 'v': 10}, {'u': 14, 'v': 13}, {'u': 14, 'v': 17}, {'u': 10, 'v': 12}, {'u': 11, 'v': 1}, {'u': 11, 'v': 8}, {'u': 11, 'v': 20}, {'u': 17, 'v': 13}, {'u': 12, 'v': 6}, {'u': 12, 'v': 22}, {'u': 20, 'v': 16}, {'u': 20, 'v': 22}, {'u': 19, 'v': 1}, {'u': 21, 'v': 16}, {'u': 1, 'v': 8}, {'u': 13, 'v': 8}, {'u': 22, 'v': 6}], 'source_file': 'wa2010.mtx', 'density': 0.20346320346320346, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0013.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0013.png', 'edge_connectivity': 2}","[[1, 3, 7, 8, 9, 12, 14, 18, 19, 20, 21], [2, 4, 5, 6, 10, 11, 13, 15, 16, 17, 22]]",36.0,"{'num_nodes': 22, 'num_edges': 47, 'edges': [{'u': 7, 'v': 5}, {'u': 7, 'v': 16}, {'u': 7, 'v': 20}, {'u': 5, 'v': 1}, {'u': 5, 'v': 3}, {'u': 5, 'v': 4}, {'u': 5, 'v': 9}, {'u': 5, 'v': 16}, {'u': 5, 'v': 19}, {'u': 5, 'v': 20}, {'u': 4, 'v': 3}, {'u': 4, 'v': 18}, {'u': 4, 'v': 19}, {'u': 3, 'v': 9}, {'u': 3, 'v': 13}, {'u': 15, 'v': 1}, {'u': 15, 'v': 8}, {'u': 15, 'v': 18}, {'u': 15, 'v': 19}, {'u': 2, 'v': 9}, {'u': 2, 'v': 12}, {'u': 2, 'v': 20}, {'u': 2, 'v': 21}, {'u': 2, 'v': 22}, {'u': 9, 'v': 10}, {'u': 9, 'v': 13}, {'u': 9, 'v': 14}, {'u': 9, 'v': 16}, {'u': 9, 'v': 17}, {'u': 9, 'v': 21}, {'u': 14, 'v': 10}, {'u': 14, 'v': 13}, {'u': 14, 'v': 17}, {'u': 10, 'v': 12}, {'u': 11, 'v': 1}, {'u': 11, 'v': 8}, {'u': 11, 'v': 20}, {'u': 17, 'v': 13}, {'u': 12, 'v': 6}, {'u': 12, 'v': 22}, {'u': 20, 'v': 16}, {'u': 20, 'v': 22}, {'u': 19, 'v': 1}, {'u': 21, 'v': 16}, {'u': 1, 'v': 8}, {'u': 13, 'v': 8}, {'u': 22, 'v': 6}]}","[[1, 3, 7, 8, 9, 12, 14, 18, 19, 20, 21], [2, 4, 5, 6, 10, 11, 13, 15, 16, 17, 22]]",14,markdown_table,1
MAXCUT,MAXCUT,"Recently the curator asked for a simple plan: every painting must live on either the east gallery wall or the west gallery wall (no skipping or repeating), and certain works are connected in pairs. The goal was to split as many of those connected pairs across the two walls as possible. Evaluate any arrangement by counting how many pairs are split between east and west — the count is the measure of success. The detailed inventory and pairings are provided below.
There are 19 num paintings in total and 41 num thematic pairs.
| painting_a_id | painting_b_id |
|---|---|
| G | A |
| G | C |
| G | H |
| G | I |
| G | M |
| G | N |
| G | R |
| G | S |
| C | H |
| C | I |
| C | M |
| C | N |
| I | A |
| I | E |
| I | F |
| I | K |
| I | M |
| I | P |
| I | R |
| I | S |
| H | M |
| H | N |
| S | A |
| D | R |
| E | P |
| E | R |
| F | K |
| F | O |
| F | R |
| J | K |
| J | Q |
| O | K |
| O | R |
| P | R |
| R | B |
| R | L |
| R | M |
| R | Q |
| K | B |
| L | Q |
| B | Q |
Oh, and when you reply with an arrangement, please follow this simple JSON layout:
{
""solution"": [
[""painting_id"", ""painting_id"", ...],
[""painting_id"", ""painting_id"", ...]
]
}
This just sketches the shape I need: ""solution"" contains two lists — the first list is the paintings assigned to the east wall, the second list is the paintings assigned to the west wall. Each entry is a painting identifier (just the IDs from the instance).
This JSON is only a sketch of the expected shape, not the actual answer.
Also, please make sure all identifiers are 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': 'MAXCUT', 'num_nodes': 19, 'num_edges': 41, 'edges': [{'u': 7, 'v': 1}, {'u': 7, 'v': 3}, {'u': 7, 'v': 8}, {'u': 7, 'v': 9}, {'u': 7, 'v': 13}, {'u': 7, 'v': 14}, {'u': 7, 'v': 18}, {'u': 7, 'v': 19}, {'u': 3, 'v': 8}, {'u': 3, 'v': 9}, {'u': 3, 'v': 13}, {'u': 3, 'v': 14}, {'u': 9, 'v': 1}, {'u': 9, 'v': 5}, {'u': 9, 'v': 6}, {'u': 9, 'v': 11}, {'u': 9, 'v': 13}, {'u': 9, 'v': 16}, {'u': 9, 'v': 18}, {'u': 9, 'v': 19}, {'u': 8, 'v': 13}, {'u': 8, 'v': 14}, {'u': 19, 'v': 1}, {'u': 4, 'v': 18}, {'u': 5, 'v': 16}, {'u': 5, 'v': 18}, {'u': 6, 'v': 11}, {'u': 6, 'v': 15}, {'u': 6, 'v': 18}, {'u': 10, 'v': 11}, {'u': 10, 'v': 17}, {'u': 15, 'v': 11}, {'u': 15, 'v': 18}, {'u': 16, 'v': 18}, {'u': 18, 'v': 2}, {'u': 18, 'v': 12}, {'u': 18, 'v': 13}, {'u': 18, 'v': 17}, {'u': 11, 'v': 2}, {'u': 12, 'v': 17}, {'u': 2, 'v': 17}], 'source_file': 'wi2010.mtx', 'density': 0.23976608187134502, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0014.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0014.png', 'edge_connectivity': 1}","[[3, 8, 9, 11, 17, 18, 19], [1, 2, 4, 5, 6, 7, 10, 12, 13, 14, 15, 16]]",30.0,"{'num_nodes': 19, 'num_edges': 41, 'edges': [{'u': 'G', 'v': 'A'}, {'u': 'G', 'v': 'C'}, {'u': 'G', 'v': 'H'}, {'u': 'G', 'v': 'I'}, {'u': 'G', 'v': 'M'}, {'u': 'G', 'v': 'N'}, {'u': 'G', 'v': 'R'}, {'u': 'G', 'v': 'S'}, {'u': 'C', 'v': 'H'}, {'u': 'C', 'v': 'I'}, {'u': 'C', 'v': 'M'}, {'u': 'C', 'v': 'N'}, {'u': 'I', 'v': 'A'}, {'u': 'I', 'v': 'E'}, {'u': 'I', 'v': 'F'}, {'u': 'I', 'v': 'K'}, {'u': 'I', 'v': 'M'}, {'u': 'I', 'v': 'P'}, {'u': 'I', 'v': 'R'}, {'u': 'I', 'v': 'S'}, {'u': 'H', 'v': 'M'}, {'u': 'H', 'v': 'N'}, {'u': 'S', 'v': 'A'}, {'u': 'D', 'v': 'R'}, {'u': 'E', 'v': 'P'}, {'u': 'E', 'v': 'R'}, {'u': 'F', 'v': 'K'}, {'u': 'F', 'v': 'O'}, {'u': 'F', 'v': 'R'}, {'u': 'J', 'v': 'K'}, {'u': 'J', 'v': 'Q'}, {'u': 'O', 'v': 'K'}, {'u': 'O', 'v': 'R'}, {'u': 'P', 'v': 'R'}, {'u': 'R', 'v': 'B'}, {'u': 'R', 'v': 'L'}, {'u': 'R', 'v': 'M'}, {'u': 'R', 'v': 'Q'}, {'u': 'K', 'v': 'B'}, {'u': 'L', 'v': 'Q'}, {'u': 'B', 'v': 'Q'}]}","[['C', 'H', 'I', 'K', 'Q', 'R', 'S'], ['A', 'B', 'D', 'E', 'F', 'G', 'J', 'L', 'M', 'N', 'O', 'P']]",15,markdown_table,names
MAXCUT,MAXCUT,"We have a stack of exam items and a list of question pairs that are related, and the job is to divide the questions between a morning booklet and an afternoon booklet. A layout is better the more of those related pairs are separated between the two booklets; to tell which layout is better you just count how many related pairs end up with one question in each booklet. All questions need to be assigned to one booklet only — none can be skipped or duplicated. The exact questions and their links are given below.
We list the 25 questions and the 52 related pairs below.
Question 23 is related to question 7.
Question 23 is related to question 12.
Question 23 is related to question 13.
Question 23 is related to question 20.
Question 23 is related to question 25.
Question 14 is related to question 11.
Question 14 is related to question 16.
Question 14 is related to question 17.
Question 14 is related to question 24.
Question 20 is related to question 1.
Question 20 is related to question 3.
Question 20 is related to question 7.
Question 20 is related to question 19.
Question 20 is related to question 21.
Question 20 is related to question 25.
Question 15 is related to question 10.
Question 15 is related to question 21.
Question 15 is related to question 24.
Question 21 is related to question 3.
Question 21 is related to question 6.
Question 21 is related to question 10.
Question 21 is related to question 19.
Question 21 is related to question 24.
Question 16 is related to question 5.
Question 16 is related to question 8.
Question 16 is related to question 9.
Question 16 is related to question 10.
Question 16 is related to question 22.
Question 16 is related to question 24.
Question 22 is related to question 10.
Question 10 is related to question 9.
Question 10 is related to question 18.
Question 11 is related to question 2.
Question 11 is related to question 8.
Question 11 is related to question 17.
Question 2 is related to question 4.
Question 2 is related to question 8.
Question 2 is related to question 17.
Question 24 is related to question 9.
Question 24 is related to question 17.
Question 24 is related to question 19.
Question 24 is related to question 25.
Question 3 is related to question 6.
Question 3 is related to question 7.
Question 4 is related to question 17.
Question 12 is related to question 13.
Question 12 is related to question 17.
Question 17 is related to question 13.
Question 17 is related to question 25.
Question 6 is related to question 18.
Question 7 is related to question 1.
Question 25 is related to question 19.
We must assign every question to exactly one booklet so we maximize how many of the 52 related pairs are separated.
If you'd like to give the layout in a neat machine-friendly way, you can use this simple JSON shape — nothing fancy, just two lists inside ""solution"":
{
""solution"": [
[""question_id"", ""question_id"", ...],
[""question_id"", ""question_id"", ...]
]
}
Think of it like a little form: the first inner list is the set of questions that go into the morning booklet, the second inner list is the afternoon booklet, and each entry is the identifier for a question. The ""question_id"" strings above are just placeholders showing the format — you'll replace them with the actual IDs from the instance.
This JSON is only a sketch of the expected shape, not the actual assignment.
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': 'MAXCUT', 'num_nodes': 25, 'num_edges': 52, 'edges': [{'u': 23, 'v': 7}, {'u': 23, 'v': 12}, {'u': 23, 'v': 13}, {'u': 23, 'v': 20}, {'u': 23, 'v': 25}, {'u': 14, 'v': 11}, {'u': 14, 'v': 16}, {'u': 14, 'v': 17}, {'u': 14, 'v': 24}, {'u': 20, 'v': 1}, {'u': 20, 'v': 3}, {'u': 20, 'v': 7}, {'u': 20, 'v': 19}, {'u': 20, 'v': 21}, {'u': 20, 'v': 25}, {'u': 15, 'v': 10}, {'u': 15, 'v': 21}, {'u': 15, 'v': 24}, {'u': 21, 'v': 3}, {'u': 21, 'v': 6}, {'u': 21, 'v': 10}, {'u': 21, 'v': 19}, {'u': 21, 'v': 24}, {'u': 16, 'v': 5}, {'u': 16, 'v': 8}, {'u': 16, 'v': 9}, {'u': 16, 'v': 10}, {'u': 16, 'v': 22}, {'u': 16, 'v': 24}, {'u': 22, 'v': 10}, {'u': 10, 'v': 9}, {'u': 10, 'v': 18}, {'u': 11, 'v': 2}, {'u': 11, 'v': 8}, {'u': 11, 'v': 17}, {'u': 2, 'v': 4}, {'u': 2, 'v': 8}, {'u': 2, 'v': 17}, {'u': 24, 'v': 9}, {'u': 24, 'v': 17}, {'u': 24, 'v': 19}, {'u': 24, 'v': 25}, {'u': 3, 'v': 6}, {'u': 3, 'v': 7}, {'u': 4, 'v': 17}, {'u': 12, 'v': 13}, {'u': 12, 'v': 17}, {'u': 17, 'v': 13}, {'u': 17, 'v': 25}, {'u': 6, 'v': 18}, {'u': 7, 'v': 1}, {'u': 25, 'v': 19}], 'source_file': 'vt2010.mtx', 'density': 0.17333333333333334, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0015.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0015.png', 'edge_connectivity': 1}","[[4, 6, 7, 10, 11, 12, 13, 16, 20, 24, 25], [1, 2, 3, 5, 8, 9, 14, 15, 17, 18, 19, 21, 22, 23]]",40.0,"{'num_nodes': 25, 'num_edges': 52, 'edges': [{'u': 23, 'v': 7}, {'u': 23, 'v': 12}, {'u': 23, 'v': 13}, {'u': 23, 'v': 20}, {'u': 23, 'v': 25}, {'u': 14, 'v': 11}, {'u': 14, 'v': 16}, {'u': 14, 'v': 17}, {'u': 14, 'v': 24}, {'u': 20, 'v': 1}, {'u': 20, 'v': 3}, {'u': 20, 'v': 7}, {'u': 20, 'v': 19}, {'u': 20, 'v': 21}, {'u': 20, 'v': 25}, {'u': 15, 'v': 10}, {'u': 15, 'v': 21}, {'u': 15, 'v': 24}, {'u': 21, 'v': 3}, {'u': 21, 'v': 6}, {'u': 21, 'v': 10}, {'u': 21, 'v': 19}, {'u': 21, 'v': 24}, {'u': 16, 'v': 5}, {'u': 16, 'v': 8}, {'u': 16, 'v': 9}, {'u': 16, 'v': 10}, {'u': 16, 'v': 22}, {'u': 16, 'v': 24}, {'u': 22, 'v': 10}, {'u': 10, 'v': 9}, {'u': 10, 'v': 18}, {'u': 11, 'v': 2}, {'u': 11, 'v': 8}, {'u': 11, 'v': 17}, {'u': 2, 'v': 4}, {'u': 2, 'v': 8}, {'u': 2, 'v': 17}, {'u': 24, 'v': 9}, {'u': 24, 'v': 17}, {'u': 24, 'v': 19}, {'u': 24, 'v': 25}, {'u': 3, 'v': 6}, {'u': 3, 'v': 7}, {'u': 4, 'v': 17}, {'u': 12, 'v': 13}, {'u': 12, 'v': 17}, {'u': 17, 'v': 13}, {'u': 17, 'v': 25}, {'u': 6, 'v': 18}, {'u': 7, 'v': 1}, {'u': 25, 'v': 19}]}","[[4, 6, 7, 10, 11, 12, 13, 16, 20, 24, 25], [1, 2, 3, 5, 8, 9, 14, 15, 17, 18, 19, 21, 22, 23]]",16,nl,1
MAXCUT,MAXCUT,"Recently the network team needed to divide client devices into VLAN A versus VLAN B so the network would have as many active peer links as possible running between the two VLANs. To evaluate any division, just count the active links that land on different VLANs; the division with the larger count is preferred. Be sure every device is assigned to one VLAN only; no device can be left out or duplicated. The full list of devices and links is shown below.
{
""total_devices"": 25,
""total_active_peer_links"": 50,
""edges"": [
{
""endpoint_device_u"": 13,
""endpoint_device_v"": 5
},
{
""endpoint_device_u"": 13,
""endpoint_device_v"": 6
},
{
""endpoint_device_u"": 13,
""endpoint_device_v"": 16
},
{
""endpoint_device_u"": 16,
""endpoint_device_v"": 6
},
{
""endpoint_device_u"": 16,
""endpoint_device_v"": 10
},
{
""endpoint_device_u"": 17,
""endpoint_device_v"": 4
},
{
""endpoint_device_u"": 17,
""endpoint_device_v"": 5
},
{
""endpoint_device_u"": 17,
""endpoint_device_v"": 6
},
{
""endpoint_device_u"": 17,
""endpoint_device_v"": 8
},
{
""endpoint_device_u"": 17,
""endpoint_device_v"": 12
},
{
""endpoint_device_u"": 17,
""endpoint_device_v"": 21
},
{
""endpoint_device_u"": 15,
""endpoint_device_v"": 2
},
{
""endpoint_device_u"": 15,
""endpoint_device_v"": 7
},
{
""endpoint_device_u"": 15,
""endpoint_device_v"": 10
},
{
""endpoint_device_u"": 15,
""endpoint_device_v"": 23
},
{
""endpoint_device_u"": 0,
""endpoint_device_v"": 9
},
{
""endpoint_device_u"": 0,
""endpoint_device_v"": 20
},
{
""endpoint_device_u"": 0,
""endpoint_device_v"": 24
},
{
""endpoint_device_u"": 11,
""endpoint_device_v"": 1
},
{
""endpoint_device_u"": 11,
""endpoint_device_v"": 7
},
{
""endpoint_device_u"": 11,
""endpoint_device_v"": 14
},
{
""endpoint_device_u"": 11,
""endpoint_device_v"": 18
},
{
""endpoint_device_u"": 11,
""endpoint_device_v"": 20
},
{
""endpoint_device_u"": 7,
""endpoint_device_v"": 2
},
{
""endpoint_device_u"": 7,
""endpoint_device_v"": 3
},
{
""endpoint_device_u"": 7,
""endpoint_device_v"": 6
},
{
""endpoint_device_u"": 7,
""endpoint_device_v"": 9
},
{
""endpoint_device_u"": 7,
""endpoint_device_v"": 14
},
{
""endpoint_device_u"": 7,
""endpoint_device_v"": 19
},
{
""endpoint_device_u"": 7,
""endpoint_device_v"": 20
},
{
""endpoint_device_u"": 7,
""endpoint_device_v"": 21
},
{
""endpoint_device_u"": 7,
""endpoint_device_v"": 22
},
{
""endpoint_device_u"": 5,
""endpoint_device_v"": 4
},
{
""endpoint_device_u"": 5,
""endpoint_device_v"": 12
},
{
""endpoint_device_u"": 1,
""endpoint_device_v"": 20
},
{
""endpoint_device_u"": 14,
""endpoint_device_v"": 18
},
{
""endpoint_device_u"": 14,
""endpoint_device_v"": 21
},
{
""endpoint_device_u"": 2,
""endpoint_device_v"": 19
},
{
""endpoint_device_u"": 6,
""endpoint_device_v"": 4
},
{
""endpoint_device_u"": 6,
""endpoint_device_v"": 10
},
{
""endpoint_device_u"": 6,
""endpoint_device_v"": 21
},
{
""endpoint_device_u"": 9,
""endpoint_device_v"": 19
},
{
""endpoint_device_u"": 9,
""endpoint_device_v"": 20
},
{
""endpoint_device_u"": 9,
""endpoint_device_v"": 24
},
{
""endpoint_device_u"": 18,
""endpoint_device_v"": 8
},
{
""endpoint_device_u"": 18,
""endpoint_device_v"": 12
},
{
""endpoint_device_u"": 18,
""endpoint_device_v"": 21
},
{
""endpoint_device_u"": 21,
""endpoint_device_v"": 8
},
{
""endpoint_device_u"": 21,
""endpoint_device_v"": 22
},
{
""endpoint_device_u"": 8,
""endpoint_device_v"": 12
}
]
}
If you want to send over a candidate division, just use this simple JSON shape — makes it easy for me to read and for whatever tooling you might have to pick up:
{
""solution"": [
[""device_id"", ""device_id"", ...],
[""device_id"", ""device_id"", ...]
]
}
Friendly note: the first list is the devices you want in VLAN A, the second list is the devices for VLAN B. Each ""device_id"" is a placeholder for one exact device identifier from the instance. This is just a sketch of the shape I expect, 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': 'MAXCUT', 'num_nodes': 25, 'num_edges': 50, 'edges': [{'u': 14, 'v': 6}, {'u': 14, 'v': 7}, {'u': 14, 'v': 17}, {'u': 17, 'v': 7}, {'u': 17, 'v': 11}, {'u': 18, 'v': 5}, {'u': 18, 'v': 6}, {'u': 18, 'v': 7}, {'u': 18, 'v': 9}, {'u': 18, 'v': 13}, {'u': 18, 'v': 22}, {'u': 16, 'v': 3}, {'u': 16, 'v': 8}, {'u': 16, 'v': 11}, {'u': 16, 'v': 24}, {'u': 1, 'v': 10}, {'u': 1, 'v': 21}, {'u': 1, 'v': 25}, {'u': 12, 'v': 2}, {'u': 12, 'v': 8}, {'u': 12, 'v': 15}, {'u': 12, 'v': 19}, {'u': 12, 'v': 21}, {'u': 8, 'v': 3}, {'u': 8, 'v': 4}, {'u': 8, 'v': 7}, {'u': 8, 'v': 10}, {'u': 8, 'v': 15}, {'u': 8, 'v': 20}, {'u': 8, 'v': 21}, {'u': 8, 'v': 22}, {'u': 8, 'v': 23}, {'u': 6, 'v': 5}, {'u': 6, 'v': 13}, {'u': 2, 'v': 21}, {'u': 15, 'v': 19}, {'u': 15, 'v': 22}, {'u': 3, 'v': 20}, {'u': 7, 'v': 5}, {'u': 7, 'v': 11}, {'u': 7, 'v': 22}, {'u': 10, 'v': 20}, {'u': 10, 'v': 21}, {'u': 10, 'v': 25}, {'u': 19, 'v': 9}, {'u': 19, 'v': 13}, {'u': 19, 'v': 22}, {'u': 22, 'v': 9}, {'u': 22, 'v': 23}, {'u': 9, 'v': 13}], 'source_file': 'wy2010.mtx', 'density': 0.16666666666666666, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0016.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0016.png', 'edge_connectivity': 1}","[[1, 3, 5, 8, 10, 11, 12, 13, 14, 22, 24], [2, 4, 6, 7, 9, 15, 16, 17, 18, 19, 20, 21, 23, 25]]",38.0,"{'num_nodes': 25, 'num_edges': 50, 'edges': [{'u': 13, 'v': 5}, {'u': 13, 'v': 6}, {'u': 13, 'v': 16}, {'u': 16, 'v': 6}, {'u': 16, 'v': 10}, {'u': 17, 'v': 4}, {'u': 17, 'v': 5}, {'u': 17, 'v': 6}, {'u': 17, 'v': 8}, {'u': 17, 'v': 12}, {'u': 17, 'v': 21}, {'u': 15, 'v': 2}, {'u': 15, 'v': 7}, {'u': 15, 'v': 10}, {'u': 15, 'v': 23}, {'u': 0, 'v': 9}, {'u': 0, 'v': 20}, {'u': 0, 'v': 24}, {'u': 11, 'v': 1}, {'u': 11, 'v': 7}, {'u': 11, 'v': 14}, {'u': 11, 'v': 18}, {'u': 11, 'v': 20}, {'u': 7, 'v': 2}, {'u': 7, 'v': 3}, {'u': 7, 'v': 6}, {'u': 7, 'v': 9}, {'u': 7, 'v': 14}, {'u': 7, 'v': 19}, {'u': 7, 'v': 20}, {'u': 7, 'v': 21}, {'u': 7, 'v': 22}, {'u': 5, 'v': 4}, {'u': 5, 'v': 12}, {'u': 1, 'v': 20}, {'u': 14, 'v': 18}, {'u': 14, 'v': 21}, {'u': 2, 'v': 19}, {'u': 6, 'v': 4}, {'u': 6, 'v': 10}, {'u': 6, 'v': 21}, {'u': 9, 'v': 19}, {'u': 9, 'v': 20}, {'u': 9, 'v': 24}, {'u': 18, 'v': 8}, {'u': 18, 'v': 12}, {'u': 18, 'v': 21}, {'u': 21, 'v': 8}, {'u': 21, 'v': 22}, {'u': 8, 'v': 12}]}","[[0, 2, 4, 7, 9, 10, 11, 12, 13, 21, 23], [1, 3, 5, 6, 8, 14, 15, 16, 17, 18, 19, 20, 22, 24]]",17,json,0
MAXCUT,MAXCUT,"There's a simple challenge at practice: divide the players into two groups — offense and defense — and choose where each person stands so as many passing relationships as possible end up bridging the two groups. Every player must belong to one side only and get a spot on the layout, and the way to tell which arrangement wins is to tally how many passes connect someone on one side with someone on the other. The full lineup and the passing relationships are shown below.
# total_players=23
# total_pass_relationships=40
player_a,player_b
4,2
4,19
23,2
23,6
23,18
1,2
18,2
18,6
19,2
20,2
20,10
12,2
12,6
12,16
16,2
15,2
15,3
15,22
7,13
17,2
17,8
17,22
10,2
10,21
11,2
11,9
11,14
5,2
5,6
5,14
6,2
6,13
21,2
21,9
22,2
22,3
9,2
13,2
14,2
2,3
Oh, and if you want to send the answer back in a compact machine-friendly way, a little JSON sketch like this works fine:
{
""solution"": [
[""player_id"", ""player_id"", ...],
[""player_id"", ""player_id"", ...]
]
}
The idea here is simple: the top array is one side (say offense), the bottom array is the other side (defense), and each string is a player identifier to place on that side. It's just a template for the shape I expect — not the actual assignment.
Please make sure to use the exact identifiers from the instance input — don't rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'MAXCUT', 'num_nodes': 23, 'num_edges': 40, 'edges': [{'u': 4, 'v': 2}, {'u': 4, 'v': 19}, {'u': 23, 'v': 2}, {'u': 23, 'v': 6}, {'u': 23, 'v': 18}, {'u': 1, 'v': 2}, {'u': 18, 'v': 2}, {'u': 18, 'v': 6}, {'u': 19, 'v': 2}, {'u': 20, 'v': 2}, {'u': 20, 'v': 10}, {'u': 12, 'v': 2}, {'u': 12, 'v': 6}, {'u': 12, 'v': 16}, {'u': 16, 'v': 2}, {'u': 15, 'v': 2}, {'u': 15, 'v': 3}, {'u': 15, 'v': 22}, {'u': 7, 'v': 13}, {'u': 17, 'v': 2}, {'u': 17, 'v': 8}, {'u': 17, 'v': 22}, {'u': 10, 'v': 2}, {'u': 10, 'v': 21}, {'u': 11, 'v': 2}, {'u': 11, 'v': 9}, {'u': 11, 'v': 14}, {'u': 5, 'v': 2}, {'u': 5, 'v': 6}, {'u': 5, 'v': 14}, {'u': 6, 'v': 2}, {'u': 6, 'v': 13}, {'u': 21, 'v': 2}, {'u': 21, 'v': 9}, {'u': 22, 'v': 2}, {'u': 22, 'v': 3}, {'u': 9, 'v': 2}, {'u': 13, 'v': 2}, {'u': 14, 'v': 2}, {'u': 2, 'v': 3}], 'source_file': 'vt2010.mtx', 'density': 0.15810276679841898, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0017.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0017.png', 'edge_connectivity': 1}","[[2, 6, 7, 8, 9, 10, 14, 16, 22], [1, 3, 4, 5, 11, 12, 13, 15, 17, 18, 19, 20, 21, 23]]",31.0,"{'num_nodes': 23, 'num_edges': 40, 'edges': [{'u': 4, 'v': 2}, {'u': 4, 'v': 19}, {'u': 23, 'v': 2}, {'u': 23, 'v': 6}, {'u': 23, 'v': 18}, {'u': 1, 'v': 2}, {'u': 18, 'v': 2}, {'u': 18, 'v': 6}, {'u': 19, 'v': 2}, {'u': 20, 'v': 2}, {'u': 20, 'v': 10}, {'u': 12, 'v': 2}, {'u': 12, 'v': 6}, {'u': 12, 'v': 16}, {'u': 16, 'v': 2}, {'u': 15, 'v': 2}, {'u': 15, 'v': 3}, {'u': 15, 'v': 22}, {'u': 7, 'v': 13}, {'u': 17, 'v': 2}, {'u': 17, 'v': 8}, {'u': 17, 'v': 22}, {'u': 10, 'v': 2}, {'u': 10, 'v': 21}, {'u': 11, 'v': 2}, {'u': 11, 'v': 9}, {'u': 11, 'v': 14}, {'u': 5, 'v': 2}, {'u': 5, 'v': 6}, {'u': 5, 'v': 14}, {'u': 6, 'v': 2}, {'u': 6, 'v': 13}, {'u': 21, 'v': 2}, {'u': 21, 'v': 9}, {'u': 22, 'v': 2}, {'u': 22, 'v': 3}, {'u': 9, 'v': 2}, {'u': 13, 'v': 2}, {'u': 14, 'v': 2}, {'u': 2, 'v': 3}]}","[[2, 6, 7, 8, 9, 10, 14, 16, 22], [1, 3, 4, 5, 11, 12, 13, 15, 17, 18, 19, 20, 21, 23]]",18,csv,1
MAXCUT,MAXCUT,"I was tidying up a mock social network in my head: every user needs to go on either the public roster or the private roster, and the fun part is trying to put people on opposite lists whenever they’re friends. The better the split, the more friendship pairs end up linking someone on public with someone on private — you just count how many friend connections cross between the two lists to see how well it worked. Every account has to be assigned to one of the two lists and can't be left out or duplicated. The exact list of accounts and who’s friends with whom is shown below.
There are 25 accounts in total and 54 friendships.
| account_a | account_b |
|---|---|
| 9 | 4 |
| 9 | 11 |
| 9 | 18 |
| 9 | 20 |
| 22 | 1 |
| 22 | 5 |
| 22 | 7 |
| 22 | 8 |
| 22 | 24 |
| 12 | 1 |
| 12 | 2 |
| 12 | 3 |
| 12 | 4 |
| 12 | 14 |
| 12 | 15 |
| 12 | 16 |
| 12 | 19 |
| 12 | 20 |
| 12 | 21 |
| 6 | 13 |
| 6 | 16 |
| 13 | 7 |
| 13 | 16 |
| 13 | 25 |
| 14 | 7 |
| 14 | 16 |
| 14 | 19 |
| 25 | 11 |
| 25 | 23 |
| 15 | 20 |
| 15 | 21 |
| 16 | 2 |
| 16 | 3 |
| 16 | 17 |
| 10 | 17 |
| 1 | 4 |
| 1 | 5 |
| 1 | 19 |
| 2 | 3 |
| 23 | 4 |
| 23 | 5 |
| 23 | 7 |
| 23 | 8 |
| 23 | 11 |
| 24 | 7 |
| 24 | 8 |
| 4 | 5 |
| 4 | 11 |
| 4 | 18 |
| 18 | 20 |
| 5 | 8 |
| 19 | 7 |
| 17 | 21 |
| 7 | 8 |
If you want to pass the split back in a neat format, here’s a little JSON sketch you can follow:
{
""solution"": [
[""user_id"", ""user_id"", ...],
[""user_id"", ""user_id"", ...]
]
}
Think of ""solution"" as the two rosters: the first inner list is everyone on the public roster, the second is everyone on the private roster. Each placeholder like ""user_id"" stands in for an account identifier — just list each account once, in whichever roster it belongs. This is just the shape I expect, not the actual answer.
Please use the identifiers exactly as they appear in the problem input — no renaming, no new labels. Valid identifiers look like plain numbers such as ""1"" or ""23"", single capital letters like ""A"" or ""B"", or a capital letter followed by digits like ""A1"" or ""X7"".","{'problem_type': 'MAXCUT', 'num_nodes': 25, 'num_edges': 54, 'edges': [{'u': 9, 'v': 4}, {'u': 9, 'v': 11}, {'u': 9, 'v': 18}, {'u': 9, 'v': 20}, {'u': 22, 'v': 1}, {'u': 22, 'v': 5}, {'u': 22, 'v': 7}, {'u': 22, 'v': 8}, {'u': 22, 'v': 24}, {'u': 12, 'v': 1}, {'u': 12, 'v': 2}, {'u': 12, 'v': 3}, {'u': 12, 'v': 4}, {'u': 12, 'v': 14}, {'u': 12, 'v': 15}, {'u': 12, 'v': 16}, {'u': 12, 'v': 19}, {'u': 12, 'v': 20}, {'u': 12, 'v': 21}, {'u': 6, 'v': 13}, {'u': 6, 'v': 16}, {'u': 13, 'v': 7}, {'u': 13, 'v': 16}, {'u': 13, 'v': 25}, {'u': 14, 'v': 7}, {'u': 14, 'v': 16}, {'u': 14, 'v': 19}, {'u': 25, 'v': 11}, {'u': 25, 'v': 23}, {'u': 15, 'v': 20}, {'u': 15, 'v': 21}, {'u': 16, 'v': 2}, {'u': 16, 'v': 3}, {'u': 16, 'v': 17}, {'u': 10, 'v': 17}, {'u': 1, 'v': 4}, {'u': 1, 'v': 5}, {'u': 1, 'v': 19}, {'u': 2, 'v': 3}, {'u': 23, 'v': 4}, {'u': 23, 'v': 5}, {'u': 23, 'v': 7}, {'u': 23, 'v': 8}, {'u': 23, 'v': 11}, {'u': 24, 'v': 7}, {'u': 24, 'v': 8}, {'u': 4, 'v': 5}, {'u': 4, 'v': 11}, {'u': 4, 'v': 18}, {'u': 18, 'v': 20}, {'u': 5, 'v': 8}, {'u': 19, 'v': 7}, {'u': 17, 'v': 21}, {'u': 7, 'v': 8}], 'source_file': 'wa2010.mtx', 'density': 0.18, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0018.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0018.png', 'edge_connectivity': 1}","[[2, 3, 4, 6, 8, 10, 11, 13, 14, 19, 20, 21, 22], [1, 5, 7, 9, 12, 15, 16, 17, 18, 23, 24, 25]]",39.0,"{'num_nodes': 25, 'num_edges': 54, 'edges': [{'u': 9, 'v': 4}, {'u': 9, 'v': 11}, {'u': 9, 'v': 18}, {'u': 9, 'v': 20}, {'u': 22, 'v': 1}, {'u': 22, 'v': 5}, {'u': 22, 'v': 7}, {'u': 22, 'v': 8}, {'u': 22, 'v': 24}, {'u': 12, 'v': 1}, {'u': 12, 'v': 2}, {'u': 12, 'v': 3}, {'u': 12, 'v': 4}, {'u': 12, 'v': 14}, {'u': 12, 'v': 15}, {'u': 12, 'v': 16}, {'u': 12, 'v': 19}, {'u': 12, 'v': 20}, {'u': 12, 'v': 21}, {'u': 6, 'v': 13}, {'u': 6, 'v': 16}, {'u': 13, 'v': 7}, {'u': 13, 'v': 16}, {'u': 13, 'v': 25}, {'u': 14, 'v': 7}, {'u': 14, 'v': 16}, {'u': 14, 'v': 19}, {'u': 25, 'v': 11}, {'u': 25, 'v': 23}, {'u': 15, 'v': 20}, {'u': 15, 'v': 21}, {'u': 16, 'v': 2}, {'u': 16, 'v': 3}, {'u': 16, 'v': 17}, {'u': 10, 'v': 17}, {'u': 1, 'v': 4}, {'u': 1, 'v': 5}, {'u': 1, 'v': 19}, {'u': 2, 'v': 3}, {'u': 23, 'v': 4}, {'u': 23, 'v': 5}, {'u': 23, 'v': 7}, {'u': 23, 'v': 8}, {'u': 23, 'v': 11}, {'u': 24, 'v': 7}, {'u': 24, 'v': 8}, {'u': 4, 'v': 5}, {'u': 4, 'v': 11}, {'u': 4, 'v': 18}, {'u': 18, 'v': 20}, {'u': 5, 'v': 8}, {'u': 19, 'v': 7}, {'u': 17, 'v': 21}, {'u': 7, 'v': 8}]}","[[2, 3, 4, 6, 8, 10, 11, 13, 14, 19, 20, 21, 22], [1, 5, 7, 9, 12, 15, 16, 17, 18, 23, 24, 25]]",19,markdown_table,1
MAXCUT,MAXCUT,"Someone set up two boxes — one labeled bedroom, one playroom — and dumped out a bunch of toys that are connected in pairs. The task is to pick which box each toy goes into so that most paired toys end up apart; you can compare arrangements by counting how many pairs are across the two boxes. Every toy has to go into one box only; nothing should be left out or copied. The exact toys and which ones are paired appear below.
{
""total_toys"": 22,
""total_pairs"": 40,
""edges"": [
{
""toy_one"": 13,
""toy_two"": 5
},
{
""toy_one"": 13,
""toy_two"": 8
},
{
""toy_one"": 13,
""toy_two"": 12
},
{
""toy_one"": 13,
""toy_two"": 17
},
{
""toy_one"": 13,
""toy_two"": 20
},
{
""toy_one"": 13,
""toy_two"": 21
},
{
""toy_one"": 14,
""toy_two"": 2
},
{
""toy_one"": 14,
""toy_two"": 6
},
{
""toy_one"": 14,
""toy_two"": 8
},
{
""toy_one"": 14,
""toy_two"": 22
},
{
""toy_one"": 18,
""toy_two"": 6
},
{
""toy_one"": 18,
""toy_two"": 11
},
{
""toy_one"": 19,
""toy_two"": 6
},
{
""toy_one"": 19,
""toy_two"": 8
},
{
""toy_one"": 19,
""toy_two"": 12
},
{
""toy_one"": 19,
""toy_two"": 20
},
{
""toy_one"": 6,
""toy_two"": 2
},
{
""toy_one"": 6,
""toy_two"": 12
},
{
""toy_one"": 15,
""toy_two"": 9
},
{
""toy_one"": 15,
""toy_two"": 12
},
{
""toy_one"": 1,
""toy_two"": 5
},
{
""toy_one"": 1,
""toy_two"": 9
},
{
""toy_one"": 1,
""toy_two"": 12
},
{
""toy_one"": 7,
""toy_two"": 11
},
{
""toy_one"": 7,
""toy_two"": 12
},
{
""toy_one"": 16,
""toy_two"": 5
},
{
""toy_one"": 16,
""toy_two"": 21
},
{
""toy_one"": 20,
""toy_two"": 3
},
{
""toy_one"": 20,
""toy_two"": 8
},
{
""toy_one"": 20,
""toy_two"": 12
},
{
""toy_one"": 8,
""toy_two"": 4
},
{
""toy_one"": 8,
""toy_two"": 17
},
{
""toy_one"": 21,
""toy_two"": 5
},
{
""toy_one"": 21,
""toy_two"": 17
},
{
""toy_one"": 22,
""toy_two"": 4
},
{
""toy_one"": 9,
""toy_two"": 5
},
{
""toy_one"": 10,
""toy_two"": 4
},
{
""toy_one"": 10,
""toy_two"": 17
},
{
""toy_one"": 11,
""toy_two"": 12
},
{
""toy_one"": 12,
""toy_two"": 5
}
]
}
You can give the final arrangement in a simple JSON shape like this — just two lists inside ""solution"", one for each box:
{
""solution"": [
[""toy_id"", ""toy_id"", ...],
[""toy_id"", ""toy_id"", ...]
]
}
Think of the first inner list as the toys that go in the bedroom box and the second inner list as the toys that go in the playroom box. This JSON is just a little template showing the shape I expect, not the actual placement — fill in the exact toy identifiers from the instance.
Please use the identifiers exactly as they appear in the instance input — do not rename them or invent new labels. Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.","{'problem_type': 'MAXCUT', 'num_nodes': 22, 'num_edges': 40, 'edges': [{'u': 13, 'v': 5}, {'u': 13, 'v': 8}, {'u': 13, 'v': 12}, {'u': 13, 'v': 17}, {'u': 13, 'v': 20}, {'u': 13, 'v': 21}, {'u': 14, 'v': 2}, {'u': 14, 'v': 6}, {'u': 14, 'v': 8}, {'u': 14, 'v': 22}, {'u': 18, 'v': 6}, {'u': 18, 'v': 11}, {'u': 19, 'v': 6}, {'u': 19, 'v': 8}, {'u': 19, 'v': 12}, {'u': 19, 'v': 20}, {'u': 6, 'v': 2}, {'u': 6, 'v': 12}, {'u': 15, 'v': 9}, {'u': 15, 'v': 12}, {'u': 1, 'v': 5}, {'u': 1, 'v': 9}, {'u': 1, 'v': 12}, {'u': 7, 'v': 11}, {'u': 7, 'v': 12}, {'u': 16, 'v': 5}, {'u': 16, 'v': 21}, {'u': 20, 'v': 3}, {'u': 20, 'v': 8}, {'u': 20, 'v': 12}, {'u': 8, 'v': 4}, {'u': 8, 'v': 17}, {'u': 21, 'v': 5}, {'u': 21, 'v': 17}, {'u': 22, 'v': 4}, {'u': 9, 'v': 5}, {'u': 10, 'v': 4}, {'u': 10, 'v': 17}, {'u': 11, 'v': 12}, {'u': 12, 'v': 5}], 'source_file': 'vt2010.mtx', 'density': 0.17316017316017315, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0019.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0019.png', 'edge_connectivity': 1}","[[1, 2, 5, 6, 7, 8, 10, 11, 15, 20, 21, 22], [3, 4, 9, 12, 13, 14, 16, 17, 18, 19]]",32.0,"{'num_nodes': 22, 'num_edges': 40, 'edges': [{'u': 13, 'v': 5}, {'u': 13, 'v': 8}, {'u': 13, 'v': 12}, {'u': 13, 'v': 17}, {'u': 13, 'v': 20}, {'u': 13, 'v': 21}, {'u': 14, 'v': 2}, {'u': 14, 'v': 6}, {'u': 14, 'v': 8}, {'u': 14, 'v': 22}, {'u': 18, 'v': 6}, {'u': 18, 'v': 11}, {'u': 19, 'v': 6}, {'u': 19, 'v': 8}, {'u': 19, 'v': 12}, {'u': 19, 'v': 20}, {'u': 6, 'v': 2}, {'u': 6, 'v': 12}, {'u': 15, 'v': 9}, {'u': 15, 'v': 12}, {'u': 1, 'v': 5}, {'u': 1, 'v': 9}, {'u': 1, 'v': 12}, {'u': 7, 'v': 11}, {'u': 7, 'v': 12}, {'u': 16, 'v': 5}, {'u': 16, 'v': 21}, {'u': 20, 'v': 3}, {'u': 20, 'v': 8}, {'u': 20, 'v': 12}, {'u': 8, 'v': 4}, {'u': 8, 'v': 17}, {'u': 21, 'v': 5}, {'u': 21, 'v': 17}, {'u': 22, 'v': 4}, {'u': 9, 'v': 5}, {'u': 10, 'v': 4}, {'u': 10, 'v': 17}, {'u': 11, 'v': 12}, {'u': 12, 'v': 5}]}","[[1, 2, 5, 6, 7, 8, 10, 11, 15, 20, 21, 22], [3, 4, 9, 12, 13, 14, 16, 17, 18, 19]]",20,json,1
MAXCUT,MAXCUT,"There's a little puzzle behind the counter: every product has to go either on the front shelf or the back shelf, only one spot per item. What makes one arrangement better than another is how many complementary product pairs end up divided between the two shelves—each pair that’s split counts as a win. So judging a setup is straightforward: tally up all the complementary pairs that end up with one on the front and one on the back, and more is better. The exact products and their complementary links will be shown below.
There are 20 products in total and 31 complementary pairs.
| product_a_id | product_b_id |
|---|---|
| 3 | 19 |
| 3 | 20 |
| 1 | 4 |
| 1 | 5 |
| 12 | 15 |
| 12 | 16 |
| 10 | 16 |
| 10 | 17 |
| 13 | 4 |
| 13 | 5 |
| 13 | 7 |
| 13 | 15 |
| 11 | 6 |
| 11 | 19 |
| 14 | 5 |
| 14 | 6 |
| 4 | 15 |
| 5 | 8 |
| 6 | 8 |
| 7 | 2 |
| 7 | 8 |
| 7 | 18 |
| 8 | 19 |
| 9 | 17 |
| 9 | 20 |
| 15 | 18 |
| 18 | 16 |
| 18 | 17 |
| 19 | 2 |
| 17 | 2 |
| 20 | 2 |
If you want to reply with a layout, a small JSON sketch like the one below is easiest to work with — nothing fancy, just two lists showing which products go on each shelf.
{
""solution"": [
[""product_id"", ""product_id"", ...],
[""product_id"", ""product_id"", ...]
]
}
Think of the first list as the front shelf and the second list as the back shelf — drop each product's id into one of the lists. This is just the shape I expect, not 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': 'MAXCUT', 'num_nodes': 20, 'num_edges': 31, 'edges': [{'u': 3, 'v': 19}, {'u': 3, 'v': 20}, {'u': 1, 'v': 4}, {'u': 1, 'v': 5}, {'u': 12, 'v': 15}, {'u': 12, 'v': 16}, {'u': 10, 'v': 16}, {'u': 10, 'v': 17}, {'u': 13, 'v': 4}, {'u': 13, 'v': 5}, {'u': 13, 'v': 7}, {'u': 13, 'v': 15}, {'u': 11, 'v': 6}, {'u': 11, 'v': 19}, {'u': 14, 'v': 5}, {'u': 14, 'v': 6}, {'u': 4, 'v': 15}, {'u': 5, 'v': 8}, {'u': 6, 'v': 8}, {'u': 7, 'v': 2}, {'u': 7, 'v': 8}, {'u': 7, 'v': 18}, {'u': 8, 'v': 19}, {'u': 9, 'v': 17}, {'u': 9, 'v': 20}, {'u': 15, 'v': 18}, {'u': 18, 'v': 16}, {'u': 18, 'v': 17}, {'u': 19, 'v': 2}, {'u': 17, 'v': 2}, {'u': 20, 'v': 2}], 'source_file': 'wa2010.mtx', 'density': 0.1631578947368421, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0020.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0020.png', 'edge_connectivity': 2}","[[4, 5, 6, 7, 15, 16, 17, 19, 20], [1, 2, 3, 8, 9, 10, 11, 12, 13, 14, 18]]",30.0,"{'num_nodes': 20, 'num_edges': 31, 'edges': [{'u': 3, 'v': 19}, {'u': 3, 'v': 20}, {'u': 1, 'v': 4}, {'u': 1, 'v': 5}, {'u': 12, 'v': 15}, {'u': 12, 'v': 16}, {'u': 10, 'v': 16}, {'u': 10, 'v': 17}, {'u': 13, 'v': 4}, {'u': 13, 'v': 5}, {'u': 13, 'v': 7}, {'u': 13, 'v': 15}, {'u': 11, 'v': 6}, {'u': 11, 'v': 19}, {'u': 14, 'v': 5}, {'u': 14, 'v': 6}, {'u': 4, 'v': 15}, {'u': 5, 'v': 8}, {'u': 6, 'v': 8}, {'u': 7, 'v': 2}, {'u': 7, 'v': 8}, {'u': 7, 'v': 18}, {'u': 8, 'v': 19}, {'u': 9, 'v': 17}, {'u': 9, 'v': 20}, {'u': 15, 'v': 18}, {'u': 18, 'v': 16}, {'u': 18, 'v': 17}, {'u': 19, 'v': 2}, {'u': 17, 'v': 2}, {'u': 20, 'v': 2}]}","[[4, 5, 6, 7, 15, 16, 17, 19, 20], [1, 2, 3, 8, 9, 10, 11, 12, 13, 14, 18]]",21,markdown_table,1
MAXCUT,MAXCUT,"Many people on the crew are sorting tracks into two playlists called Alpha and Beta, and the rule is each track goes to exactly one playlist — nothing’s left out or repeated. The point is to separate collaborators across the two lists as often as possible; measure how well that works by counting how many collaboration pairs are split between Alpha and Beta, with larger counts indicating a better arrangement. The detailed track and collaboration info is shown below.
There are 25 distinct tracks and 48 collaboration links.
Track 5 collaborates with track 4.
Track 5 collaborates with track 7.
Track 5 collaborates with track 13.
Track 5 collaborates with track 19.
Track 5 collaborates with track 23.
Track 6 collaborates with track 4.
Track 6 collaborates with track 8.
Track 6 collaborates with track 20.
Track 6 collaborates with track 23.
Track 7 collaborates with track 9.
Track 7 collaborates with track 11.
Track 7 collaborates with track 13.
Track 7 collaborates with track 16.
Track 7 collaborates with track 22.
Track 8 collaborates with track 3.
Track 8 collaborates with track 11.
Track 8 collaborates with track 12.
Track 8 collaborates with track 14.
Track 8 collaborates with track 16.
Track 8 collaborates with track 17.
Track 8 collaborates with track 20.
Track 8 collaborates with track 21.
Track 8 collaborates with track 25.
Track 20 collaborates with track 10.
Track 20 collaborates with track 15.
Track 20 collaborates with track 18.
Track 20 collaborates with track 21.
Track 21 collaborates with track 3.
Track 21 collaborates with track 17.
Track 21 collaborates with track 18.
Track 21 collaborates with track 22.
Track 21 collaborates with track 24.
Track 9 collaborates with track 11.
Track 9 collaborates with track 17.
Track 9 collaborates with track 22.
Track 10 collaborates with track 1.
Track 10 collaborates with track 15.
Track 10 collaborates with track 18.
Track 22 collaborates with track 2.
Track 22 collaborates with track 24.
Track 1 collaborates with track 4.
Track 1 collaborates with track 15.
Track 11 collaborates with track 16.
Track 11 collaborates with track 17.
Track 23 collaborates with track 13.
Track 23 collaborates with track 16.
Track 13 collaborates with track 16.
Track 2 collaborates with track 19.
The objective is to split as many of these 48 collaboration links across Playlists Alpha and Beta as possible.
If you want to return the final split, just drop it into this simple JSON layout so it's easy to parse:
{
""solution"": [
[""vertex_id"", ""vertex_id"", ...],
[""vertex_id"", ""vertex_id"", ...]
]
}
Think of the first inner list as the tracks that go into the Alpha playlist and the second inner list as the tracks that go into Beta — each track appears in exactly one of the two lists. This JSON is just a sketch of the shape I need, not the actual answer.
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': 'MAXCUT', 'num_nodes': 25, 'num_edges': 48, 'edges': [{'u': 5, 'v': 4}, {'u': 5, 'v': 7}, {'u': 5, 'v': 13}, {'u': 5, 'v': 19}, {'u': 5, 'v': 23}, {'u': 6, 'v': 4}, {'u': 6, 'v': 8}, {'u': 6, 'v': 20}, {'u': 6, 'v': 23}, {'u': 7, 'v': 9}, {'u': 7, 'v': 11}, {'u': 7, 'v': 13}, {'u': 7, 'v': 16}, {'u': 7, 'v': 22}, {'u': 8, 'v': 3}, {'u': 8, 'v': 11}, {'u': 8, 'v': 12}, {'u': 8, 'v': 14}, {'u': 8, 'v': 16}, {'u': 8, 'v': 17}, {'u': 8, 'v': 20}, {'u': 8, 'v': 21}, {'u': 8, 'v': 25}, {'u': 20, 'v': 10}, {'u': 20, 'v': 15}, {'u': 20, 'v': 18}, {'u': 20, 'v': 21}, {'u': 21, 'v': 3}, {'u': 21, 'v': 17}, {'u': 21, 'v': 18}, {'u': 21, 'v': 22}, {'u': 21, 'v': 24}, {'u': 9, 'v': 11}, {'u': 9, 'v': 17}, {'u': 9, 'v': 22}, {'u': 10, 'v': 1}, {'u': 10, 'v': 15}, {'u': 10, 'v': 18}, {'u': 22, 'v': 2}, {'u': 22, 'v': 24}, {'u': 1, 'v': 4}, {'u': 1, 'v': 15}, {'u': 11, 'v': 16}, {'u': 11, 'v': 17}, {'u': 23, 'v': 13}, {'u': 23, 'v': 16}, {'u': 13, 'v': 16}, {'u': 2, 'v': 19}], 'source_file': 'wv2010.mtx', 'density': 0.16, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0021.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0021.png', 'edge_connectivity': 1}","[[2, 4, 7, 8, 9, 10, 15, 19, 21, 23, 24], [1, 3, 5, 6, 11, 12, 13, 14, 16, 17, 18, 20, 22, 25]]",37.0,"{'num_nodes': 25, 'num_edges': 48, 'edges': [{'u': 5, 'v': 4}, {'u': 5, 'v': 7}, {'u': 5, 'v': 13}, {'u': 5, 'v': 19}, {'u': 5, 'v': 23}, {'u': 6, 'v': 4}, {'u': 6, 'v': 8}, {'u': 6, 'v': 20}, {'u': 6, 'v': 23}, {'u': 7, 'v': 9}, {'u': 7, 'v': 11}, {'u': 7, 'v': 13}, {'u': 7, 'v': 16}, {'u': 7, 'v': 22}, {'u': 8, 'v': 3}, {'u': 8, 'v': 11}, {'u': 8, 'v': 12}, {'u': 8, 'v': 14}, {'u': 8, 'v': 16}, {'u': 8, 'v': 17}, {'u': 8, 'v': 20}, {'u': 8, 'v': 21}, {'u': 8, 'v': 25}, {'u': 20, 'v': 10}, {'u': 20, 'v': 15}, {'u': 20, 'v': 18}, {'u': 20, 'v': 21}, {'u': 21, 'v': 3}, {'u': 21, 'v': 17}, {'u': 21, 'v': 18}, {'u': 21, 'v': 22}, {'u': 21, 'v': 24}, {'u': 9, 'v': 11}, {'u': 9, 'v': 17}, {'u': 9, 'v': 22}, {'u': 10, 'v': 1}, {'u': 10, 'v': 15}, {'u': 10, 'v': 18}, {'u': 22, 'v': 2}, {'u': 22, 'v': 24}, {'u': 1, 'v': 4}, {'u': 1, 'v': 15}, {'u': 11, 'v': 16}, {'u': 11, 'v': 17}, {'u': 23, 'v': 13}, {'u': 23, 'v': 16}, {'u': 13, 'v': 16}, {'u': 2, 'v': 19}]}","[[2, 4, 7, 8, 9, 10, 15, 19, 21, 23, 24], [1, 3, 5, 6, 11, 12, 13, 14, 16, 17, 18, 20, 22, 25]]",22,nl,1
MAXCUT,MAXCUT,"Recently the ops team wanted a quick way to separate machines into two camps: tag each server as Segment X or Segment Y, making sure each server has exactly one tag, and pick the tagging that makes the greatest number of links run from one camp to the other. A tagging wins when it produces more cross-camp connections; you can judge it by counting how many links connect different tags. The full list of servers and their links follows below.
# total_servers=23
# total_links=45
server_a,server_b
7,8
7,10
7,15
21,1
21,14
13,11
13,18
13,20
11,9
11,18
11,20
1,2
1,4
1,14
1,16
1,19
2,19
23,3
23,4
23,6
23,22
8,5
8,9
8,10
8,15
8,18
8,20
12,14
12,17
3,4
3,6
3,14
4,5
4,10
4,14
4,15
4,18
14,6
17,6
17,22
9,20
22,18
10,5
19,5
20,18
Also, if you want to hand me the tagging in a machine-friendly way, just follow this little JSON sketch for the shape of the reply:
{
""solution"": [
[""server_id"", ""server_id"", ...],
[""server_id"", ""server_id"", ...]
]
}
Think of it like a simple form: ""solution"" contains two lists — the first list is all the servers you tag as Segment X, the second list is all the servers you tag as Segment Y. Keep it light and just drop the server identifiers into the appropriate list. This JSON is only a sketch of the expected shape, not 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': 'MAXCUT', 'num_nodes': 23, 'num_edges': 45, 'edges': [{'u': 7, 'v': 8}, {'u': 7, 'v': 10}, {'u': 7, 'v': 15}, {'u': 21, 'v': 1}, {'u': 21, 'v': 14}, {'u': 13, 'v': 11}, {'u': 13, 'v': 18}, {'u': 13, 'v': 20}, {'u': 11, 'v': 9}, {'u': 11, 'v': 18}, {'u': 11, 'v': 20}, {'u': 1, 'v': 2}, {'u': 1, 'v': 4}, {'u': 1, 'v': 14}, {'u': 1, 'v': 16}, {'u': 1, 'v': 19}, {'u': 2, 'v': 19}, {'u': 23, 'v': 3}, {'u': 23, 'v': 4}, {'u': 23, 'v': 6}, {'u': 23, 'v': 22}, {'u': 8, 'v': 5}, {'u': 8, 'v': 9}, {'u': 8, 'v': 10}, {'u': 8, 'v': 15}, {'u': 8, 'v': 18}, {'u': 8, 'v': 20}, {'u': 12, 'v': 14}, {'u': 12, 'v': 17}, {'u': 3, 'v': 4}, {'u': 3, 'v': 6}, {'u': 3, 'v': 14}, {'u': 4, 'v': 5}, {'u': 4, 'v': 10}, {'u': 4, 'v': 14}, {'u': 4, 'v': 15}, {'u': 4, 'v': 18}, {'u': 14, 'v': 6}, {'u': 17, 'v': 6}, {'u': 17, 'v': 22}, {'u': 9, 'v': 20}, {'u': 22, 'v': 18}, {'u': 10, 'v': 5}, {'u': 19, 'v': 5}, {'u': 20, 'v': 18}], 'source_file': 'wv2010.mtx', 'density': 0.17786561264822134, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0022.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0022.png', 'edge_connectivity': 1}","[[3, 4, 6, 7, 8, 11, 12, 16, 19, 20, 21, 22], [1, 2, 5, 9, 10, 13, 14, 15, 17, 18, 23]]",36.0,"{'num_nodes': 23, 'num_edges': 45, 'edges': [{'u': 7, 'v': 8}, {'u': 7, 'v': 10}, {'u': 7, 'v': 15}, {'u': 21, 'v': 1}, {'u': 21, 'v': 14}, {'u': 13, 'v': 11}, {'u': 13, 'v': 18}, {'u': 13, 'v': 20}, {'u': 11, 'v': 9}, {'u': 11, 'v': 18}, {'u': 11, 'v': 20}, {'u': 1, 'v': 2}, {'u': 1, 'v': 4}, {'u': 1, 'v': 14}, {'u': 1, 'v': 16}, {'u': 1, 'v': 19}, {'u': 2, 'v': 19}, {'u': 23, 'v': 3}, {'u': 23, 'v': 4}, {'u': 23, 'v': 6}, {'u': 23, 'v': 22}, {'u': 8, 'v': 5}, {'u': 8, 'v': 9}, {'u': 8, 'v': 10}, {'u': 8, 'v': 15}, {'u': 8, 'v': 18}, {'u': 8, 'v': 20}, {'u': 12, 'v': 14}, {'u': 12, 'v': 17}, {'u': 3, 'v': 4}, {'u': 3, 'v': 6}, {'u': 3, 'v': 14}, {'u': 4, 'v': 5}, {'u': 4, 'v': 10}, {'u': 4, 'v': 14}, {'u': 4, 'v': 15}, {'u': 4, 'v': 18}, {'u': 14, 'v': 6}, {'u': 17, 'v': 6}, {'u': 17, 'v': 22}, {'u': 9, 'v': 20}, {'u': 22, 'v': 18}, {'u': 10, 'v': 5}, {'u': 19, 'v': 5}, {'u': 20, 'v': 18}]}","[[3, 4, 6, 7, 8, 11, 12, 16, 19, 20, 21, 22], [1, 2, 5, 9, 10, 13, 14, 15, 17, 18, 23]]",23,csv,1
MAXCUT,MAXCUT,"Recently the school tried a fun exercise: assign each student to either House Red or House Blue (no overlaps, nobody left unassigned) and set it up so as many friend pairs as possible end up on opposite sides. To evaluate any assignment, simply tally all friendships that connect a Red student with a Blue student — that tally tells you how well the split did. The exact list of students and who’s friends with whom appears below.
Here are the 23 students and the 50 friendship ties:
Student 7 and student 2 are friends.
Student 7 and student 8 are friends.
Student 7 and student 10 are friends.
Student 7 and student 16 are friends.
Student 10 and student 8 are friends.
Student 10 and student 12 are friends.
Student 10 and student 16 are friends.
Student 5 and student 3 are friends.
Student 5 and student 11 are friends.
Student 5 and student 15 are friends.
Student 11 and student 8 are friends.
Student 11 and student 15 are friends.
Student 17 and student 6 are friends.
Student 17 and student 8 are friends.
Student 17 and student 13 are friends.
Student 17 and student 15 are friends.
Student 23 and student 4 are friends.
Student 23 and student 9 are friends.
Student 23 and student 19 are friends.
Student 21 and student 1 are friends.
Student 21 and student 9 are friends.
Student 21 and student 15 are friends.
Student 2 and student 8 are friends.
Student 2 and student 16 are friends.
Student 2 and student 20 are friends.
Student 14 and student 1 are friends.
Student 14 and student 6 are friends.
Student 14 and student 15 are friends.
Student 20 and student 8 are friends.
Student 1 and student 9 are friends.
Student 1 and student 15 are friends.
Student 15 and student 4 are friends.
Student 15 and student 6 are friends.
Student 15 and student 8 are friends.
Student 9 and student 4 are friends.
Student 9 and student 8 are friends.
Student 9 and student 12 are friends.
Student 9 and student 19 are friends.
Student 18 and student 6 are friends.
Student 18 and student 22 are friends.
Student 4 and student 3 are friends.
Student 4 and student 8 are friends.
Student 4 and student 19 are friends.
Student 6 and student 8 are friends.
Student 6 and student 13 are friends.
Student 6 and student 22 are friends.
Student 13 and student 8 are friends.
Student 8 and student 3 are friends.
Student 8 and student 12 are friends.
Student 8 and student 22 are friends.
Use these 50 ties to tally cross-house friendships and score any split.
If you want to hand me a proposed split, just put it in this simple JSON shape:
{
""solution"": [
[""student_id"", ""student_id"", ...],
[""student_id"", ""student_id"", ...]
]
}
Pretty straightforward: ""solution"" holds two lists — the first list is everyone you put in House Red, the second list is everyone you put in House Blue. Each entry should be the exact student identifier from the instance (this is just the shape/example, 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': 'MAXCUT', 'num_nodes': 23, 'num_edges': 50, 'edges': [{'u': 7, 'v': 2}, {'u': 7, 'v': 8}, {'u': 7, 'v': 10}, {'u': 7, 'v': 16}, {'u': 10, 'v': 8}, {'u': 10, 'v': 12}, {'u': 10, 'v': 16}, {'u': 5, 'v': 3}, {'u': 5, 'v': 11}, {'u': 5, 'v': 15}, {'u': 11, 'v': 8}, {'u': 11, 'v': 15}, {'u': 17, 'v': 6}, {'u': 17, 'v': 8}, {'u': 17, 'v': 13}, {'u': 17, 'v': 15}, {'u': 23, 'v': 4}, {'u': 23, 'v': 9}, {'u': 23, 'v': 19}, {'u': 21, 'v': 1}, {'u': 21, 'v': 9}, {'u': 21, 'v': 15}, {'u': 2, 'v': 8}, {'u': 2, 'v': 16}, {'u': 2, 'v': 20}, {'u': 14, 'v': 1}, {'u': 14, 'v': 6}, {'u': 14, 'v': 15}, {'u': 20, 'v': 8}, {'u': 1, 'v': 9}, {'u': 1, 'v': 15}, {'u': 15, 'v': 4}, {'u': 15, 'v': 6}, {'u': 15, 'v': 8}, {'u': 9, 'v': 4}, {'u': 9, 'v': 8}, {'u': 9, 'v': 12}, {'u': 9, 'v': 19}, {'u': 18, 'v': 6}, {'u': 18, 'v': 22}, {'u': 4, 'v': 3}, {'u': 4, 'v': 8}, {'u': 4, 'v': 19}, {'u': 6, 'v': 8}, {'u': 6, 'v': 13}, {'u': 6, 'v': 22}, {'u': 13, 'v': 8}, {'u': 8, 'v': 3}, {'u': 8, 'v': 12}, {'u': 8, 'v': 22}], 'source_file': 'wa2010.mtx', 'density': 0.1976284584980237, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0023.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0023.png', 'edge_connectivity': 2}","[[3, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19, 20, 22], [1, 2, 4, 5, 6, 8, 10, 18, 21, 23]]",36.0,"{'num_nodes': 23, 'num_edges': 50, 'edges': [{'u': 7, 'v': 2}, {'u': 7, 'v': 8}, {'u': 7, 'v': 10}, {'u': 7, 'v': 16}, {'u': 10, 'v': 8}, {'u': 10, 'v': 12}, {'u': 10, 'v': 16}, {'u': 5, 'v': 3}, {'u': 5, 'v': 11}, {'u': 5, 'v': 15}, {'u': 11, 'v': 8}, {'u': 11, 'v': 15}, {'u': 17, 'v': 6}, {'u': 17, 'v': 8}, {'u': 17, 'v': 13}, {'u': 17, 'v': 15}, {'u': 23, 'v': 4}, {'u': 23, 'v': 9}, {'u': 23, 'v': 19}, {'u': 21, 'v': 1}, {'u': 21, 'v': 9}, {'u': 21, 'v': 15}, {'u': 2, 'v': 8}, {'u': 2, 'v': 16}, {'u': 2, 'v': 20}, {'u': 14, 'v': 1}, {'u': 14, 'v': 6}, {'u': 14, 'v': 15}, {'u': 20, 'v': 8}, {'u': 1, 'v': 9}, {'u': 1, 'v': 15}, {'u': 15, 'v': 4}, {'u': 15, 'v': 6}, {'u': 15, 'v': 8}, {'u': 9, 'v': 4}, {'u': 9, 'v': 8}, {'u': 9, 'v': 12}, {'u': 9, 'v': 19}, {'u': 18, 'v': 6}, {'u': 18, 'v': 22}, {'u': 4, 'v': 3}, {'u': 4, 'v': 8}, {'u': 4, 'v': 19}, {'u': 6, 'v': 8}, {'u': 6, 'v': 13}, {'u': 6, 'v': 22}, {'u': 13, 'v': 8}, {'u': 8, 'v': 3}, {'u': 8, 'v': 12}, {'u': 8, 'v': 22}]}","[[3, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19, 20, 22], [1, 2, 4, 5, 6, 8, 10, 18, 21, 23]]",24,nl,1
MAXCUT,MAXCUT,"I was helping the museum team figure out which pieces should go in Room North and which in Room South. Every exhibit has to sit in exactly one room — nothing can be left out or put in both — and the fun part is arranging them so the most thematic links run between the two rooms. To see which arrangement is better, just count how many pairs of exhibits that are connected by theme end up in different rooms; the higher that count, the better the layout. The concrete list of exhibits and their links is shown below.
I list the 22 exhibits and the 40 thematic connections below:
I note that 3 and 4 are thematically connected.
I note that 3 and 6 are thematically connected.
I note that 3 and 7 are thematically connected.
I note that 12 and 4 are thematically connected.
I note that 12 and 5 are thematically connected.
I note that 12 and 19 are thematically connected.
I note that 15 and 4 are thematically connected.
I note that 15 and 6 are thematically connected.
I note that 15 and 9 are thematically connected.
I note that 14 and 4 are thematically connected.
I note that 14 and 13 are thematically connected.
I note that 8 and 4 are thematically connected.
I note that 8 and 7 are thematically connected.
I note that 8 and 19 are thematically connected.
I note that 21 and 19 are thematically connected.
I note that 22 and 4 are thematically connected.
I note that 22 and 7 are thematically connected.
I note that 9 and 4 are thematically connected.
I note that 6 and 7 are thematically connected.
I note that 7 and 1 are thematically connected.
I note that 7 and 4 are thematically connected.
I note that 7 and 10 are thematically connected.
I note that 7 and 16 are thematically connected.
I note that 7 and 19 are thematically connected.
I note that 4 and 13 are thematically connected.
I note that 4 and 17 are thematically connected.
I note that 4 and 19 are thematically connected.
I note that 20 and 1 are thematically connected.
I note that 20 and 16 are thematically connected.
I note that 20 and 19 are thematically connected.
I note that 1 and 10 are thematically connected.
I note that 1 and 16 are thematically connected.
I note that 11 and 2 are thematically connected.
I note that 11 and 18 are thematically connected.
I note that 11 and 19 are thematically connected.
I note that 5 and 18 are thematically connected.
I note that 5 and 19 are thematically connected.
I note that 2 and 19 are thematically connected.
I note that 16 and 19 are thematically connected.
I note that 19 and 18 are thematically connected.
I hope this clear list of the 22 exhibits and 40 connections helps decide the Room North / Room South layout.
Oh, and if you want to reply with a layout, just put it in this simple JSON shape so it's easy to read:
{
""solution"": [
[""exhibit_id"", ""exhibit_id"", ...],
[""exhibit_id"", ""exhibit_id"", ...]
]
}
Here the first list is the exhibits that go in Room North and the second list is the exhibits that go in Room South — each entry is just the exhibit identifier from the instance. This is just a sketch of the shape I expect, not the actual answer.
Please use the exact identifiers from the instance input — no renaming and no new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.
(Also: I used the placeholder ""exhibit_id"" above to match the story, but in your real response use the identifiers exactly as they appear in the instance.)","{'problem_type': 'MAXCUT', 'num_nodes': 22, 'num_edges': 40, 'edges': [{'u': 3, 'v': 4}, {'u': 3, 'v': 6}, {'u': 3, 'v': 7}, {'u': 12, 'v': 4}, {'u': 12, 'v': 5}, {'u': 12, 'v': 19}, {'u': 15, 'v': 4}, {'u': 15, 'v': 6}, {'u': 15, 'v': 9}, {'u': 14, 'v': 4}, {'u': 14, 'v': 13}, {'u': 8, 'v': 4}, {'u': 8, 'v': 7}, {'u': 8, 'v': 19}, {'u': 21, 'v': 19}, {'u': 22, 'v': 4}, {'u': 22, 'v': 7}, {'u': 9, 'v': 4}, {'u': 6, 'v': 7}, {'u': 7, 'v': 1}, {'u': 7, 'v': 4}, {'u': 7, 'v': 10}, {'u': 7, 'v': 16}, {'u': 7, 'v': 19}, {'u': 4, 'v': 13}, {'u': 4, 'v': 17}, {'u': 4, 'v': 19}, {'u': 20, 'v': 1}, {'u': 20, 'v': 16}, {'u': 20, 'v': 19}, {'u': 1, 'v': 10}, {'u': 1, 'v': 16}, {'u': 11, 'v': 2}, {'u': 11, 'v': 18}, {'u': 11, 'v': 19}, {'u': 5, 'v': 18}, {'u': 5, 'v': 19}, {'u': 2, 'v': 19}, {'u': 16, 'v': 19}, {'u': 19, 'v': 18}], 'source_file': 'wy2010.mtx', 'density': 0.17316017316017315, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0024.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0024.png', 'edge_connectivity': 1}","[[2, 3, 6, 8, 9, 10, 12, 13, 14, 16, 17, 18, 20, 21, 22], [1, 4, 5, 7, 11, 15, 19]]",30.0,"{'num_nodes': 22, 'num_edges': 40, 'edges': [{'u': 3, 'v': 4}, {'u': 3, 'v': 6}, {'u': 3, 'v': 7}, {'u': 12, 'v': 4}, {'u': 12, 'v': 5}, {'u': 12, 'v': 19}, {'u': 15, 'v': 4}, {'u': 15, 'v': 6}, {'u': 15, 'v': 9}, {'u': 14, 'v': 4}, {'u': 14, 'v': 13}, {'u': 8, 'v': 4}, {'u': 8, 'v': 7}, {'u': 8, 'v': 19}, {'u': 21, 'v': 19}, {'u': 22, 'v': 4}, {'u': 22, 'v': 7}, {'u': 9, 'v': 4}, {'u': 6, 'v': 7}, {'u': 7, 'v': 1}, {'u': 7, 'v': 4}, {'u': 7, 'v': 10}, {'u': 7, 'v': 16}, {'u': 7, 'v': 19}, {'u': 4, 'v': 13}, {'u': 4, 'v': 17}, {'u': 4, 'v': 19}, {'u': 20, 'v': 1}, {'u': 20, 'v': 16}, {'u': 20, 'v': 19}, {'u': 1, 'v': 10}, {'u': 1, 'v': 16}, {'u': 11, 'v': 2}, {'u': 11, 'v': 18}, {'u': 11, 'v': 19}, {'u': 5, 'v': 18}, {'u': 5, 'v': 19}, {'u': 2, 'v': 19}, {'u': 16, 'v': 19}, {'u': 19, 'v': 18}]}","[[2, 3, 6, 8, 9, 10, 12, 13, 14, 16, 17, 18, 20, 21, 22], [1, 4, 5, 7, 11, 15, 19]]",25,nl,1
MAXCUT,MAXCUT,"We set up two rectangular beds and a stack of plant labels: every species gets assigned to either Bed A or Bed B. The decision is which bed each label goes on, and the “better” layouts are the ones where as many interacting species as possible are separated between the two beds. To see how well a placement does, count how many interacting pairs fall into different beds — that’s the number to maximize. No species is skipped or placed in both beds; each one belongs to a single bed. The concrete planting details are given below.
{
""total_species"": 25,
""total_interacting_pairs"": 40,
""edges"": [
{
""species_u_id"": 22,
""species_v_id"": 23
},
{
""species_u_id"": 15,
""species_v_id"": 2
},
{
""species_u_id"": 3,
""species_v_id"": 1
},
{
""species_u_id"": 3,
""species_v_id"": 2
},
{
""species_u_id"": 3,
""species_v_id"": 6
},
{
""species_u_id"": 3,
""species_v_id"": 7
},
{
""species_u_id"": 3,
""species_v_id"": 8
},
{
""species_u_id"": 4,
""species_v_id"": 2
},
{
""species_u_id"": 4,
""species_v_id"": 16
},
{
""species_u_id"": 17,
""species_v_id"": 18
},
{
""species_u_id"": 17,
""species_v_id"": 24
},
{
""species_u_id"": 23,
""species_v_id"": 2
},
{
""species_u_id"": 23,
""species_v_id"": 18
},
{
""species_u_id"": 23,
""species_v_id"": 24
},
{
""species_u_id"": 23,
""species_v_id"": 25
},
{
""species_u_id"": 21,
""species_v_id"": 7
},
{
""species_u_id"": 21,
""species_v_id"": 19
},
{
""species_u_id"": 21,
""species_v_id"": 20
},
{
""species_u_id"": 8,
""species_v_id"": 2
},
{
""species_u_id"": 8,
""species_v_id"": 6
},
{
""species_u_id"": 8,
""species_v_id"": 11
},
{
""species_u_id"": 9,
""species_v_id"": 2
},
{
""species_u_id"": 10,
""species_v_id"": 2
},
{
""species_u_id"": 10,
""species_v_id"": 14
},
{
""species_u_id"": 11,
""species_v_id"": 5
},
{
""species_u_id"": 11,
""species_v_id"": 13
},
{
""species_u_id"": 5,
""species_v_id"": 2
},
{
""species_u_id"": 5,
""species_v_id"": 12
},
{
""species_u_id"": 5,
""species_v_id"": 25
},
{
""species_u_id"": 20,
""species_v_id"": 7
},
{
""species_u_id"": 24,
""species_v_id"": 25
},
{
""species_u_id"": 18,
""species_v_id"": 2
},
{
""species_u_id"": 18,
""species_v_id"": 19
},
{
""species_u_id"": 6,
""species_v_id"": 13
},
{
""species_u_id"": 7,
""species_v_id"": 1
},
{
""species_u_id"": 7,
""species_v_id"": 2
},
{
""species_u_id"": 7,
""species_v_id"": 19
},
{
""species_u_id"": 2,
""species_v_id"": 14
},
{
""species_u_id"": 2,
""species_v_id"": 16
},
{
""species_u_id"": 12,
""species_v_id"": 13
}
]
}
If you want the answer in a machine-friendly format, just put the two beds as two lists in a little JSON object like this — nothing fancy, just a sketch of the shape I expect:
{
""solution"": [
[""plant_id"", ""plant_id"", ...],
[""plant_id"", ""plant_id"", ...]
]
}
Think of the first inner list as the labels that go in Bed A and the second inner list as the labels that go in Bed B. Each entry is a plant label (use the exact label text from the instance), and the ""..."" just means you can list as many as you need. This is just the expected shape — not the actual planting plan.
Please use the identifiers exactly as they appear in the instance input — do not rename them or invent new ones.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”. ""","{'problem_type': 'MAXCUT', 'num_nodes': 25, 'num_edges': 40, 'edges': [{'u': 22, 'v': 23}, {'u': 15, 'v': 2}, {'u': 3, 'v': 1}, {'u': 3, 'v': 2}, {'u': 3, 'v': 6}, {'u': 3, 'v': 7}, {'u': 3, 'v': 8}, {'u': 4, 'v': 2}, {'u': 4, 'v': 16}, {'u': 17, 'v': 18}, {'u': 17, 'v': 24}, {'u': 23, 'v': 2}, {'u': 23, 'v': 18}, {'u': 23, 'v': 24}, {'u': 23, 'v': 25}, {'u': 21, 'v': 7}, {'u': 21, 'v': 19}, {'u': 21, 'v': 20}, {'u': 8, 'v': 2}, {'u': 8, 'v': 6}, {'u': 8, 'v': 11}, {'u': 9, 'v': 2}, {'u': 10, 'v': 2}, {'u': 10, 'v': 14}, {'u': 11, 'v': 5}, {'u': 11, 'v': 13}, {'u': 5, 'v': 2}, {'u': 5, 'v': 12}, {'u': 5, 'v': 25}, {'u': 20, 'v': 7}, {'u': 24, 'v': 25}, {'u': 18, 'v': 2}, {'u': 18, 'v': 19}, {'u': 6, 'v': 13}, {'u': 7, 'v': 1}, {'u': 7, 'v': 2}, {'u': 7, 'v': 19}, {'u': 2, 'v': 14}, {'u': 2, 'v': 16}, {'u': 12, 'v': 13}], 'source_file': 'wa2010.mtx', 'density': 0.13333333333333333, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0025.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0025.png', 'edge_connectivity': 1}","[[1, 2, 6, 11, 12, 14, 16, 17, 19, 20, 22, 25], [3, 4, 5, 7, 8, 9, 10, 13, 15, 18, 21, 23, 24]]",33.0,"{'num_nodes': 25, 'num_edges': 40, 'edges': [{'u': 22, 'v': 23}, {'u': 15, 'v': 2}, {'u': 3, 'v': 1}, {'u': 3, 'v': 2}, {'u': 3, 'v': 6}, {'u': 3, 'v': 7}, {'u': 3, 'v': 8}, {'u': 4, 'v': 2}, {'u': 4, 'v': 16}, {'u': 17, 'v': 18}, {'u': 17, 'v': 24}, {'u': 23, 'v': 2}, {'u': 23, 'v': 18}, {'u': 23, 'v': 24}, {'u': 23, 'v': 25}, {'u': 21, 'v': 7}, {'u': 21, 'v': 19}, {'u': 21, 'v': 20}, {'u': 8, 'v': 2}, {'u': 8, 'v': 6}, {'u': 8, 'v': 11}, {'u': 9, 'v': 2}, {'u': 10, 'v': 2}, {'u': 10, 'v': 14}, {'u': 11, 'v': 5}, {'u': 11, 'v': 13}, {'u': 5, 'v': 2}, {'u': 5, 'v': 12}, {'u': 5, 'v': 25}, {'u': 20, 'v': 7}, {'u': 24, 'v': 25}, {'u': 18, 'v': 2}, {'u': 18, 'v': 19}, {'u': 6, 'v': 13}, {'u': 7, 'v': 1}, {'u': 7, 'v': 2}, {'u': 7, 'v': 19}, {'u': 2, 'v': 14}, {'u': 2, 'v': 16}, {'u': 12, 'v': 13}]}","[[1, 2, 6, 11, 12, 14, 16, 17, 19, 20, 22, 25], [3, 4, 5, 7, 8, 9, 10, 13, 15, 18, 21, 23, 24]]",26,json,1
MAXCUT,MAXCUT,"Many people on the team want to see a layout that highlights cross-section collaborations: assign every article to either Opinion or Features, but not both and not neither. What we’re aiming for is as many shared-author links as possible to land with one article in Opinion and the other in Features; to evaluate any assignment, go through each pair of articles that share an author and count it if they’re in opposite sections — the total number is the measure of success. The detailed article and contributor info comes next below.
{
""total_articles"": 25,
""total_shared_author_pairs"": 47,
""edges"": [
{
""article_a_id"": ""J"",
""article_b_id"": ""B""
},
{
""article_a_id"": ""J"",
""article_b_id"": ""G""
},
{
""article_a_id"": ""J"",
""article_b_id"": ""N""
},
{
""article_a_id"": ""J"",
""article_b_id"": ""U""
},
{
""article_a_id"": ""J"",
""article_b_id"": ""W""
},
{
""article_a_id"": ""J"",
""article_b_id"": ""X""
},
{
""article_a_id"": ""Y"",
""article_b_id"": ""D""
},
{
""article_a_id"": ""Y"",
""article_b_id"": ""F""
},
{
""article_a_id"": ""Y"",
""article_b_id"": ""K""
},
{
""article_a_id"": ""Y"",
""article_b_id"": ""P""
},
{
""article_a_id"": ""Y"",
""article_b_id"": ""V""
},
{
""article_a_id"": ""V"",
""article_b_id"": ""E""
},
{
""article_a_id"": ""L"",
""article_b_id"": ""B""
},
{
""article_a_id"": ""L"",
""article_b_id"": ""N""
},
{
""article_a_id"": ""L"",
""article_b_id"": ""W""
},
{
""article_a_id"": ""K"",
""article_b_id"": ""B""
},
{
""article_a_id"": ""K"",
""article_b_id"": ""Q""
},
{
""article_a_id"": ""K"",
""article_b_id"": ""S""
},
{
""article_a_id"": ""M"",
""article_b_id"": ""I""
},
{
""article_a_id"": ""M"",
""article_b_id"": ""T""
},
{
""article_a_id"": ""A"",
""article_b_id"": ""E""
},
{
""article_a_id"": ""A"",
""article_b_id"": ""P""
},
{
""article_a_id"": ""A"",
""article_b_id"": ""R""
},
{
""article_a_id"": ""T"",
""article_b_id"": ""H""
},
{
""article_a_id"": ""T"",
""article_b_id"": ""P""
},
{
""article_a_id"": ""T"",
""article_b_id"": ""Q""
},
{
""article_a_id"": ""T"",
""article_b_id"": ""R""
},
{
""article_a_id"": ""T"",
""article_b_id"": ""S""
},
{
""article_a_id"": ""O"",
""article_b_id"": ""B""
},
{
""article_a_id"": ""O"",
""article_b_id"": ""C""
},
{
""article_a_id"": ""O"",
""article_b_id"": ""S""
},
{
""article_a_id"": ""U"",
""article_b_id"": ""B""
},
{
""article_a_id"": ""U"",
""article_b_id"": ""C""
},
{
""article_a_id"": ""U"",
""article_b_id"": ""N""
},
{
""article_a_id"": ""R"",
""article_b_id"": ""H""
},
{
""article_a_id"": ""R"",
""article_b_id"": ""P""
},
{
""article_a_id"": ""S"",
""article_b_id"": ""B""
},
{
""article_a_id"": ""S"",
""article_b_id"": ""I""
},
{
""article_a_id"": ""B"",
""article_b_id"": ""D""
},
{
""article_a_id"": ""B"",
""article_b_id"": ""G""
},
{
""article_a_id"": ""B"",
""article_b_id"": ""N""
},
{
""article_a_id"": ""B"",
""article_b_id"": ""W""
},
{
""article_a_id"": ""D"",
""article_b_id"": ""F""
},
{
""article_a_id"": ""D"",
""article_b_id"": ""G""
},
{
""article_a_id"": ""D"",
""article_b_id"": ""X""
},
{
""article_a_id"": ""E"",
""article_b_id"": ""P""
},
{
""article_a_id"": ""P"",
""article_b_id"": ""Q""
}
]
}
Also, when you hand me the final split, please stick to this simple JSON layout:
{
""solution"": [
[""article_id"", ""article_id"", ...],
[""article_id"", ""article_id"", ...]
]
}
Think of it like a tiny form: the first list is the set of articles you want in Opinion, the second list is the set you want in Features, and each quoted placeholder is where an article identifier goes. I used the placeholder article_id here to match the story (replace each with the actual article IDs). This is just the shape I need — not the real assignment 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': 'MAXCUT', 'num_nodes': 25, 'num_edges': 47, 'edges': [{'u': 10, 'v': 2}, {'u': 10, 'v': 7}, {'u': 10, 'v': 14}, {'u': 10, 'v': 21}, {'u': 10, 'v': 23}, {'u': 10, 'v': 24}, {'u': 25, 'v': 4}, {'u': 25, 'v': 6}, {'u': 25, 'v': 11}, {'u': 25, 'v': 16}, {'u': 25, 'v': 22}, {'u': 22, 'v': 5}, {'u': 12, 'v': 2}, {'u': 12, 'v': 14}, {'u': 12, 'v': 23}, {'u': 11, 'v': 2}, {'u': 11, 'v': 17}, {'u': 11, 'v': 19}, {'u': 13, 'v': 9}, {'u': 13, 'v': 20}, {'u': 1, 'v': 5}, {'u': 1, 'v': 16}, {'u': 1, 'v': 18}, {'u': 20, 'v': 8}, {'u': 20, 'v': 16}, {'u': 20, 'v': 17}, {'u': 20, 'v': 18}, {'u': 20, 'v': 19}, {'u': 15, 'v': 2}, {'u': 15, 'v': 3}, {'u': 15, 'v': 19}, {'u': 21, 'v': 2}, {'u': 21, 'v': 3}, {'u': 21, 'v': 14}, {'u': 18, 'v': 8}, {'u': 18, 'v': 16}, {'u': 19, 'v': 2}, {'u': 19, 'v': 9}, {'u': 2, 'v': 4}, {'u': 2, 'v': 7}, {'u': 2, 'v': 14}, {'u': 2, 'v': 23}, {'u': 4, 'v': 6}, {'u': 4, 'v': 7}, {'u': 4, 'v': 24}, {'u': 5, 'v': 16}, {'u': 16, 'v': 17}], 'source_file': 'vt2010.mtx', 'density': 0.15666666666666668, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0026.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0026.png', 'edge_connectivity': 2}","[[2, 3, 5, 6, 7, 13, 14, 17, 18, 19, 23, 24, 25], [1, 4, 8, 9, 10, 11, 12, 15, 16, 20, 21, 22]]",38.0,"{'num_nodes': 25, 'num_edges': 47, 'edges': [{'u': 'J', 'v': 'B'}, {'u': 'J', 'v': 'G'}, {'u': 'J', 'v': 'N'}, {'u': 'J', 'v': 'U'}, {'u': 'J', 'v': 'W'}, {'u': 'J', 'v': 'X'}, {'u': 'Y', 'v': 'D'}, {'u': 'Y', 'v': 'F'}, {'u': 'Y', 'v': 'K'}, {'u': 'Y', 'v': 'P'}, {'u': 'Y', 'v': 'V'}, {'u': 'V', 'v': 'E'}, {'u': 'L', 'v': 'B'}, {'u': 'L', 'v': 'N'}, {'u': 'L', 'v': 'W'}, {'u': 'K', 'v': 'B'}, {'u': 'K', 'v': 'Q'}, {'u': 'K', 'v': 'S'}, {'u': 'M', 'v': 'I'}, {'u': 'M', 'v': 'T'}, {'u': 'A', 'v': 'E'}, {'u': 'A', 'v': 'P'}, {'u': 'A', 'v': 'R'}, {'u': 'T', 'v': 'H'}, {'u': 'T', 'v': 'P'}, {'u': 'T', 'v': 'Q'}, {'u': 'T', 'v': 'R'}, {'u': 'T', 'v': 'S'}, {'u': 'O', 'v': 'B'}, {'u': 'O', 'v': 'C'}, {'u': 'O', 'v': 'S'}, {'u': 'U', 'v': 'B'}, {'u': 'U', 'v': 'C'}, {'u': 'U', 'v': 'N'}, {'u': 'R', 'v': 'H'}, {'u': 'R', 'v': 'P'}, {'u': 'S', 'v': 'B'}, {'u': 'S', 'v': 'I'}, {'u': 'B', 'v': 'D'}, {'u': 'B', 'v': 'G'}, {'u': 'B', 'v': 'N'}, {'u': 'B', 'v': 'W'}, {'u': 'D', 'v': 'F'}, {'u': 'D', 'v': 'G'}, {'u': 'D', 'v': 'X'}, {'u': 'E', 'v': 'P'}, {'u': 'P', 'v': 'Q'}]}","[['B', 'C', 'E', 'F', 'G', 'M', 'N', 'Q', 'R', 'S', 'W', 'X', 'Y'], ['A', 'D', 'H', 'I', 'J', 'K', 'L', 'O', 'P', 'T', 'U', 'V']]",27,json,names
MAXCUT,MAXCUT,"At a meetup the organizer set up two sides, Alpha and Beta, and the task is to place every attendee into one of them so that as many acquaintance pairs as possible are separated. To evaluate any placement, go down the list of known pairs and count those where the two people are in different groups — that count tells how successful the split is. Everyone must be on one side only; no one gets left out or put in both. The detailed list of attendees and their acquaintances is shown below.
There are 23 num attendees in total and 49 num acquaintance pairs.
| attendee_u | attendee_v |
|---|---|
| L | E |
| L | F |
| L | K |
| L | Q |
| L | R |
| E | F |
| E | K |
| F | K |
| F | R |
| F | W |
| W | C |
| W | J |
| W | K |
| W | R |
| W | U |
| G | A |
| G | K |
| M | K |
| M | Q |
| N | O |
| N | S |
| N | T |
| N | V |
| O | A |
| O | D |
| O | K |
| O | S |
| V | K |
| V | S |
| V | T |
| P | A |
| P | K |
| H | A |
| H | D |
| H | K |
| Q | K |
| R | C |
| A | D |
| A | K |
| U | J |
| U | K |
| I | B |
| I | C |
| S | K |
| T | K |
| J | K |
| K | B |
| K | C |
| K | D |
If you want to send me a proposed split, just use this simple JSON layout so I can pick out who goes on each side:
{
""solution"": [
[""vertex_id"", ""vertex_id"", ...],
[""vertex_id"", ""vertex_id"", ...]
]
}
Think of that as two lists: the first inner list is everyone you put on Alpha, the second inner list is everyone you put on Beta. Each item is just the attendee identifier from the instance.
This is just a sketch of the shape I expect, not the actual answer — fill the lists with the real IDs from the instance when you reply.
Please make sure to use the identifiers exactly as they appear in the 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': 'MAXCUT', 'num_nodes': 23, 'num_edges': 49, 'edges': [{'u': 12, 'v': 5}, {'u': 12, 'v': 6}, {'u': 12, 'v': 11}, {'u': 12, 'v': 17}, {'u': 12, 'v': 18}, {'u': 5, 'v': 6}, {'u': 5, 'v': 11}, {'u': 6, 'v': 11}, {'u': 6, 'v': 18}, {'u': 6, 'v': 23}, {'u': 23, 'v': 3}, {'u': 23, 'v': 10}, {'u': 23, 'v': 11}, {'u': 23, 'v': 18}, {'u': 23, 'v': 21}, {'u': 7, 'v': 1}, {'u': 7, 'v': 11}, {'u': 13, 'v': 11}, {'u': 13, 'v': 17}, {'u': 14, 'v': 15}, {'u': 14, 'v': 19}, {'u': 14, 'v': 20}, {'u': 14, 'v': 22}, {'u': 15, 'v': 1}, {'u': 15, 'v': 4}, {'u': 15, 'v': 11}, {'u': 15, 'v': 19}, {'u': 22, 'v': 11}, {'u': 22, 'v': 19}, {'u': 22, 'v': 20}, {'u': 16, 'v': 1}, {'u': 16, 'v': 11}, {'u': 8, 'v': 1}, {'u': 8, 'v': 4}, {'u': 8, 'v': 11}, {'u': 17, 'v': 11}, {'u': 18, 'v': 3}, {'u': 1, 'v': 4}, {'u': 1, 'v': 11}, {'u': 21, 'v': 10}, {'u': 21, 'v': 11}, {'u': 9, 'v': 2}, {'u': 9, 'v': 3}, {'u': 19, 'v': 11}, {'u': 20, 'v': 11}, {'u': 10, 'v': 11}, {'u': 11, 'v': 2}, {'u': 11, 'v': 3}, {'u': 11, 'v': 4}], 'source_file': 'wy2010.mtx', 'density': 0.19367588932806323, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0027.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0027.png', 'edge_connectivity': 2}","[[1, 5, 9, 11, 14, 17, 18, 22, 23], [2, 3, 4, 6, 7, 8, 10, 12, 13, 15, 16, 19, 20, 21]]",37.0,"{'num_nodes': 23, 'num_edges': 49, 'edges': [{'u': 'L', 'v': 'E'}, {'u': 'L', 'v': 'F'}, {'u': 'L', 'v': 'K'}, {'u': 'L', 'v': 'Q'}, {'u': 'L', 'v': 'R'}, {'u': 'E', 'v': 'F'}, {'u': 'E', 'v': 'K'}, {'u': 'F', 'v': 'K'}, {'u': 'F', 'v': 'R'}, {'u': 'F', 'v': 'W'}, {'u': 'W', 'v': 'C'}, {'u': 'W', 'v': 'J'}, {'u': 'W', 'v': 'K'}, {'u': 'W', 'v': 'R'}, {'u': 'W', 'v': 'U'}, {'u': 'G', 'v': 'A'}, {'u': 'G', 'v': 'K'}, {'u': 'M', 'v': 'K'}, {'u': 'M', 'v': 'Q'}, {'u': 'N', 'v': 'O'}, {'u': 'N', 'v': 'S'}, {'u': 'N', 'v': 'T'}, {'u': 'N', 'v': 'V'}, {'u': 'O', 'v': 'A'}, {'u': 'O', 'v': 'D'}, {'u': 'O', 'v': 'K'}, {'u': 'O', 'v': 'S'}, {'u': 'V', 'v': 'K'}, {'u': 'V', 'v': 'S'}, {'u': 'V', 'v': 'T'}, {'u': 'P', 'v': 'A'}, {'u': 'P', 'v': 'K'}, {'u': 'H', 'v': 'A'}, {'u': 'H', 'v': 'D'}, {'u': 'H', 'v': 'K'}, {'u': 'Q', 'v': 'K'}, {'u': 'R', 'v': 'C'}, {'u': 'A', 'v': 'D'}, {'u': 'A', 'v': 'K'}, {'u': 'U', 'v': 'J'}, {'u': 'U', 'v': 'K'}, {'u': 'I', 'v': 'B'}, {'u': 'I', 'v': 'C'}, {'u': 'S', 'v': 'K'}, {'u': 'T', 'v': 'K'}, {'u': 'J', 'v': 'K'}, {'u': 'K', 'v': 'B'}, {'u': 'K', 'v': 'C'}, {'u': 'K', 'v': 'D'}]}","[['A', 'E', 'I', 'K', 'N', 'Q', 'R', 'V', 'W'], ['B', 'C', 'D', 'F', 'G', 'H', 'J', 'L', 'M', 'O', 'P', 'S', 'T', 'U']]",28,markdown_table,names
MAXCUT,MAXCUT,"I’m coaching a session where the plan is to split the roster into Squad A and Squad B. The trick is to put every player on one and only one squad, then try to arrange the teams so that as many regular passing pairs as possible end up on opposite squads. To see how well a split works, just count each passing partnership that ends up split between the two squads — the bigger that count, the better the lineup. The exact list of players and who usually passes to whom is shown below.
There are 20 players in total and 44 passing partnerships.
| player_one_id | player_two_id |
|---|---|
| 8 | 6 |
| 8 | 11 |
| 8 | 12 |
| 8 | 13 |
| 11 | 0 |
| 11 | 2 |
| 11 | 4 |
| 11 | 6 |
| 11 | 7 |
| 11 | 9 |
| 11 | 19 |
| 18 | 0 |
| 18 | 3 |
| 18 | 6 |
| 19 | 6 |
| 19 | 9 |
| 1 | 0 |
| 1 | 7 |
| 5 | 6 |
| 5 | 9 |
| 5 | 10 |
| 5 | 14 |
| 0 | 2 |
| 0 | 6 |
| 0 | 13 |
| 0 | 15 |
| 16 | 3 |
| 16 | 6 |
| 16 | 10 |
| 16 | 14 |
| 3 | 6 |
| 3 | 14 |
| 3 | 17 |
| 9 | 4 |
| 9 | 6 |
| 2 | 7 |
| 4 | 7 |
| 15 | 7 |
| 6 | 10 |
| 6 | 12 |
| 6 | 13 |
| 6 | 17 |
| 14 | 10 |
| 12 | 13 |
If you want to propose a split, just send it in this simple JSON shape so I can read it easily.
{
""solution"": [
[""player_id"", ""player_id"", ...],
[""player_id"", ""player_id"", ...]
]
}
Pretty straightforward: ""solution"" holds two lists — the first list is Squad A, the second is Squad B — and each entry is a player identifier from the instance. This is just a sketch of the expected shape, not the actual lineup.
Please make sure you 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': 'MAXCUT', 'num_nodes': 20, 'num_edges': 44, 'edges': [{'u': 9, 'v': 7}, {'u': 9, 'v': 12}, {'u': 9, 'v': 13}, {'u': 9, 'v': 14}, {'u': 12, 'v': 1}, {'u': 12, 'v': 3}, {'u': 12, 'v': 5}, {'u': 12, 'v': 7}, {'u': 12, 'v': 8}, {'u': 12, 'v': 10}, {'u': 12, 'v': 20}, {'u': 19, 'v': 1}, {'u': 19, 'v': 4}, {'u': 19, 'v': 7}, {'u': 20, 'v': 7}, {'u': 20, 'v': 10}, {'u': 2, 'v': 1}, {'u': 2, 'v': 8}, {'u': 6, 'v': 7}, {'u': 6, 'v': 10}, {'u': 6, 'v': 11}, {'u': 6, 'v': 15}, {'u': 1, 'v': 3}, {'u': 1, 'v': 7}, {'u': 1, 'v': 14}, {'u': 1, 'v': 16}, {'u': 17, 'v': 4}, {'u': 17, 'v': 7}, {'u': 17, 'v': 11}, {'u': 17, 'v': 15}, {'u': 4, 'v': 7}, {'u': 4, 'v': 15}, {'u': 4, 'v': 18}, {'u': 10, 'v': 5}, {'u': 10, 'v': 7}, {'u': 3, 'v': 8}, {'u': 5, 'v': 8}, {'u': 16, 'v': 8}, {'u': 7, 'v': 11}, {'u': 7, 'v': 13}, {'u': 7, 'v': 14}, {'u': 7, 'v': 18}, {'u': 15, 'v': 11}, {'u': 13, 'v': 14}], 'source_file': 'wy2010.mtx', 'density': 0.23157894736842105, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0028.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0028.png', 'edge_connectivity': 2}","[[2, 3, 5, 6, 11, 12, 13, 14, 16, 17, 18, 19, 20], [1, 4, 7, 8, 9, 10, 15]]",33.0,"{'num_nodes': 20, 'num_edges': 44, 'edges': [{'u': 8, 'v': 6}, {'u': 8, 'v': 11}, {'u': 8, 'v': 12}, {'u': 8, 'v': 13}, {'u': 11, 'v': 0}, {'u': 11, 'v': 2}, {'u': 11, 'v': 4}, {'u': 11, 'v': 6}, {'u': 11, 'v': 7}, {'u': 11, 'v': 9}, {'u': 11, 'v': 19}, {'u': 18, 'v': 0}, {'u': 18, 'v': 3}, {'u': 18, 'v': 6}, {'u': 19, 'v': 6}, {'u': 19, 'v': 9}, {'u': 1, 'v': 0}, {'u': 1, 'v': 7}, {'u': 5, 'v': 6}, {'u': 5, 'v': 9}, {'u': 5, 'v': 10}, {'u': 5, 'v': 14}, {'u': 0, 'v': 2}, {'u': 0, 'v': 6}, {'u': 0, 'v': 13}, {'u': 0, 'v': 15}, {'u': 16, 'v': 3}, {'u': 16, 'v': 6}, {'u': 16, 'v': 10}, {'u': 16, 'v': 14}, {'u': 3, 'v': 6}, {'u': 3, 'v': 14}, {'u': 3, 'v': 17}, {'u': 9, 'v': 4}, {'u': 9, 'v': 6}, {'u': 2, 'v': 7}, {'u': 4, 'v': 7}, {'u': 15, 'v': 7}, {'u': 6, 'v': 10}, {'u': 6, 'v': 12}, {'u': 6, 'v': 13}, {'u': 6, 'v': 17}, {'u': 14, 'v': 10}, {'u': 12, 'v': 13}]}","[[1, 2, 4, 5, 10, 11, 12, 13, 15, 16, 17, 18, 19], [0, 3, 6, 7, 8, 9, 14]]",29,markdown_table,0
MAXCUT,MAXCUT,"Someone in town suggested a quirky challenge: every block must be given a single color, green or yellow, and then tally up every street that runs between a green and a yellow block. You can’t leave any block without a color or color it twice, and the goal is to end up with the largest possible number of those cross-color streets. The concrete block map and connections are shown below.
{
""total_blocks"": 24,
""total_street_links"": 54,
""edges"": [
{
""block_u_id"": 13,
""block_v_id"": 3
},
{
""block_u_id"": 13,
""block_v_id"": 11
},
{
""block_u_id"": 13,
""block_v_id"": 17
},
{
""block_u_id"": 13,
""block_v_id"": 18
},
{
""block_u_id"": 15,
""block_v_id"": 1
},
{
""block_u_id"": 15,
""block_v_id"": 11
},
{
""block_u_id"": 15,
""block_v_id"": 14
},
{
""block_u_id"": 15,
""block_v_id"": 16
},
{
""block_u_id"": 15,
""block_v_id"": 24
},
{
""block_u_id"": 16,
""block_v_id"": 1
},
{
""block_u_id"": 16,
""block_v_id"": 11
},
{
""block_u_id"": 16,
""block_v_id"": 19
},
{
""block_u_id"": 14,
""block_v_id"": 5
},
{
""block_u_id"": 14,
""block_v_id"": 11
},
{
""block_u_id"": 14,
""block_v_id"": 24
},
{
""block_u_id"": 18,
""block_v_id"": 3
},
{
""block_u_id"": 18,
""block_v_id"": 6
},
{
""block_u_id"": 18,
""block_v_id"": 17
},
{
""block_u_id"": 19,
""block_v_id"": 1
},
{
""block_u_id"": 19,
""block_v_id"": 11
},
{
""block_u_id"": 19,
""block_v_id"": 20
},
{
""block_u_id"": 23,
""block_v_id"": 8
},
{
""block_u_id"": 23,
""block_v_id"": 10
},
{
""block_u_id"": 24,
""block_v_id"": 2
},
{
""block_u_id"": 24,
""block_v_id"": 5
},
{
""block_u_id"": 24,
""block_v_id"": 7
},
{
""block_u_id"": 24,
""block_v_id"": 8
},
{
""block_u_id"": 24,
""block_v_id"": 9
},
{
""block_u_id"": 24,
""block_v_id"": 12
},
{
""block_u_id"": 8,
""block_v_id"": 1
},
{
""block_u_id"": 8,
""block_v_id"": 2
},
{
""block_u_id"": 8,
""block_v_id"": 4
},
{
""block_u_id"": 8,
""block_v_id"": 20
},
{
""block_u_id"": 17,
""block_v_id"": 6
},
{
""block_u_id"": 17,
""block_v_id"": 11
},
{
""block_u_id"": 3,
""block_v_id"": 5
},
{
""block_u_id"": 3,
""block_v_id"": 6
},
{
""block_u_id"": 3,
""block_v_id"": 11
},
{
""block_u_id"": 3,
""block_v_id"": 12
},
{
""block_u_id"": 12,
""block_v_id"": 5
},
{
""block_u_id"": 12,
""block_v_id"": 6
},
{
""block_u_id"": 12,
""block_v_id"": 7
},
{
""block_u_id"": 2,
""block_v_id"": 9
},
{
""block_u_id"": 5,
""block_v_id"": 11
},
{
""block_u_id"": 6,
""block_v_id"": 7
},
{
""block_u_id"": 6,
""block_v_id"": 9
},
{
""block_u_id"": 6,
""block_v_id"": 21
},
{
""block_u_id"": 6,
""block_v_id"": 22
},
{
""block_u_id"": 4,
""block_v_id"": 9
},
{
""block_u_id"": 4,
""block_v_id"": 10
},
{
""block_u_id"": 9,
""block_v_id"": 22
},
{
""block_u_id"": 10,
""block_v_id"": 21
},
{
""block_u_id"": 10,
""block_v_id"": 22
},
{
""block_u_id"": 22,
""block_v_id"": 21
}
]
}
If you'd like to hand in a coloring, just pop it into a tiny JSON snippet like this:
{
""solution"": [
[""block_id"", ""block_id"", ...],
[""block_id"", ""block_id"", ...]
]
}
Think of the two inner lists as the two color groups — the first list might be all the green blocks, the second all the yellow ones. Each entry is a block identifier from the map. This is just a sketch of the shape I expect, not your actual answer.
Please make sure to use the exact identifiers shown 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': 'MAXCUT', 'num_nodes': 24, 'num_edges': 54, 'edges': [{'u': 13, 'v': 3}, {'u': 13, 'v': 11}, {'u': 13, 'v': 17}, {'u': 13, 'v': 18}, {'u': 15, 'v': 1}, {'u': 15, 'v': 11}, {'u': 15, 'v': 14}, {'u': 15, 'v': 16}, {'u': 15, 'v': 24}, {'u': 16, 'v': 1}, {'u': 16, 'v': 11}, {'u': 16, 'v': 19}, {'u': 14, 'v': 5}, {'u': 14, 'v': 11}, {'u': 14, 'v': 24}, {'u': 18, 'v': 3}, {'u': 18, 'v': 6}, {'u': 18, 'v': 17}, {'u': 19, 'v': 1}, {'u': 19, 'v': 11}, {'u': 19, 'v': 20}, {'u': 23, 'v': 8}, {'u': 23, 'v': 10}, {'u': 24, 'v': 2}, {'u': 24, 'v': 5}, {'u': 24, 'v': 7}, {'u': 24, 'v': 8}, {'u': 24, 'v': 9}, {'u': 24, 'v': 12}, {'u': 8, 'v': 1}, {'u': 8, 'v': 2}, {'u': 8, 'v': 4}, {'u': 8, 'v': 20}, {'u': 17, 'v': 6}, {'u': 17, 'v': 11}, {'u': 3, 'v': 5}, {'u': 3, 'v': 6}, {'u': 3, 'v': 11}, {'u': 3, 'v': 12}, {'u': 12, 'v': 5}, {'u': 12, 'v': 6}, {'u': 12, 'v': 7}, {'u': 2, 'v': 9}, {'u': 5, 'v': 11}, {'u': 6, 'v': 7}, {'u': 6, 'v': 9}, {'u': 6, 'v': 21}, {'u': 6, 'v': 22}, {'u': 4, 'v': 9}, {'u': 4, 'v': 10}, {'u': 9, 'v': 22}, {'u': 10, 'v': 21}, {'u': 10, 'v': 22}, {'u': 22, 'v': 21}], 'source_file': 'wi2010.mtx', 'density': 0.1956521739130435, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0029.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0029.png', 'edge_connectivity': 2}","[[1, 2, 4, 6, 11, 12, 13, 14, 20, 22, 23, 24], [3, 5, 7, 8, 9, 10, 15, 16, 17, 18, 19, 21]]",41.0,"{'num_nodes': 24, 'num_edges': 54, 'edges': [{'u': 13, 'v': 3}, {'u': 13, 'v': 11}, {'u': 13, 'v': 17}, {'u': 13, 'v': 18}, {'u': 15, 'v': 1}, {'u': 15, 'v': 11}, {'u': 15, 'v': 14}, {'u': 15, 'v': 16}, {'u': 15, 'v': 24}, {'u': 16, 'v': 1}, {'u': 16, 'v': 11}, {'u': 16, 'v': 19}, {'u': 14, 'v': 5}, {'u': 14, 'v': 11}, {'u': 14, 'v': 24}, {'u': 18, 'v': 3}, {'u': 18, 'v': 6}, {'u': 18, 'v': 17}, {'u': 19, 'v': 1}, {'u': 19, 'v': 11}, {'u': 19, 'v': 20}, {'u': 23, 'v': 8}, {'u': 23, 'v': 10}, {'u': 24, 'v': 2}, {'u': 24, 'v': 5}, {'u': 24, 'v': 7}, {'u': 24, 'v': 8}, {'u': 24, 'v': 9}, {'u': 24, 'v': 12}, {'u': 8, 'v': 1}, {'u': 8, 'v': 2}, {'u': 8, 'v': 4}, {'u': 8, 'v': 20}, {'u': 17, 'v': 6}, {'u': 17, 'v': 11}, {'u': 3, 'v': 5}, {'u': 3, 'v': 6}, {'u': 3, 'v': 11}, {'u': 3, 'v': 12}, {'u': 12, 'v': 5}, {'u': 12, 'v': 6}, {'u': 12, 'v': 7}, {'u': 2, 'v': 9}, {'u': 5, 'v': 11}, {'u': 6, 'v': 7}, {'u': 6, 'v': 9}, {'u': 6, 'v': 21}, {'u': 6, 'v': 22}, {'u': 4, 'v': 9}, {'u': 4, 'v': 10}, {'u': 9, 'v': 22}, {'u': 10, 'v': 21}, {'u': 10, 'v': 22}, {'u': 22, 'v': 21}]}","[[1, 2, 4, 6, 11, 12, 13, 14, 20, 22, 23, 24], [3, 5, 7, 8, 9, 10, 15, 16, 17, 18, 19, 21]]",30,json,1
MAXCUT,MAXCUT,"We set up two stations for prepping and every single ingredient must be put at exactly one station, never at both and never skipped. The aim is to place them so that as many pairs of ingredients as possible end up separated — to measure that, go through all possible ingredient pairs and add one for each pair that sits at different stations; the higher the sum, the better the split. The concrete details of which ingredients and which pairs matter are shown below.
There are 20 ingredients and 36 relevant ingredient pairs listed below.
Ingredients 12 and 2 form a pair that contributes 1 if we place them at different stations.
Ingredients 12 and 4 form a pair that contributes 1 if we place them at different stations.
Ingredients 12 and 13 form a pair that contributes 1 if we place them at different stations.
Ingredients 12 and 14 form a pair that contributes 1 if we place them at different stations.
Ingredients 13 and 2 form a pair that contributes 1 if we place them at different stations.
Ingredients 13 and 14 form a pair that contributes 1 if we place them at different stations.
Ingredients 13 and 16 form a pair that contributes 1 if we place them at different stations.
Ingredients 7 and 1 form a pair that contributes 1 if we place them at different stations.
Ingredients 7 and 11 form a pair that contributes 1 if we place them at different stations.
Ingredients 7 and 19 form a pair that contributes 1 if we place them at different stations.
Ingredients 18 and 1 form a pair that contributes 1 if we place them at different stations.
Ingredients 18 and 6 form a pair that contributes 1 if we place them at different stations.
Ingredients 15 and 10 form a pair that contributes 1 if we place them at different stations.
Ingredients 15 and 19 form a pair that contributes 1 if we place them at different stations.
Ingredients 0 and 6 form a pair that contributes 1 if we place them at different stations.
Ingredients 19 and 10 form a pair that contributes 1 if we place them at different stations.
Ingredients 19 and 11 form a pair that contributes 1 if we place them at different stations.
Ingredients 11 and 2 form a pair that contributes 1 if we place them at different stations.
Ingredients 11 and 10 form a pair that contributes 1 if we place them at different stations.
Ingredients 11 and 14 form a pair that contributes 1 if we place them at different stations.
Ingredients 6 and 1 form a pair that contributes 1 if we place them at different stations.
Ingredients 6 and 3 form a pair that contributes 1 if we place them at different stations.
Ingredients 6 and 8 form a pair that contributes 1 if we place them at different stations.
Ingredients 6 and 14 form a pair that contributes 1 if we place them at different stations.
Ingredients 6 and 17 form a pair that contributes 1 if we place them at different stations.
Ingredients 14 and 1 form a pair that contributes 1 if we place them at different stations.
Ingredients 14 and 2 form a pair that contributes 1 if we place them at different stations.
Ingredients 14 and 4 form a pair that contributes 1 if we place them at different stations.
Ingredients 14 and 8 form a pair that contributes 1 if we place them at different stations.
Ingredients 14 and 16 form a pair that contributes 1 if we place them at different stations.
Ingredients 14 and 17 form a pair that contributes 1 if we place them at different stations.
Ingredients 3 and 8 form a pair that contributes 1 if we place them at different stations.
Ingredients 3 and 9 form a pair that contributes 1 if we place them at different stations.
Ingredients 1 and 5 form a pair that contributes 1 if we place them at different stations.
Ingredients 8 and 9 form a pair that contributes 1 if we place them at different stations.
Ingredients 8 and 10 form a pair that contributes 1 if we place them at different stations.
We will sum the contributions from the 36 listed pairs to obtain the final separation score.
When you send back the solution, stick it into a tiny JSON snippet so it's easy to read and parse. Here's the shape I expect:
{
""solution"": [
[""ingredient_id"", ""ingredient_id"", ...],
[""ingredient_id"", ""ingredient_id"", ...]
]
}
Think of the two inner lists as the two prep stations — just list which ingredient IDs go to station one and which go to station two. This is just a sketch of the expected shape, not the actual answer.
Please make sure to use the exact identifiers from the instance input — don't rename them and don't invent new labels.
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': 'MAXCUT', 'num_nodes': 20, 'num_edges': 36, 'edges': [{'u': 13, 'v': 3}, {'u': 13, 'v': 5}, {'u': 13, 'v': 14}, {'u': 13, 'v': 15}, {'u': 14, 'v': 3}, {'u': 14, 'v': 15}, {'u': 14, 'v': 17}, {'u': 8, 'v': 2}, {'u': 8, 'v': 12}, {'u': 8, 'v': 20}, {'u': 19, 'v': 2}, {'u': 19, 'v': 7}, {'u': 16, 'v': 11}, {'u': 16, 'v': 20}, {'u': 1, 'v': 7}, {'u': 20, 'v': 11}, {'u': 20, 'v': 12}, {'u': 12, 'v': 3}, {'u': 12, 'v': 11}, {'u': 12, 'v': 15}, {'u': 7, 'v': 2}, {'u': 7, 'v': 4}, {'u': 7, 'v': 9}, {'u': 7, 'v': 15}, {'u': 7, 'v': 18}, {'u': 15, 'v': 2}, {'u': 15, 'v': 3}, {'u': 15, 'v': 5}, {'u': 15, 'v': 9}, {'u': 15, 'v': 17}, {'u': 15, 'v': 18}, {'u': 4, 'v': 9}, {'u': 4, 'v': 10}, {'u': 2, 'v': 6}, {'u': 9, 'v': 10}, {'u': 9, 'v': 11}], 'source_file': 'wa2010.mtx', 'density': 0.18947368421052632, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0030.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0030.png', 'edge_connectivity': 1}","[[3, 6, 7, 8, 10, 11, 15, 19], [1, 2, 4, 5, 9, 12, 13, 14, 16, 17, 18, 20]]",27.0,"{'num_nodes': 20, 'num_edges': 36, 'edges': [{'u': 12, 'v': 2}, {'u': 12, 'v': 4}, {'u': 12, 'v': 13}, {'u': 12, 'v': 14}, {'u': 13, 'v': 2}, {'u': 13, 'v': 14}, {'u': 13, 'v': 16}, {'u': 7, 'v': 1}, {'u': 7, 'v': 11}, {'u': 7, 'v': 19}, {'u': 18, 'v': 1}, {'u': 18, 'v': 6}, {'u': 15, 'v': 10}, {'u': 15, 'v': 19}, {'u': 0, 'v': 6}, {'u': 19, 'v': 10}, {'u': 19, 'v': 11}, {'u': 11, 'v': 2}, {'u': 11, 'v': 10}, {'u': 11, 'v': 14}, {'u': 6, 'v': 1}, {'u': 6, 'v': 3}, {'u': 6, 'v': 8}, {'u': 6, 'v': 14}, {'u': 6, 'v': 17}, {'u': 14, 'v': 1}, {'u': 14, 'v': 2}, {'u': 14, 'v': 4}, {'u': 14, 'v': 8}, {'u': 14, 'v': 16}, {'u': 14, 'v': 17}, {'u': 3, 'v': 8}, {'u': 3, 'v': 9}, {'u': 1, 'v': 5}, {'u': 8, 'v': 9}, {'u': 8, 'v': 10}]}","[[2, 5, 6, 7, 9, 10, 14, 18], [0, 1, 3, 4, 8, 11, 12, 13, 15, 16, 17, 19]]",31,nl,0
MAXCUT,MAXCUT,"Recently the gallery decided to use only two walls — East and West — and every portrait must be assigned to one of them, with each portrait appearing on just a single wall and none repeated. The fun part is trying to separate collaborators: for every pair of photographers who worked together, see whether their portraits end up on opposite walls and count those instances; the arrangement with the largest count of separated pairs is the one that stands out. The full list of portraits and who collaborated with whom is shown below.
{
""total_portraits"": 24,
""total_collaboration_pairs"": 46,
""edges"": [
{
""portrait_a"": 24,
""portrait_b"": 11
},
{
""portrait_a"": 24,
""portrait_b"": 20
},
{
""portrait_a"": 3,
""portrait_b"": 7
},
{
""portrait_a"": 3,
""portrait_b"": 20
},
{
""portrait_a"": 1,
""portrait_b"": 2
},
{
""portrait_a"": 1,
""portrait_b"": 8
},
{
""portrait_a"": 1,
""portrait_b"": 9
},
{
""portrait_a"": 1,
""portrait_b"": 13
},
{
""portrait_a"": 1,
""portrait_b"": 14
},
{
""portrait_a"": 14,
""portrait_b"": 7
},
{
""portrait_a"": 14,
""portrait_b"": 9
},
{
""portrait_a"": 14,
""portrait_b"": 13
},
{
""portrait_a"": 14,
""portrait_b"": 16
},
{
""portrait_a"": 18,
""portrait_b"": 2
},
{
""portrait_a"": 18,
""portrait_b"": 7
},
{
""portrait_a"": 18,
""portrait_b"": 11
},
{
""portrait_a"": 18,
""portrait_b"": 15
},
{
""portrait_a"": 17,
""portrait_b"": 9
},
{
""portrait_a"": 17,
""portrait_b"": 16
},
{
""portrait_a"": 4,
""portrait_b"": 11
},
{
""portrait_a"": 4,
""portrait_b"": 21
},
{
""portrait_a"": 5,
""portrait_b"": 2
},
{
""portrait_a"": 5,
""portrait_b"": 8
},
{
""portrait_a"": 5,
""portrait_b"": 12
},
{
""portrait_a"": 5,
""portrait_b"": 21
},
{
""portrait_a"": 19,
""portrait_b"": 7
},
{
""portrait_a"": 19,
""portrait_b"": 11
},
{
""portrait_a"": 19,
""portrait_b"": 20
},
{
""portrait_a"": 13,
""portrait_b"": 2
},
{
""portrait_a"": 13,
""portrait_b"": 15
},
{
""portrait_a"": 11,
""portrait_b"": 2
},
{
""portrait_a"": 11,
""portrait_b"": 6
},
{
""portrait_a"": 11,
""portrait_b"": 7
},
{
""portrait_a"": 11,
""portrait_b"": 10
},
{
""portrait_a"": 11,
""portrait_b"": 20
},
{
""portrait_a"": 20,
""portrait_b"": 7
},
{
""portrait_a"": 7,
""portrait_b"": 15
},
{
""portrait_a"": 8,
""portrait_b"": 12
},
{
""portrait_a"": 8,
""portrait_b"": 23
},
{
""portrait_a"": 9,
""portrait_b"": 23
},
{
""portrait_a"": 6,
""portrait_b"": 21
},
{
""portrait_a"": 2,
""portrait_b"": 15
},
{
""portrait_a"": 2,
""portrait_b"": 21
},
{
""portrait_a"": 21,
""portrait_b"": 22
},
{
""portrait_a"": 22,
""portrait_b"": 23
},
{
""portrait_a"": 23,
""portrait_b"": 12
}
]
}
Oh, and when you send back the arrangement, please use this simple JSON shape so it's easy to read:
{
""solution"": [
[""portrait_id"", ""portrait_id"", ...],
[""portrait_id"", ""portrait_id"", ...]
]
}
Think of it like a little form: the first list inside ""solution"" is the East wall, the second list is the West wall, and each ""portrait_id"" is just the exact identifier for a portrait from the instance. This is just a sketch of 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. 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': 'MAXCUT', 'num_nodes': 24, 'num_edges': 46, 'edges': [{'u': 24, 'v': 11}, {'u': 24, 'v': 20}, {'u': 3, 'v': 7}, {'u': 3, 'v': 20}, {'u': 1, 'v': 2}, {'u': 1, 'v': 8}, {'u': 1, 'v': 9}, {'u': 1, 'v': 13}, {'u': 1, 'v': 14}, {'u': 14, 'v': 7}, {'u': 14, 'v': 9}, {'u': 14, 'v': 13}, {'u': 14, 'v': 16}, {'u': 18, 'v': 2}, {'u': 18, 'v': 7}, {'u': 18, 'v': 11}, {'u': 18, 'v': 15}, {'u': 17, 'v': 9}, {'u': 17, 'v': 16}, {'u': 4, 'v': 11}, {'u': 4, 'v': 21}, {'u': 5, 'v': 2}, {'u': 5, 'v': 8}, {'u': 5, 'v': 12}, {'u': 5, 'v': 21}, {'u': 19, 'v': 7}, {'u': 19, 'v': 11}, {'u': 19, 'v': 20}, {'u': 13, 'v': 2}, {'u': 13, 'v': 15}, {'u': 11, 'v': 2}, {'u': 11, 'v': 6}, {'u': 11, 'v': 7}, {'u': 11, 'v': 10}, {'u': 11, 'v': 20}, {'u': 20, 'v': 7}, {'u': 7, 'v': 15}, {'u': 8, 'v': 12}, {'u': 8, 'v': 23}, {'u': 9, 'v': 23}, {'u': 6, 'v': 21}, {'u': 2, 'v': 15}, {'u': 2, 'v': 21}, {'u': 21, 'v': 22}, {'u': 22, 'v': 23}, {'u': 23, 'v': 12}], 'source_file': 'wy2010.mtx', 'density': 0.16666666666666666, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0031.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0031.png', 'edge_connectivity': 1}","[[1, 5, 11, 14, 15, 17, 20, 21, 23], [2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 16, 18, 19, 22, 24]]",37.0,"{'num_nodes': 24, 'num_edges': 46, 'edges': [{'u': 24, 'v': 11}, {'u': 24, 'v': 20}, {'u': 3, 'v': 7}, {'u': 3, 'v': 20}, {'u': 1, 'v': 2}, {'u': 1, 'v': 8}, {'u': 1, 'v': 9}, {'u': 1, 'v': 13}, {'u': 1, 'v': 14}, {'u': 14, 'v': 7}, {'u': 14, 'v': 9}, {'u': 14, 'v': 13}, {'u': 14, 'v': 16}, {'u': 18, 'v': 2}, {'u': 18, 'v': 7}, {'u': 18, 'v': 11}, {'u': 18, 'v': 15}, {'u': 17, 'v': 9}, {'u': 17, 'v': 16}, {'u': 4, 'v': 11}, {'u': 4, 'v': 21}, {'u': 5, 'v': 2}, {'u': 5, 'v': 8}, {'u': 5, 'v': 12}, {'u': 5, 'v': 21}, {'u': 19, 'v': 7}, {'u': 19, 'v': 11}, {'u': 19, 'v': 20}, {'u': 13, 'v': 2}, {'u': 13, 'v': 15}, {'u': 11, 'v': 2}, {'u': 11, 'v': 6}, {'u': 11, 'v': 7}, {'u': 11, 'v': 10}, {'u': 11, 'v': 20}, {'u': 20, 'v': 7}, {'u': 7, 'v': 15}, {'u': 8, 'v': 12}, {'u': 8, 'v': 23}, {'u': 9, 'v': 23}, {'u': 6, 'v': 21}, {'u': 2, 'v': 15}, {'u': 2, 'v': 21}, {'u': 21, 'v': 22}, {'u': 22, 'v': 23}, {'u': 23, 'v': 12}]}","[[1, 5, 11, 14, 15, 17, 20, 21, 23], [2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 16, 18, 19, 22, 24]]",32,json,1
MAXCUT,MAXCUT,"Someone in charge of bench layout had to put every experiment on either Bench Alpha or Bench Beta, making sure nothing was left out or cloned across benches. There were many interdependent experiment pairs, and each time a linked pair ended up on different benches it helped the setup, so the task became finding an assignment that separates as many linked pairs as possible. To judge any layout, tally up how many linked pairs are split across the two benches — the higher the tally, the better the placement. The detailed list of experiments and their dependencies appears below.
# total_experiments=22
# total_dependency_pairs=37
experiment_endpoint_u,experiment_endpoint_v
U,F
U,H
U,I
U,Q
U,R
P,E
P,G
M,C
M,I
M,K
M,Q
N,D
N,E
N,L
N,T
N,V
Q,A
Q,R
E,G
E,L
E,T
G,I
R,C
R,F
R,H
R,J
R,K
R,O
V,B
B,D
B,O
T,H
T,I
S,O
H,D
I,A
D,O
If you want to give a proposed layout, just drop it in a tiny JSON like this so it's easy to read and check:
{
""solution"": [
[""experiment_id"", ""experiment_id"", ...],
[""experiment_id"", ""experiment_id"", ...]
]
}
Think of it as two lists: the first inner list is the experiments on one bench, the second inner list is the experiments on the other bench. Keep it simple — just list the experiment identifiers you picked for each bench. This is only a sketch of the shape I expect, not the actual answer.
Please make sure to use the exact identifiers from the instance input — don't rename them or invent new labels.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'MAXCUT', 'num_nodes': 22, 'num_edges': 37, 'edges': [{'u': 21, 'v': 6}, {'u': 21, 'v': 8}, {'u': 21, 'v': 9}, {'u': 21, 'v': 17}, {'u': 21, 'v': 18}, {'u': 16, 'v': 5}, {'u': 16, 'v': 7}, {'u': 13, 'v': 3}, {'u': 13, 'v': 9}, {'u': 13, 'v': 11}, {'u': 13, 'v': 17}, {'u': 14, 'v': 4}, {'u': 14, 'v': 5}, {'u': 14, 'v': 12}, {'u': 14, 'v': 20}, {'u': 14, 'v': 22}, {'u': 17, 'v': 1}, {'u': 17, 'v': 18}, {'u': 5, 'v': 7}, {'u': 5, 'v': 12}, {'u': 5, 'v': 20}, {'u': 7, 'v': 9}, {'u': 18, 'v': 3}, {'u': 18, 'v': 6}, {'u': 18, 'v': 8}, {'u': 18, 'v': 10}, {'u': 18, 'v': 11}, {'u': 18, 'v': 15}, {'u': 22, 'v': 2}, {'u': 2, 'v': 4}, {'u': 2, 'v': 15}, {'u': 20, 'v': 8}, {'u': 20, 'v': 9}, {'u': 19, 'v': 15}, {'u': 8, 'v': 4}, {'u': 9, 'v': 1}, {'u': 4, 'v': 15}], 'source_file': 'vt2010.mtx', 'density': 0.16017316017316016, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0032.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0032.png', 'edge_connectivity': 1}","[[1, 4, 7, 12, 13, 18, 19, 20, 21, 22], [2, 3, 5, 6, 8, 9, 10, 11, 14, 15, 16, 17]]",33.0,"{'num_nodes': 22, 'num_edges': 37, 'edges': [{'u': 'U', 'v': 'F'}, {'u': 'U', 'v': 'H'}, {'u': 'U', 'v': 'I'}, {'u': 'U', 'v': 'Q'}, {'u': 'U', 'v': 'R'}, {'u': 'P', 'v': 'E'}, {'u': 'P', 'v': 'G'}, {'u': 'M', 'v': 'C'}, {'u': 'M', 'v': 'I'}, {'u': 'M', 'v': 'K'}, {'u': 'M', 'v': 'Q'}, {'u': 'N', 'v': 'D'}, {'u': 'N', 'v': 'E'}, {'u': 'N', 'v': 'L'}, {'u': 'N', 'v': 'T'}, {'u': 'N', 'v': 'V'}, {'u': 'Q', 'v': 'A'}, {'u': 'Q', 'v': 'R'}, {'u': 'E', 'v': 'G'}, {'u': 'E', 'v': 'L'}, {'u': 'E', 'v': 'T'}, {'u': 'G', 'v': 'I'}, {'u': 'R', 'v': 'C'}, {'u': 'R', 'v': 'F'}, {'u': 'R', 'v': 'H'}, {'u': 'R', 'v': 'J'}, {'u': 'R', 'v': 'K'}, {'u': 'R', 'v': 'O'}, {'u': 'V', 'v': 'B'}, {'u': 'B', 'v': 'D'}, {'u': 'B', 'v': 'O'}, {'u': 'T', 'v': 'H'}, {'u': 'T', 'v': 'I'}, {'u': 'S', 'v': 'O'}, {'u': 'H', 'v': 'D'}, {'u': 'I', 'v': 'A'}, {'u': 'D', 'v': 'O'}]}","[['A', 'D', 'G', 'L', 'M', 'R', 'S', 'T', 'U', 'V'], ['B', 'C', 'E', 'F', 'H', 'I', 'J', 'K', 'N', 'O', 'P', 'Q']]",33,csv,names
MAXCUT,MAXCUT,"We’re trying to organize two walking patrols, Red and Blue, and every household has to be assigned to exactly one of them — nothing gets skipped and no house can belong to both teams. A strong arrangement is one where lots of the “watch links” between neighboring houses run between the two teams, so measure a plan by counting how many adjacent house pairs are on different patrols; the higher that number, the more effective the split. The concrete map and list of houses are shown below.
There are 23 houses in total and 47 watch links.
| house_one | house_two |
|---|---|
| 17 | 20 |
| 17 | 21 |
| 8 | 7 |
| 8 | 9 |
| 8 | 10 |
| 9 | 4 |
| 9 | 7 |
| 9 | 10 |
| 9 | 14 |
| 9 | 18 |
| 9 | 22 |
| 1 | 3 |
| 1 | 12 |
| 1 | 13 |
| 1 | 14 |
| 1 | 16 |
| 18 | 7 |
| 18 | 14 |
| 19 | 6 |
| 19 | 12 |
| 19 | 16 |
| 19 | 23 |
| 6 | 16 |
| 20 | 4 |
| 20 | 12 |
| 20 | 15 |
| 20 | 21 |
| 20 | 22 |
| 13 | 2 |
| 13 | 3 |
| 13 | 7 |
| 13 | 14 |
| 15 | 12 |
| 15 | 21 |
| 15 | 23 |
| 3 | 2 |
| 3 | 7 |
| 3 | 16 |
| 4 | 12 |
| 4 | 14 |
| 2 | 7 |
| 21 | 5 |
| 10 | 7 |
| 10 | 11 |
| 11 | 7 |
| 12 | 14 |
| 7 | 14 |
You can just hand the final partition back in a tiny JSON object like this so it's easy to parse:
{
""solution"": [
[""house_id"", ""house_id"", ...],
[""house_id"", ""house_id"", ...]
]
}
The two inner lists are the two patrols — first list = Red, second list = Blue — and each entry is a house identifier that gets assigned to that patrol. This is just the expected shape (a sketch), not the actual assignment.
Please make sure you use the exact identifiers from the instance input — don't rename them or invent new ones.
- for example: ""Valid identifiers look like plain numbers such as ""1"" or ""23"", single capital letters like ""A"" or ""B"", or a capital letter followed by digits like ""A1"" or ""X7"".""","{'problem_type': 'MAXCUT', 'num_nodes': 23, 'num_edges': 47, 'edges': [{'u': 17, 'v': 20}, {'u': 17, 'v': 21}, {'u': 8, 'v': 7}, {'u': 8, 'v': 9}, {'u': 8, 'v': 10}, {'u': 9, 'v': 4}, {'u': 9, 'v': 7}, {'u': 9, 'v': 10}, {'u': 9, 'v': 14}, {'u': 9, 'v': 18}, {'u': 9, 'v': 22}, {'u': 1, 'v': 3}, {'u': 1, 'v': 12}, {'u': 1, 'v': 13}, {'u': 1, 'v': 14}, {'u': 1, 'v': 16}, {'u': 18, 'v': 7}, {'u': 18, 'v': 14}, {'u': 19, 'v': 6}, {'u': 19, 'v': 12}, {'u': 19, 'v': 16}, {'u': 19, 'v': 23}, {'u': 6, 'v': 16}, {'u': 20, 'v': 4}, {'u': 20, 'v': 12}, {'u': 20, 'v': 15}, {'u': 20, 'v': 21}, {'u': 20, 'v': 22}, {'u': 13, 'v': 2}, {'u': 13, 'v': 3}, {'u': 13, 'v': 7}, {'u': 13, 'v': 14}, {'u': 15, 'v': 12}, {'u': 15, 'v': 21}, {'u': 15, 'v': 23}, {'u': 3, 'v': 2}, {'u': 3, 'v': 7}, {'u': 3, 'v': 16}, {'u': 4, 'v': 12}, {'u': 4, 'v': 14}, {'u': 2, 'v': 7}, {'u': 21, 'v': 5}, {'u': 10, 'v': 7}, {'u': 10, 'v': 11}, {'u': 11, 'v': 7}, {'u': 12, 'v': 14}, {'u': 7, 'v': 14}], 'source_file': 'vt2010.mtx', 'density': 0.1857707509881423, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0033.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0033.png', 'edge_connectivity': 1}","[[1, 2, 3, 4, 5, 8, 11, 14, 15, 17, 18, 19, 22], [6, 7, 9, 10, 12, 13, 16, 20, 21, 23]]",35.0,"{'num_nodes': 23, 'num_edges': 47, 'edges': [{'u': 17, 'v': 20}, {'u': 17, 'v': 21}, {'u': 8, 'v': 7}, {'u': 8, 'v': 9}, {'u': 8, 'v': 10}, {'u': 9, 'v': 4}, {'u': 9, 'v': 7}, {'u': 9, 'v': 10}, {'u': 9, 'v': 14}, {'u': 9, 'v': 18}, {'u': 9, 'v': 22}, {'u': 1, 'v': 3}, {'u': 1, 'v': 12}, {'u': 1, 'v': 13}, {'u': 1, 'v': 14}, {'u': 1, 'v': 16}, {'u': 18, 'v': 7}, {'u': 18, 'v': 14}, {'u': 19, 'v': 6}, {'u': 19, 'v': 12}, {'u': 19, 'v': 16}, {'u': 19, 'v': 23}, {'u': 6, 'v': 16}, {'u': 20, 'v': 4}, {'u': 20, 'v': 12}, {'u': 20, 'v': 15}, {'u': 20, 'v': 21}, {'u': 20, 'v': 22}, {'u': 13, 'v': 2}, {'u': 13, 'v': 3}, {'u': 13, 'v': 7}, {'u': 13, 'v': 14}, {'u': 15, 'v': 12}, {'u': 15, 'v': 21}, {'u': 15, 'v': 23}, {'u': 3, 'v': 2}, {'u': 3, 'v': 7}, {'u': 3, 'v': 16}, {'u': 4, 'v': 12}, {'u': 4, 'v': 14}, {'u': 2, 'v': 7}, {'u': 21, 'v': 5}, {'u': 10, 'v': 7}, {'u': 10, 'v': 11}, {'u': 11, 'v': 7}, {'u': 12, 'v': 14}, {'u': 7, 'v': 14}]}","[[1, 2, 3, 4, 5, 8, 11, 14, 15, 17, 18, 19, 22], [6, 7, 9, 10, 12, 13, 16, 20, 21, 23]]",34,markdown_table,1
MAXCUT,MAXCUT,"Many people walk past the shop and notice when pairs of outfits are displayed across the two mannequins, so the plan is to put each outfit on either Mannequin Left or Mannequin Right, once apiece. There are known pairwise style connections between specific outfits, and the aim is to maximize how many of those connections end up straddling the mannequins; that’s determined by counting how many pair connections have their two outfits on different mannequins. No outfit is omitted or duplicated. The full list of outfits and pairings is shown below.
There are 22 outfits in total and 45 style pairings.
| outfit_u | outfit_v |
|---|---|
| P | H |
| P | R |
| P | T |
| U | F |
| U | Q |
| F | C |
| F | E |
| G | B |
| G | I |
| G | L |
| G | T |
| M | K |
| M | S |
| M | T |
| B | L |
| B | S |
| B | T |
| B | V |
| D | E |
| D | T |
| C | A |
| C | Q |
| C | T |
| A | E |
| A | T |
| Q | T |
| J | H |
| J | N |
| J | T |
| T | E |
| T | H |
| T | I |
| T | K |
| T | L |
| T | N |
| T | O |
| T | R |
| T | S |
| T | V |
| N | H |
| R | H |
| V | S |
| O | K |
| O | S |
| S | K |
Oh, and when you send the placement back, a simple JSON like this works — two lists inside ""solution"", one list per mannequin:
{
""solution"": [
[""outfit_id"", ""outfit_id"", ...],
[""outfit_id"", ""outfit_id"", ...]
]
}
The first inner list would be the outfits you put on Mannequin Left, and the second list is the outfits for Mannequin Right. Think of it like filling out a short form: each quoted placeholder is where an outfit identifier goes. This is just the expected shape — not the actual answer.
Please use the exact outfit identifiers from the instance input — do not rename them or add 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': 'MAXCUT', 'num_nodes': 22, 'num_edges': 45, 'edges': [{'u': 16, 'v': 8}, {'u': 16, 'v': 18}, {'u': 16, 'v': 20}, {'u': 21, 'v': 6}, {'u': 21, 'v': 17}, {'u': 6, 'v': 3}, {'u': 6, 'v': 5}, {'u': 7, 'v': 2}, {'u': 7, 'v': 9}, {'u': 7, 'v': 12}, {'u': 7, 'v': 20}, {'u': 13, 'v': 11}, {'u': 13, 'v': 19}, {'u': 13, 'v': 20}, {'u': 2, 'v': 12}, {'u': 2, 'v': 19}, {'u': 2, 'v': 20}, {'u': 2, 'v': 22}, {'u': 4, 'v': 5}, {'u': 4, 'v': 20}, {'u': 3, 'v': 1}, {'u': 3, 'v': 17}, {'u': 3, 'v': 20}, {'u': 1, 'v': 5}, {'u': 1, 'v': 20}, {'u': 17, 'v': 20}, {'u': 10, 'v': 8}, {'u': 10, 'v': 14}, {'u': 10, 'v': 20}, {'u': 20, 'v': 5}, {'u': 20, 'v': 8}, {'u': 20, 'v': 9}, {'u': 20, 'v': 11}, {'u': 20, 'v': 12}, {'u': 20, 'v': 14}, {'u': 20, 'v': 15}, {'u': 20, 'v': 18}, {'u': 20, 'v': 19}, {'u': 20, 'v': 22}, {'u': 14, 'v': 8}, {'u': 18, 'v': 8}, {'u': 22, 'v': 19}, {'u': 15, 'v': 11}, {'u': 15, 'v': 19}, {'u': 19, 'v': 11}], 'source_file': 'wv2010.mtx', 'density': 0.19480519480519481, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0034.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0034.png', 'edge_connectivity': 2}","[[1, 2, 4, 6, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 22], [3, 5, 7, 8, 19, 20, 21]]",34.0,"{'num_nodes': 22, 'num_edges': 45, 'edges': [{'u': 'P', 'v': 'H'}, {'u': 'P', 'v': 'R'}, {'u': 'P', 'v': 'T'}, {'u': 'U', 'v': 'F'}, {'u': 'U', 'v': 'Q'}, {'u': 'F', 'v': 'C'}, {'u': 'F', 'v': 'E'}, {'u': 'G', 'v': 'B'}, {'u': 'G', 'v': 'I'}, {'u': 'G', 'v': 'L'}, {'u': 'G', 'v': 'T'}, {'u': 'M', 'v': 'K'}, {'u': 'M', 'v': 'S'}, {'u': 'M', 'v': 'T'}, {'u': 'B', 'v': 'L'}, {'u': 'B', 'v': 'S'}, {'u': 'B', 'v': 'T'}, {'u': 'B', 'v': 'V'}, {'u': 'D', 'v': 'E'}, {'u': 'D', 'v': 'T'}, {'u': 'C', 'v': 'A'}, {'u': 'C', 'v': 'Q'}, {'u': 'C', 'v': 'T'}, {'u': 'A', 'v': 'E'}, {'u': 'A', 'v': 'T'}, {'u': 'Q', 'v': 'T'}, {'u': 'J', 'v': 'H'}, {'u': 'J', 'v': 'N'}, {'u': 'J', 'v': 'T'}, {'u': 'T', 'v': 'E'}, {'u': 'T', 'v': 'H'}, {'u': 'T', 'v': 'I'}, {'u': 'T', 'v': 'K'}, {'u': 'T', 'v': 'L'}, {'u': 'T', 'v': 'N'}, {'u': 'T', 'v': 'O'}, {'u': 'T', 'v': 'R'}, {'u': 'T', 'v': 'S'}, {'u': 'T', 'v': 'V'}, {'u': 'N', 'v': 'H'}, {'u': 'R', 'v': 'H'}, {'u': 'V', 'v': 'S'}, {'u': 'O', 'v': 'K'}, {'u': 'O', 'v': 'S'}, {'u': 'S', 'v': 'K'}]}","[['A', 'B', 'D', 'F', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'V'], ['C', 'E', 'G', 'H', 'S', 'T', 'U']]",35,markdown_table,names
MAXCUT,MAXCUT,"Many people joked that Oak and Pine should be like rival teams, so the plan became: put everyone into one of the two rooms (no double-booking, everyone somewhere) and arrange it so as many habitual collaboration pairs are split between the rooms. Score each arrangement by counting collaborator pairs that land in different rooms — more such cross-room pairs means the split is doing its job. Concrete details are given below.
There are 25 employees and 47 habitual collaboration pairs.
Pair 13-18: counts toward the score if 13 and 18 are placed in different rooms.
Pair 13-19: counts toward the score if 13 and 19 are placed in different rooms.
Pair 3-2: counts toward the score if 3 and 2 are placed in different rooms.
Pair 3-5: counts toward the score if 3 and 5 are placed in different rooms.
Pair 3-8: counts toward the score if 3 and 8 are placed in different rooms.
Pair 3-14: counts toward the score if 3 and 14 are placed in different rooms.
Pair 3-16: counts toward the score if 3 and 16 are placed in different rooms.
Pair 3-19: counts toward the score if 3 and 19 are placed in different rooms.
Pair 3-22: counts toward the score if 3 and 22 are placed in different rooms.
Pair 8-19: counts toward the score if 8 and 19 are placed in different rooms.
Pair 4-14: counts toward the score if 4 and 14 are placed in different rooms.
Pair 4-25: counts toward the score if 4 and 25 are placed in different rooms.
Pair 9-2: counts toward the score if 9 and 2 are placed in different rooms.
Pair 9-7: counts toward the score if 9 and 7 are placed in different rooms.
Pair 9-21: counts toward the score if 9 and 21 are placed in different rooms.
Pair 9-23: counts toward the score if 9 and 23 are placed in different rooms.
Pair 25-14: counts toward the score if 25 and 14 are placed in different rooms.
Pair 10-2: counts toward the score if 10 and 2 are placed in different rooms.
Pair 10-11: counts toward the score if 10 and 11 are placed in different rooms.
Pair 14-2: counts toward the score if 14 and 2 are placed in different rooms.
Pair 14-16: counts toward the score if 14 and 16 are placed in different rooms.
Pair 14-17: counts toward the score if 14 and 17 are placed in different rooms.
Pair 14-19: counts toward the score if 14 and 19 are placed in different rooms.
Pair 14-23: counts toward the score if 14 and 23 are placed in different rooms.
Pair 14-24: counts toward the score if 14 and 24 are placed in different rooms.
Pair 16-19: counts toward the score if 16 and 19 are placed in different rooms.
Pair 6-12: counts toward the score if 6 and 12 are placed in different rooms.
Pair 6-19: counts toward the score if 6 and 19 are placed in different rooms.
Pair 6-23: counts toward the score if 6 and 23 are placed in different rooms.
Pair 15-7: counts toward the score if 15 and 7 are placed in different rooms.
Pair 15-23: counts toward the score if 15 and 23 are placed in different rooms.
Pair 19-12: counts toward the score if 19 and 12 are placed in different rooms.
Pair 19-18: counts toward the score if 19 and 18 are placed in different rooms.
Pair 19-20: counts toward the score if 19 and 20 are placed in different rooms.
Pair 19-23: counts toward the score if 19 and 23 are placed in different rooms.
Pair 11-2: counts toward the score if 11 and 2 are placed in different rooms.
Pair 11-21: counts toward the score if 11 and 21 are placed in different rooms.
Pair 22-2: counts toward the score if 22 and 2 are placed in different rooms.
Pair 12-23: counts toward the score if 12 and 23 are placed in different rooms.
Pair 21-2: counts toward the score if 21 and 2 are placed in different rooms.
Pair 21-7: counts toward the score if 21 and 7 are placed in different rooms.
Pair 1-23: counts toward the score if 1 and 23 are placed in different rooms.
Pair 1-24: counts toward the score if 1 and 24 are placed in different rooms.
Pair 2-23: counts toward the score if 2 and 23 are placed in different rooms.
Pair 24-17: counts toward the score if 24 and 17 are placed in different rooms.
Pair 24-23: counts toward the score if 24 and 23 are placed in different rooms.
Pair 20-18: counts toward the score if 20 and 18 are placed in different rooms.
Aim to split as many of the 47 pairs across Oak and Pine as possible.
Oh, and when you send the split back, it'd be easiest if you drop it into a tiny JSON snippet like this:
{
""solution"": [
[""person_id"", ""person_id"", ...],
[""person_id"", ""person_id"", ...]
]
}
Think of ""solution"" as just two lists: the first list is everyone who goes in one room, the second list is everyone who goes in the other room. It's just a sketch of the shape I need — not the final content itself.
Please make sure to 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': 'MAXCUT', 'num_nodes': 25, 'num_edges': 47, 'edges': [{'u': 13, 'v': 18}, {'u': 13, 'v': 19}, {'u': 3, 'v': 2}, {'u': 3, 'v': 5}, {'u': 3, 'v': 8}, {'u': 3, 'v': 14}, {'u': 3, 'v': 16}, {'u': 3, 'v': 19}, {'u': 3, 'v': 22}, {'u': 8, 'v': 19}, {'u': 4, 'v': 14}, {'u': 4, 'v': 25}, {'u': 9, 'v': 2}, {'u': 9, 'v': 7}, {'u': 9, 'v': 21}, {'u': 9, 'v': 23}, {'u': 25, 'v': 14}, {'u': 10, 'v': 2}, {'u': 10, 'v': 11}, {'u': 14, 'v': 2}, {'u': 14, 'v': 16}, {'u': 14, 'v': 17}, {'u': 14, 'v': 19}, {'u': 14, 'v': 23}, {'u': 14, 'v': 24}, {'u': 16, 'v': 19}, {'u': 6, 'v': 12}, {'u': 6, 'v': 19}, {'u': 6, 'v': 23}, {'u': 15, 'v': 7}, {'u': 15, 'v': 23}, {'u': 19, 'v': 12}, {'u': 19, 'v': 18}, {'u': 19, 'v': 20}, {'u': 19, 'v': 23}, {'u': 11, 'v': 2}, {'u': 11, 'v': 21}, {'u': 22, 'v': 2}, {'u': 12, 'v': 23}, {'u': 21, 'v': 2}, {'u': 21, 'v': 7}, {'u': 1, 'v': 23}, {'u': 1, 'v': 24}, {'u': 2, 'v': 23}, {'u': 24, 'v': 17}, {'u': 24, 'v': 23}, {'u': 20, 'v': 18}], 'source_file': 'wv2010.mtx', 'density': 0.15666666666666668, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0035.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0035.png', 'edge_connectivity': 1}","[[5, 6, 8, 9, 10, 12, 13, 14, 15, 16, 20, 21, 22, 24], [1, 2, 3, 4, 7, 11, 17, 18, 19, 23, 25]]",35.0,"{'num_nodes': 25, 'num_edges': 47, 'edges': [{'u': 13, 'v': 18}, {'u': 13, 'v': 19}, {'u': 3, 'v': 2}, {'u': 3, 'v': 5}, {'u': 3, 'v': 8}, {'u': 3, 'v': 14}, {'u': 3, 'v': 16}, {'u': 3, 'v': 19}, {'u': 3, 'v': 22}, {'u': 8, 'v': 19}, {'u': 4, 'v': 14}, {'u': 4, 'v': 25}, {'u': 9, 'v': 2}, {'u': 9, 'v': 7}, {'u': 9, 'v': 21}, {'u': 9, 'v': 23}, {'u': 25, 'v': 14}, {'u': 10, 'v': 2}, {'u': 10, 'v': 11}, {'u': 14, 'v': 2}, {'u': 14, 'v': 16}, {'u': 14, 'v': 17}, {'u': 14, 'v': 19}, {'u': 14, 'v': 23}, {'u': 14, 'v': 24}, {'u': 16, 'v': 19}, {'u': 6, 'v': 12}, {'u': 6, 'v': 19}, {'u': 6, 'v': 23}, {'u': 15, 'v': 7}, {'u': 15, 'v': 23}, {'u': 19, 'v': 12}, {'u': 19, 'v': 18}, {'u': 19, 'v': 20}, {'u': 19, 'v': 23}, {'u': 11, 'v': 2}, {'u': 11, 'v': 21}, {'u': 22, 'v': 2}, {'u': 12, 'v': 23}, {'u': 21, 'v': 2}, {'u': 21, 'v': 7}, {'u': 1, 'v': 23}, {'u': 1, 'v': 24}, {'u': 2, 'v': 23}, {'u': 24, 'v': 17}, {'u': 24, 'v': 23}, {'u': 20, 'v': 18}]}","[[5, 6, 8, 9, 10, 12, 13, 14, 15, 16, 20, 21, 22, 24], [1, 2, 3, 4, 7, 11, 17, 18, 19, 23, 25]]",36,nl,1
MAXCUT,MAXCUT,"I work at a small office where we need to split everyone into two opposing shifts. The idea is to decide, for each person, which of the two shifts they’ll be on so that as many pairs of coworkers as possible end up on different shifts. You can tell how good a split is by going through every pair of colleagues and counting one point for each pair that lands on opposite shifts — the higher that count, the better. Everyone has to be on exactly one of the two shifts (no one left unassigned or put on both). The concrete list of people and who interacts with whom is shown below.
{
""total_people"": 19,
""total_interactions"": 34,
""edges"": [
{
""person_a"": 6,
""person_b"": 8
},
{
""person_a"": 6,
""person_b"": 10
},
{
""person_a"": 6,
""person_b"": 12
},
{
""person_a"": 6,
""person_b"": 14
},
{
""person_a"": 7,
""person_b"": 3
},
{
""person_a"": 7,
""person_b"": 12
},
{
""person_a"": 16,
""person_b"": 1
},
{
""person_a"": 16,
""person_b"": 17
},
{
""person_a"": 16,
""person_b"": 18
},
{
""person_a"": 10,
""person_b"": 2
},
{
""person_a"": 10,
""person_b"": 11
},
{
""person_a"": 10,
""person_b"": 12
},
{
""person_a"": 1,
""person_b"": 2
},
{
""person_a"": 1,
""person_b"": 4
},
{
""person_a"": 1,
""person_b"": 8
},
{
""person_a"": 5,
""person_b"": 2
},
{
""person_a"": 5,
""person_b"": 11
},
{
""person_a"": 13,
""person_b"": 14
},
{
""person_a"": 13,
""person_b"": 15
},
{
""person_a"": 2,
""person_b"": 8
},
{
""person_a"": 2,
""person_b"": 18
},
{
""person_a"": 19,
""person_b"": 17
},
{
""person_a"": 19,
""person_b"": 18
},
{
""person_a"": 15,
""person_b"": 4
},
{
""person_a"": 15,
""person_b"": 9
},
{
""person_a"": 15,
""person_b"": 14
},
{
""person_a"": 15,
""person_b"": 17
},
{
""person_a"": 17,
""person_b"": 4
},
{
""person_a"": 14,
""person_b"": 3
},
{
""person_a"": 14,
""person_b"": 4
},
{
""person_a"": 14,
""person_b"": 9
},
{
""person_a"": 14,
""person_b"": 12
},
{
""person_a"": 8,
""person_b"": 4
},
{
""person_a"": 9,
""person_b"": 4
}
]
}
Oh, and if you want to send the split back in a tidy form, you can just follow this little JSON sketch for the layout:
{
""solution"": [
[""employee_id"", ""employee_id"", ...],
[""employee_id"", ""employee_id"", ...]
]
}
The first inner list is one shift, the second inner list is the opposing shift — just put each person's identifier in one of the lists. This is just a shape guide, not the final answer; replace the placeholders with the actual identifiers from the instance.
Please use the exact identifiers 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': 'MAXCUT', 'num_nodes': 19, 'num_edges': 34, 'edges': [{'u': 6, 'v': 8}, {'u': 6, 'v': 10}, {'u': 6, 'v': 12}, {'u': 6, 'v': 14}, {'u': 7, 'v': 3}, {'u': 7, 'v': 12}, {'u': 16, 'v': 1}, {'u': 16, 'v': 17}, {'u': 16, 'v': 18}, {'u': 10, 'v': 2}, {'u': 10, 'v': 11}, {'u': 10, 'v': 12}, {'u': 1, 'v': 2}, {'u': 1, 'v': 4}, {'u': 1, 'v': 8}, {'u': 5, 'v': 2}, {'u': 5, 'v': 11}, {'u': 13, 'v': 14}, {'u': 13, 'v': 15}, {'u': 2, 'v': 8}, {'u': 2, 'v': 18}, {'u': 19, 'v': 17}, {'u': 19, 'v': 18}, {'u': 15, 'v': 4}, {'u': 15, 'v': 9}, {'u': 15, 'v': 14}, {'u': 15, 'v': 17}, {'u': 17, 'v': 4}, {'u': 14, 'v': 3}, {'u': 14, 'v': 4}, {'u': 14, 'v': 9}, {'u': 14, 'v': 12}, {'u': 8, 'v': 4}, {'u': 9, 'v': 4}], 'source_file': 'wv2010.mtx', 'density': 0.19883040935672514, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0036.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0036.png', 'edge_connectivity': 2}","[[1, 5, 7, 8, 10, 14, 15, 17, 18], [2, 3, 4, 6, 9, 11, 12, 13, 16, 19]]",29.0,"{'num_nodes': 19, 'num_edges': 34, 'edges': [{'u': 6, 'v': 8}, {'u': 6, 'v': 10}, {'u': 6, 'v': 12}, {'u': 6, 'v': 14}, {'u': 7, 'v': 3}, {'u': 7, 'v': 12}, {'u': 16, 'v': 1}, {'u': 16, 'v': 17}, {'u': 16, 'v': 18}, {'u': 10, 'v': 2}, {'u': 10, 'v': 11}, {'u': 10, 'v': 12}, {'u': 1, 'v': 2}, {'u': 1, 'v': 4}, {'u': 1, 'v': 8}, {'u': 5, 'v': 2}, {'u': 5, 'v': 11}, {'u': 13, 'v': 14}, {'u': 13, 'v': 15}, {'u': 2, 'v': 8}, {'u': 2, 'v': 18}, {'u': 19, 'v': 17}, {'u': 19, 'v': 18}, {'u': 15, 'v': 4}, {'u': 15, 'v': 9}, {'u': 15, 'v': 14}, {'u': 15, 'v': 17}, {'u': 17, 'v': 4}, {'u': 14, 'v': 3}, {'u': 14, 'v': 4}, {'u': 14, 'v': 9}, {'u': 14, 'v': 12}, {'u': 8, 'v': 4}, {'u': 9, 'v': 4}]}","[[1, 5, 7, 8, 10, 14, 15, 17, 18], [2, 3, 4, 6, 9, 11, 12, 13, 16, 19]]",37,json,1
MAXCUT,MAXCUT,"Imagine arranging a wedding where every guest must be put on either the north or south side of the hall, and the aim is to have as many pairs of people who know each other as possible sitting on different sides. The choice to make is the side assignment for each guest, and a seating is better when it yields a larger number of acquaintance pairs separated across the room. You determine how good any arrangement is by counting all acquaintance pairs that end up with one person on each side — higher counts are better. Everyone gets exactly one seat; nobody can be left out or assigned twice. The concrete seating details follow below.
# num_guests=22
# num_acquaintance_pairs=47
guest_id_a,guest_id_b
17,20
1,6
1,12
1,18
1,20
8,0
8,9
8,11
8,12
8,16
9,3
9,11
9,12
7,0
7,2
7,4
7,5
7,6
7,11
7,13
7,14
7,15
7,18
7,19
7,21
10,12
10,15
10,21
11,2
11,15
12,0
12,3
12,6
12,15
12,20
12,21
2,16
20,0
20,18
13,14
14,4
19,0
3,15
18,4
18,6
21,6
16,0
You can just send the seating as a small JSON snippet — nothing fancy — that shows which guests go on each side. Here’s the little shape I expect:
{
""solution"": [
[""guest_id"", ""guest_id"", ...],
[""guest_id"", ""guest_id"", ...]
]
}
Think of the first inner list as the north side of the hall and the second inner list as the south side. Each ""guest_id"" placeholder stands for one guest (you'd replace those placeholders with the actual IDs from the instance). This is just a sketch of the shape I want, not the actual seating plan.
Please use the exact identifiers given in the instance input — don't rename them or make up 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': 'MAXCUT', 'num_nodes': 22, 'num_edges': 47, 'edges': [{'u': 18, 'v': 21}, {'u': 2, 'v': 7}, {'u': 2, 'v': 13}, {'u': 2, 'v': 19}, {'u': 2, 'v': 21}, {'u': 9, 'v': 1}, {'u': 9, 'v': 10}, {'u': 9, 'v': 12}, {'u': 9, 'v': 13}, {'u': 9, 'v': 17}, {'u': 10, 'v': 4}, {'u': 10, 'v': 12}, {'u': 10, 'v': 13}, {'u': 8, 'v': 1}, {'u': 8, 'v': 3}, {'u': 8, 'v': 5}, {'u': 8, 'v': 6}, {'u': 8, 'v': 7}, {'u': 8, 'v': 12}, {'u': 8, 'v': 14}, {'u': 8, 'v': 15}, {'u': 8, 'v': 16}, {'u': 8, 'v': 19}, {'u': 8, 'v': 20}, {'u': 8, 'v': 22}, {'u': 11, 'v': 13}, {'u': 11, 'v': 16}, {'u': 11, 'v': 22}, {'u': 12, 'v': 3}, {'u': 12, 'v': 16}, {'u': 13, 'v': 1}, {'u': 13, 'v': 4}, {'u': 13, 'v': 7}, {'u': 13, 'v': 16}, {'u': 13, 'v': 21}, {'u': 13, 'v': 22}, {'u': 3, 'v': 17}, {'u': 21, 'v': 1}, {'u': 21, 'v': 19}, {'u': 14, 'v': 15}, {'u': 15, 'v': 5}, {'u': 20, 'v': 1}, {'u': 4, 'v': 16}, {'u': 19, 'v': 5}, {'u': 19, 'v': 7}, {'u': 22, 'v': 7}, {'u': 17, 'v': 1}], 'source_file': 'wv2010.mtx', 'density': 0.20346320346320346, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0037.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0037.png', 'edge_connectivity': 1}","[[1, 2, 3, 6, 9, 10, 14, 15, 16, 18, 19, 22], [4, 5, 7, 8, 11, 12, 13, 17, 20, 21]]",35.0,"{'num_nodes': 22, 'num_edges': 47, 'edges': [{'u': 17, 'v': 20}, {'u': 1, 'v': 6}, {'u': 1, 'v': 12}, {'u': 1, 'v': 18}, {'u': 1, 'v': 20}, {'u': 8, 'v': 0}, {'u': 8, 'v': 9}, {'u': 8, 'v': 11}, {'u': 8, 'v': 12}, {'u': 8, 'v': 16}, {'u': 9, 'v': 3}, {'u': 9, 'v': 11}, {'u': 9, 'v': 12}, {'u': 7, 'v': 0}, {'u': 7, 'v': 2}, {'u': 7, 'v': 4}, {'u': 7, 'v': 5}, {'u': 7, 'v': 6}, {'u': 7, 'v': 11}, {'u': 7, 'v': 13}, {'u': 7, 'v': 14}, {'u': 7, 'v': 15}, {'u': 7, 'v': 18}, {'u': 7, 'v': 19}, {'u': 7, 'v': 21}, {'u': 10, 'v': 12}, {'u': 10, 'v': 15}, {'u': 10, 'v': 21}, {'u': 11, 'v': 2}, {'u': 11, 'v': 15}, {'u': 12, 'v': 0}, {'u': 12, 'v': 3}, {'u': 12, 'v': 6}, {'u': 12, 'v': 15}, {'u': 12, 'v': 20}, {'u': 12, 'v': 21}, {'u': 2, 'v': 16}, {'u': 20, 'v': 0}, {'u': 20, 'v': 18}, {'u': 13, 'v': 14}, {'u': 14, 'v': 4}, {'u': 19, 'v': 0}, {'u': 3, 'v': 15}, {'u': 18, 'v': 4}, {'u': 18, 'v': 6}, {'u': 21, 'v': 6}, {'u': 16, 'v': 0}]}","[[0, 1, 2, 5, 8, 9, 13, 14, 15, 17, 18, 21], [3, 4, 6, 7, 10, 11, 12, 16, 19, 20]]",38,csv,0
MAXCUT,MAXCUT,"The class organizer is arranging two opposing debate squads and aims to split up as many study buddies as they can. The decision is who goes into Squad 1 and who goes into Squad 2 for every single student, and the quality of a given split is just how many study-pair links land on opposite squads — you get that number by counting the split pairs. Everyone must be assigned to one squad only; no one gets left off or duplicated. The specific roster and study-pair information are shown below.
# total_students=19
# total_study_pairs=24
student_a,student_b
H,R
O,J
O,L
O,M
N,L
A,G
A,L
P,L
Q,L
R,L
I,L
J,C
J,L
B,L
C,F
C,L
K,L
D,L
E,L
F,L
F,S
S,L
L,G
L,M
Oh, and when you send back the actual split, please follow this little JSON layout so it's easy to read and parse:
{
""solution"": [
[""student_id"", ""student_id"", ...],
[""student_id"", ""student_id"", ...]
]
}
The first inner list is who goes into Squad 1, the second inner list is Squad 2. Think of those ""student_id"" placeholders as just showing the shape — you'll replace them with the real student identifiers from the instance.
This JSON is only a sketch of the expected shape, not the actual answer. Also, make sure you 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': 'MAXCUT', 'num_nodes': 19, 'num_edges': 24, 'edges': [{'u': 8, 'v': 18}, {'u': 15, 'v': 10}, {'u': 15, 'v': 12}, {'u': 15, 'v': 13}, {'u': 14, 'v': 12}, {'u': 1, 'v': 7}, {'u': 1, 'v': 12}, {'u': 16, 'v': 12}, {'u': 17, 'v': 12}, {'u': 18, 'v': 12}, {'u': 9, 'v': 12}, {'u': 10, 'v': 3}, {'u': 10, 'v': 12}, {'u': 2, 'v': 12}, {'u': 3, 'v': 6}, {'u': 3, 'v': 12}, {'u': 11, 'v': 12}, {'u': 4, 'v': 12}, {'u': 5, 'v': 12}, {'u': 6, 'v': 12}, {'u': 6, 'v': 19}, {'u': 19, 'v': 12}, {'u': 12, 'v': 7}, {'u': 12, 'v': 13}], 'source_file': 'wi2010.mtx', 'density': 0.14035087719298245, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0038.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0038.png', 'edge_connectivity': 1}","[[6, 7, 8, 10, 12], [1, 2, 3, 4, 5, 9, 11, 13, 14, 15, 16, 17, 18, 19]]",20.0,"{'num_nodes': 19, 'num_edges': 24, 'edges': [{'u': 'H', 'v': 'R'}, {'u': 'O', 'v': 'J'}, {'u': 'O', 'v': 'L'}, {'u': 'O', 'v': 'M'}, {'u': 'N', 'v': 'L'}, {'u': 'A', 'v': 'G'}, {'u': 'A', 'v': 'L'}, {'u': 'P', 'v': 'L'}, {'u': 'Q', 'v': 'L'}, {'u': 'R', 'v': 'L'}, {'u': 'I', 'v': 'L'}, {'u': 'J', 'v': 'C'}, {'u': 'J', 'v': 'L'}, {'u': 'B', 'v': 'L'}, {'u': 'C', 'v': 'F'}, {'u': 'C', 'v': 'L'}, {'u': 'K', 'v': 'L'}, {'u': 'D', 'v': 'L'}, {'u': 'E', 'v': 'L'}, {'u': 'F', 'v': 'L'}, {'u': 'F', 'v': 'S'}, {'u': 'S', 'v': 'L'}, {'u': 'L', 'v': 'G'}, {'u': 'L', 'v': 'M'}]}","[['F', 'G', 'H', 'J', 'L'], ['A', 'B', 'C', 'D', 'E', 'I', 'K', 'M', 'N', 'O', 'P', 'Q', 'R', 'S']]",39,csv,names
MAXCUT,MAXCUT,"Many people on the program committee want two opposing panels that separate collaborators, so the job is to split the speakers into two groups with that in mind. The decision is who goes in Group 1 and who goes in Group 2; the only practical constraint is that every speaker must belong to one and only one group. A split is better if it leaves more collaborating pairs on opposite sides; to see which split is best, count how many pairs of collaborators are on different panels — higher count wins. The concrete speaker list and collaboration pairs are shown below.
{
""total_speakers"": 25,
""total_collaboration_pairs"": 50,
""edges"": [
{
""speaker_a"": 24,
""speaker_b"": 1
},
{
""speaker_a"": 24,
""speaker_b"": 16
},
{
""speaker_a"": 24,
""speaker_b"": 21
},
{
""speaker_a"": 1,
""speaker_b"": 2
},
{
""speaker_a"": 1,
""speaker_b"": 19
},
{
""speaker_a"": 1,
""speaker_b"": 21
},
{
""speaker_a"": 2,
""speaker_b"": 4
},
{
""speaker_a"": 2,
""speaker_b"": 16
},
{
""speaker_a"": 2,
""speaker_b"": 23
},
{
""speaker_a"": 15,
""speaker_b"": 4
},
{
""speaker_a"": 15,
""speaker_b"": 7
},
{
""speaker_a"": 15,
""speaker_b"": 12
},
{
""speaker_a"": 15,
""speaker_b"": 13
},
{
""speaker_a"": 16,
""speaker_b"": 23
},
{
""speaker_a"": 17,
""speaker_b"": 8
},
{
""speaker_a"": 17,
""speaker_b"": 18
},
{
""speaker_a"": 17,
""speaker_b"": 19
},
{
""speaker_a"": 17,
""speaker_b"": 21
},
{
""speaker_a"": 17,
""speaker_b"": 22
},
{
""speaker_a"": 18,
""speaker_b"": 6
},
{
""speaker_a"": 18,
""speaker_b"": 19
},
{
""speaker_a"": 10,
""speaker_b"": 3
},
{
""speaker_a"": 10,
""speaker_b"": 7
},
{
""speaker_a"": 10,
""speaker_b"": 9
},
{
""speaker_a"": 9,
""speaker_b"": 5
},
{
""speaker_a"": 9,
""speaker_b"": 7
},
{
""speaker_a"": 7,
""speaker_b"": 0
},
{
""speaker_a"": 7,
""speaker_b"": 3
},
{
""speaker_a"": 7,
""speaker_b"": 4
},
{
""speaker_a"": 7,
""speaker_b"": 5
},
{
""speaker_a"": 7,
""speaker_b"": 11
},
{
""speaker_a"": 7,
""speaker_b"": 12
},
{
""speaker_a"": 7,
""speaker_b"": 14
},
{
""speaker_a"": 7,
""speaker_b"": 20
},
{
""speaker_a"": 7,
""speaker_b"": 22
},
{
""speaker_a"": 7,
""speaker_b"": 23
},
{
""speaker_a"": 8,
""speaker_b"": 0
},
{
""speaker_a"": 8,
""speaker_b"": 6
},
{
""speaker_a"": 0,
""speaker_b"": 3
},
{
""speaker_a"": 0,
""speaker_b"": 22
},
{
""speaker_a"": 12,
""speaker_b"": 11
},
{
""speaker_a"": 12,
""speaker_b"": 13
},
{
""speaker_a"": 13,
""speaker_b"": 4
},
{
""speaker_a"": 13,
""speaker_b"": 11
},
{
""speaker_a"": 4,
""speaker_b"": 23
},
{
""speaker_a"": 3,
""speaker_b"": 6
},
{
""speaker_a"": 5,
""speaker_b"": 20
},
{
""speaker_a"": 14,
""speaker_b"": 20
},
{
""speaker_a"": 21,
""speaker_b"": 23
},
{
""speaker_a"": 22,
""speaker_b"": 23
}
]
}
If you want to hand me the split in a machine-friendly way, just follow this little JSON shape:
{
""solution"": [
[""speaker_id"", ""speaker_id"", ...],
[""speaker_id"", ""speaker_id"", ...]
]
}
The ""solution"" field holds two lists: the first list is everyone you put in Group 1, the second is everyone in Group 2. Each entry is a speaker identifier (just paste the exact ID from the instance). This is just a sketch of the expected shape — not 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': 'MAXCUT', 'num_nodes': 25, 'num_edges': 50, 'edges': [{'u': 25, 'v': 2}, {'u': 25, 'v': 17}, {'u': 25, 'v': 22}, {'u': 2, 'v': 3}, {'u': 2, 'v': 20}, {'u': 2, 'v': 22}, {'u': 3, 'v': 5}, {'u': 3, 'v': 17}, {'u': 3, 'v': 24}, {'u': 16, 'v': 5}, {'u': 16, 'v': 8}, {'u': 16, 'v': 13}, {'u': 16, 'v': 14}, {'u': 17, 'v': 24}, {'u': 18, 'v': 9}, {'u': 18, 'v': 19}, {'u': 18, 'v': 20}, {'u': 18, 'v': 22}, {'u': 18, 'v': 23}, {'u': 19, 'v': 7}, {'u': 19, 'v': 20}, {'u': 11, 'v': 4}, {'u': 11, 'v': 8}, {'u': 11, 'v': 10}, {'u': 10, 'v': 6}, {'u': 10, 'v': 8}, {'u': 8, 'v': 1}, {'u': 8, 'v': 4}, {'u': 8, 'v': 5}, {'u': 8, 'v': 6}, {'u': 8, 'v': 12}, {'u': 8, 'v': 13}, {'u': 8, 'v': 15}, {'u': 8, 'v': 21}, {'u': 8, 'v': 23}, {'u': 8, 'v': 24}, {'u': 9, 'v': 1}, {'u': 9, 'v': 7}, {'u': 1, 'v': 4}, {'u': 1, 'v': 23}, {'u': 13, 'v': 12}, {'u': 13, 'v': 14}, {'u': 14, 'v': 5}, {'u': 14, 'v': 12}, {'u': 5, 'v': 24}, {'u': 4, 'v': 7}, {'u': 6, 'v': 21}, {'u': 15, 'v': 21}, {'u': 22, 'v': 24}, {'u': 23, 'v': 24}], 'source_file': 'wi2010.mtx', 'density': 0.16666666666666666, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0039.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0039.png', 'edge_connectivity': 2}","[[3, 4, 8, 9, 10, 14, 16, 17, 19, 20, 21, 22, 23], [1, 2, 5, 6, 7, 11, 12, 13, 15, 18, 24, 25]]",39.0,"{'num_nodes': 25, 'num_edges': 50, 'edges': [{'u': 24, 'v': 1}, {'u': 24, 'v': 16}, {'u': 24, 'v': 21}, {'u': 1, 'v': 2}, {'u': 1, 'v': 19}, {'u': 1, 'v': 21}, {'u': 2, 'v': 4}, {'u': 2, 'v': 16}, {'u': 2, 'v': 23}, {'u': 15, 'v': 4}, {'u': 15, 'v': 7}, {'u': 15, 'v': 12}, {'u': 15, 'v': 13}, {'u': 16, 'v': 23}, {'u': 17, 'v': 8}, {'u': 17, 'v': 18}, {'u': 17, 'v': 19}, {'u': 17, 'v': 21}, {'u': 17, 'v': 22}, {'u': 18, 'v': 6}, {'u': 18, 'v': 19}, {'u': 10, 'v': 3}, {'u': 10, 'v': 7}, {'u': 10, 'v': 9}, {'u': 9, 'v': 5}, {'u': 9, 'v': 7}, {'u': 7, 'v': 0}, {'u': 7, 'v': 3}, {'u': 7, 'v': 4}, {'u': 7, 'v': 5}, {'u': 7, 'v': 11}, {'u': 7, 'v': 12}, {'u': 7, 'v': 14}, {'u': 7, 'v': 20}, {'u': 7, 'v': 22}, {'u': 7, 'v': 23}, {'u': 8, 'v': 0}, {'u': 8, 'v': 6}, {'u': 0, 'v': 3}, {'u': 0, 'v': 22}, {'u': 12, 'v': 11}, {'u': 12, 'v': 13}, {'u': 13, 'v': 4}, {'u': 13, 'v': 11}, {'u': 4, 'v': 23}, {'u': 3, 'v': 6}, {'u': 5, 'v': 20}, {'u': 14, 'v': 20}, {'u': 21, 'v': 23}, {'u': 22, 'v': 23}]}","[[2, 3, 7, 8, 9, 13, 15, 16, 18, 19, 20, 21, 22], [0, 1, 4, 5, 6, 10, 11, 12, 14, 17, 23, 24]]",40,json,0
MAXCUT,MAXCUT,"There’s a seating challenge at the reunion: two benches, a pile of relatives, and a decision to make for each person about which bench they take. The goal is to have as many pairs of relatives as possible sitting on different benches — judge any seating by counting how many related pairs are split. Everyone must be seated exactly once, with no repeats or omissions. The specific names and relationships are shown below.
There are 21 relatives in total and 39 related pairs.
| relative_a | relative_b |
|---|---|
| 19 | 2 |
| 19 | 6 |
| 19 | 9 |
| 19 | 11 |
| 19 | 17 |
| 6 | 1 |
| 6 | 2 |
| 6 | 11 |
| 7 | 12 |
| 7 | 21 |
| 4 | 10 |
| 4 | 21 |
| 18 | 1 |
| 18 | 5 |
| 18 | 13 |
| 18 | 15 |
| 13 | 1 |
| 13 | 10 |
| 13 | 16 |
| 13 | 21 |
| 3 | 9 |
| 3 | 17 |
| 3 | 20 |
| 5 | 1 |
| 5 | 2 |
| 14 | 8 |
| 14 | 12 |
| 17 | 2 |
| 17 | 9 |
| 10 | 15 |
| 11 | 1 |
| 11 | 9 |
| 11 | 16 |
| 11 | 20 |
| 12 | 8 |
| 12 | 20 |
| 20 | 8 |
| 20 | 16 |
| 20 | 21 |
If you want to give the seating as a quick snippet, here’s the simple JSON shape I’m expecting — two lists (one per bench) under the solution key.
{
""solution"": [
[""person_id"", ""person_id"", ...],
[""person_id"", ""person_id"", ...]
]
}
The first inner list is everyone sitting on the first bench, the second inner list is everyone on the other bench. The ""person_id"" items are just placeholders showing where each person's identifier goes — replace them with the exact IDs from the instance when you send the actual seating. This JSON is just a sketch of the shape I need, not the real 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': 'MAXCUT', 'num_nodes': 21, 'num_edges': 39, 'edges': [{'u': 19, 'v': 2}, {'u': 19, 'v': 6}, {'u': 19, 'v': 9}, {'u': 19, 'v': 11}, {'u': 19, 'v': 17}, {'u': 6, 'v': 1}, {'u': 6, 'v': 2}, {'u': 6, 'v': 11}, {'u': 7, 'v': 12}, {'u': 7, 'v': 21}, {'u': 4, 'v': 10}, {'u': 4, 'v': 21}, {'u': 18, 'v': 1}, {'u': 18, 'v': 5}, {'u': 18, 'v': 13}, {'u': 18, 'v': 15}, {'u': 13, 'v': 1}, {'u': 13, 'v': 10}, {'u': 13, 'v': 16}, {'u': 13, 'v': 21}, {'u': 3, 'v': 9}, {'u': 3, 'v': 17}, {'u': 3, 'v': 20}, {'u': 5, 'v': 1}, {'u': 5, 'v': 2}, {'u': 14, 'v': 8}, {'u': 14, 'v': 12}, {'u': 17, 'v': 2}, {'u': 17, 'v': 9}, {'u': 10, 'v': 15}, {'u': 11, 'v': 1}, {'u': 11, 'v': 9}, {'u': 11, 'v': 16}, {'u': 11, 'v': 20}, {'u': 12, 'v': 8}, {'u': 12, 'v': 20}, {'u': 20, 'v': 8}, {'u': 20, 'v': 16}, {'u': 20, 'v': 21}], 'source_file': 'wa2010.mtx', 'density': 0.18571428571428572, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0040.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0040.png', 'edge_connectivity': 2}","[[1, 2, 3, 8, 9, 10, 12, 16, 18, 19, 21], [4, 5, 6, 7, 11, 13, 14, 15, 17, 20]]",32.0,"{'num_nodes': 21, 'num_edges': 39, 'edges': [{'u': 19, 'v': 2}, {'u': 19, 'v': 6}, {'u': 19, 'v': 9}, {'u': 19, 'v': 11}, {'u': 19, 'v': 17}, {'u': 6, 'v': 1}, {'u': 6, 'v': 2}, {'u': 6, 'v': 11}, {'u': 7, 'v': 12}, {'u': 7, 'v': 21}, {'u': 4, 'v': 10}, {'u': 4, 'v': 21}, {'u': 18, 'v': 1}, {'u': 18, 'v': 5}, {'u': 18, 'v': 13}, {'u': 18, 'v': 15}, {'u': 13, 'v': 1}, {'u': 13, 'v': 10}, {'u': 13, 'v': 16}, {'u': 13, 'v': 21}, {'u': 3, 'v': 9}, {'u': 3, 'v': 17}, {'u': 3, 'v': 20}, {'u': 5, 'v': 1}, {'u': 5, 'v': 2}, {'u': 14, 'v': 8}, {'u': 14, 'v': 12}, {'u': 17, 'v': 2}, {'u': 17, 'v': 9}, {'u': 10, 'v': 15}, {'u': 11, 'v': 1}, {'u': 11, 'v': 9}, {'u': 11, 'v': 16}, {'u': 11, 'v': 20}, {'u': 12, 'v': 8}, {'u': 12, 'v': 20}, {'u': 20, 'v': 8}, {'u': 20, 'v': 16}, {'u': 20, 'v': 21}]}","[[1, 2, 3, 8, 9, 10, 12, 16, 18, 19, 21], [4, 5, 6, 7, 11, 13, 14, 15, 17, 20]]",41,markdown_table,1
MAXCUT,MAXCUT,"Out on the block there’s a team of volunteers and the plan is to run two opposing canvass routes; now someone has to sort everyone into one route or the other. Each volunteer needs to be placed on exactly one route (no omissions and no duplicate placements), and the aim is to arrange things so friends often end up on different routes. To judge any arrangement, count the number of friendly neighbor pairs that end up split between the two routes — the larger that count, the stronger the split. The exact roster and friendship connections follow below.
{
""num_volunteers"": 24,
""num_friendly_pairs"": 51,
""edges"": [
{
""volunteer_a_id"": 13,
""volunteer_b_id"": 4
},
{
""volunteer_a_id"": 13,
""volunteer_b_id"": 8
},
{
""volunteer_a_id"": 13,
""volunteer_b_id"": 15
},
{
""volunteer_a_id"": 13,
""volunteer_b_id"": 18
},
{
""volunteer_a_id"": 23,
""volunteer_b_id"": 3
},
{
""volunteer_a_id"": 23,
""volunteer_b_id"": 5
},
{
""volunteer_a_id"": 23,
""volunteer_b_id"": 11
},
{
""volunteer_a_id"": 23,
""volunteer_b_id"": 18
},
{
""volunteer_a_id"": 23,
""volunteer_b_id"": 24
},
{
""volunteer_a_id"": 14,
""volunteer_b_id"": 7
},
{
""volunteer_a_id"": 14,
""volunteer_b_id"": 15
},
{
""volunteer_a_id"": 3,
""volunteer_b_id"": 1
},
{
""volunteer_a_id"": 3,
""volunteer_b_id"": 2
},
{
""volunteer_a_id"": 3,
""volunteer_b_id"": 11
},
{
""volunteer_a_id"": 15,
""volunteer_b_id"": 7
},
{
""volunteer_a_id"": 15,
""volunteer_b_id"": 8
},
{
""volunteer_a_id"": 15,
""volunteer_b_id"": 16
},
{
""volunteer_a_id"": 15,
""volunteer_b_id"": 18
},
{
""volunteer_a_id"": 24,
""volunteer_b_id"": 1
},
{
""volunteer_a_id"": 24,
""volunteer_b_id"": 17
},
{
""volunteer_a_id"": 24,
""volunteer_b_id"": 18
},
{
""volunteer_a_id"": 20,
""volunteer_b_id"": 2
},
{
""volunteer_a_id"": 20,
""volunteer_b_id"": 6
},
{
""volunteer_a_id"": 20,
""volunteer_b_id"": 17
},
{
""volunteer_a_id"": 20,
""volunteer_b_id"": 18
},
{
""volunteer_a_id"": 21,
""volunteer_b_id"": 4
},
{
""volunteer_a_id"": 21,
""volunteer_b_id"": 18
},
{
""volunteer_a_id"": 21,
""volunteer_b_id"": 19
},
{
""volunteer_a_id"": 22,
""volunteer_b_id"": 4
},
{
""volunteer_a_id"": 22,
""volunteer_b_id"": 5
},
{
""volunteer_a_id"": 22,
""volunteer_b_id"": 10
},
{
""volunteer_a_id"": 1,
""volunteer_b_id"": 2
},
{
""volunteer_a_id"": 6,
""volunteer_b_id"": 2
},
{
""volunteer_a_id"": 6,
""volunteer_b_id"": 16
},
{
""volunteer_a_id"": 6,
""volunteer_b_id"": 18
},
{
""volunteer_a_id"": 18,
""volunteer_b_id"": 4
},
{
""volunteer_a_id"": 18,
""volunteer_b_id"": 5
},
{
""volunteer_a_id"": 18,
""volunteer_b_id"": 12
},
{
""volunteer_a_id"": 18,
""volunteer_b_id"": 16
},
{
""volunteer_a_id"": 18,
""volunteer_b_id"": 17
},
{
""volunteer_a_id"": 18,
""volunteer_b_id"": 19
},
{
""volunteer_a_id"": 2,
""volunteer_b_id"": 17
},
{
""volunteer_a_id"": 19,
""volunteer_b_id"": 9
},
{
""volunteer_a_id"": 9,
""volunteer_b_id"": 4
},
{
""volunteer_a_id"": 9,
""volunteer_b_id"": 5
},
{
""volunteer_a_id"": 8,
""volunteer_b_id"": 4
},
{
""volunteer_a_id"": 8,
""volunteer_b_id"": 7
},
{
""volunteer_a_id"": 4,
""volunteer_b_id"": 7
},
{
""volunteer_a_id"": 4,
""volunteer_b_id"": 10
},
{
""volunteer_a_id"": 5,
""volunteer_b_id"": 11
},
{
""volunteer_a_id"": 10,
""volunteer_b_id"": 7
}
]
}
Also, when you send the grouping back, keep it in this little JSON layout so it's easy to check:
{
""solution"": [
[""volunteer_id"", ""volunteer_id"", ...],
[""volunteer_id"", ""volunteer_id"", ...]
]
}
The first inner list is the folks assigned to one canvass route, the second list is the other route. Each string is a volunteer identifier — just list everyone once, and that's your proposed split. This is just the shape I need you to follow, not the actual final assignment.
Please make sure to use the exact identifiers 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': 'MAXCUT', 'num_nodes': 24, 'num_edges': 51, 'edges': [{'u': 13, 'v': 4}, {'u': 13, 'v': 8}, {'u': 13, 'v': 15}, {'u': 13, 'v': 18}, {'u': 23, 'v': 3}, {'u': 23, 'v': 5}, {'u': 23, 'v': 11}, {'u': 23, 'v': 18}, {'u': 23, 'v': 24}, {'u': 14, 'v': 7}, {'u': 14, 'v': 15}, {'u': 3, 'v': 1}, {'u': 3, 'v': 2}, {'u': 3, 'v': 11}, {'u': 15, 'v': 7}, {'u': 15, 'v': 8}, {'u': 15, 'v': 16}, {'u': 15, 'v': 18}, {'u': 24, 'v': 1}, {'u': 24, 'v': 17}, {'u': 24, 'v': 18}, {'u': 20, 'v': 2}, {'u': 20, 'v': 6}, {'u': 20, 'v': 17}, {'u': 20, 'v': 18}, {'u': 21, 'v': 4}, {'u': 21, 'v': 18}, {'u': 21, 'v': 19}, {'u': 22, 'v': 4}, {'u': 22, 'v': 5}, {'u': 22, 'v': 10}, {'u': 1, 'v': 2}, {'u': 6, 'v': 2}, {'u': 6, 'v': 16}, {'u': 6, 'v': 18}, {'u': 18, 'v': 4}, {'u': 18, 'v': 5}, {'u': 18, 'v': 12}, {'u': 18, 'v': 16}, {'u': 18, 'v': 17}, {'u': 18, 'v': 19}, {'u': 2, 'v': 17}, {'u': 19, 'v': 9}, {'u': 9, 'v': 4}, {'u': 9, 'v': 5}, {'u': 8, 'v': 4}, {'u': 8, 'v': 7}, {'u': 4, 'v': 7}, {'u': 4, 'v': 10}, {'u': 5, 'v': 11}, {'u': 10, 'v': 7}], 'source_file': 'wa2010.mtx', 'density': 0.18478260869565216, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0041.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0041.png', 'edge_connectivity': 1}","[[1, 6, 7, 8, 9, 11, 15, 17, 18, 21, 22, 23], [2, 3, 4, 5, 10, 12, 13, 14, 16, 19, 20, 24]]",38.0,"{'num_nodes': 24, 'num_edges': 51, 'edges': [{'u': 13, 'v': 4}, {'u': 13, 'v': 8}, {'u': 13, 'v': 15}, {'u': 13, 'v': 18}, {'u': 23, 'v': 3}, {'u': 23, 'v': 5}, {'u': 23, 'v': 11}, {'u': 23, 'v': 18}, {'u': 23, 'v': 24}, {'u': 14, 'v': 7}, {'u': 14, 'v': 15}, {'u': 3, 'v': 1}, {'u': 3, 'v': 2}, {'u': 3, 'v': 11}, {'u': 15, 'v': 7}, {'u': 15, 'v': 8}, {'u': 15, 'v': 16}, {'u': 15, 'v': 18}, {'u': 24, 'v': 1}, {'u': 24, 'v': 17}, {'u': 24, 'v': 18}, {'u': 20, 'v': 2}, {'u': 20, 'v': 6}, {'u': 20, 'v': 17}, {'u': 20, 'v': 18}, {'u': 21, 'v': 4}, {'u': 21, 'v': 18}, {'u': 21, 'v': 19}, {'u': 22, 'v': 4}, {'u': 22, 'v': 5}, {'u': 22, 'v': 10}, {'u': 1, 'v': 2}, {'u': 6, 'v': 2}, {'u': 6, 'v': 16}, {'u': 6, 'v': 18}, {'u': 18, 'v': 4}, {'u': 18, 'v': 5}, {'u': 18, 'v': 12}, {'u': 18, 'v': 16}, {'u': 18, 'v': 17}, {'u': 18, 'v': 19}, {'u': 2, 'v': 17}, {'u': 19, 'v': 9}, {'u': 9, 'v': 4}, {'u': 9, 'v': 5}, {'u': 8, 'v': 4}, {'u': 8, 'v': 7}, {'u': 4, 'v': 7}, {'u': 4, 'v': 10}, {'u': 5, 'v': 11}, {'u': 10, 'v': 7}]}","[[1, 6, 7, 8, 9, 11, 15, 17, 18, 21, 22, 23], [2, 3, 4, 5, 10, 12, 13, 14, 16, 19, 20, 24]]",42,json,1
MAXCUT,MAXCUT,"At the study site the coordinator has to divide the entire roster into two opposing cohorts using a list of who has been in contact with whom. The point is to separate as many known-contact pairs as possible between the two cohorts — measure a split by counting how many contact-pairs fall on opposite sides, and the split with the larger count wins. Every single participant must be assigned to one cohort only, with no repeats or omissions. The concrete participant list and contact pairs are provided below.
# total_participants=25
# contact_pairs_count=53
participant_a_id,participant_b_id
16,3
16,4
16,11
16,19
7,0
7,5
7,8
7,9
7,14
7,22
17,0
17,8
17,12
17,22
17,24
21,10
21,14
21,18
21,24
22,0
22,1
22,12
22,14
22,15
22,23
23,1
23,14
5,8
5,20
24,8
24,10
24,14
24,18
4,14
4,19
20,0
20,8
20,9
11,3
19,14
6,1
6,2
6,15
0,8
0,9
1,14
1,15
2,13
2,14
3,10
3,14
8,14
13,14
Also, when you send back the split, please use this simple JSON shape so it's easy to check automatically:
{
""solution"": [
[""vertex_id"", ""vertex_id"", ...],
[""vertex_id"", ""vertex_id"", ...]
]
}
Think of it like a form: ""solution"" holds two lists — the first list is everyone assigned to cohort A, the second list is everyone assigned to cohort B. Each entry is just the participant identifier exactly as given in the instance. This is just a sketch of the expected shape, not the actual answer.
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': 'MAXCUT', 'num_nodes': 25, 'num_edges': 53, 'edges': [{'u': 17, 'v': 4}, {'u': 17, 'v': 5}, {'u': 17, 'v': 12}, {'u': 17, 'v': 20}, {'u': 8, 'v': 1}, {'u': 8, 'v': 6}, {'u': 8, 'v': 9}, {'u': 8, 'v': 10}, {'u': 8, 'v': 15}, {'u': 8, 'v': 23}, {'u': 18, 'v': 1}, {'u': 18, 'v': 9}, {'u': 18, 'v': 13}, {'u': 18, 'v': 23}, {'u': 18, 'v': 25}, {'u': 22, 'v': 11}, {'u': 22, 'v': 15}, {'u': 22, 'v': 19}, {'u': 22, 'v': 25}, {'u': 23, 'v': 1}, {'u': 23, 'v': 2}, {'u': 23, 'v': 13}, {'u': 23, 'v': 15}, {'u': 23, 'v': 16}, {'u': 23, 'v': 24}, {'u': 24, 'v': 2}, {'u': 24, 'v': 15}, {'u': 6, 'v': 9}, {'u': 6, 'v': 21}, {'u': 25, 'v': 9}, {'u': 25, 'v': 11}, {'u': 25, 'v': 15}, {'u': 25, 'v': 19}, {'u': 5, 'v': 15}, {'u': 5, 'v': 20}, {'u': 21, 'v': 1}, {'u': 21, 'v': 9}, {'u': 21, 'v': 10}, {'u': 12, 'v': 4}, {'u': 20, 'v': 15}, {'u': 7, 'v': 2}, {'u': 7, 'v': 3}, {'u': 7, 'v': 16}, {'u': 1, 'v': 9}, {'u': 1, 'v': 10}, {'u': 2, 'v': 15}, {'u': 2, 'v': 16}, {'u': 3, 'v': 14}, {'u': 3, 'v': 15}, {'u': 4, 'v': 11}, {'u': 4, 'v': 15}, {'u': 9, 'v': 15}, {'u': 14, 'v': 15}], 'source_file': 'wi2010.mtx', 'density': 0.17666666666666667, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0042.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0042.png', 'edge_connectivity': 2}","[[6, 7, 9, 10, 11, 12, 15, 17, 18, 19, 23], [1, 2, 3, 4, 5, 8, 13, 14, 16, 20, 21, 22, 24, 25]]",40.0,"{'num_nodes': 25, 'num_edges': 53, 'edges': [{'u': 16, 'v': 3}, {'u': 16, 'v': 4}, {'u': 16, 'v': 11}, {'u': 16, 'v': 19}, {'u': 7, 'v': 0}, {'u': 7, 'v': 5}, {'u': 7, 'v': 8}, {'u': 7, 'v': 9}, {'u': 7, 'v': 14}, {'u': 7, 'v': 22}, {'u': 17, 'v': 0}, {'u': 17, 'v': 8}, {'u': 17, 'v': 12}, {'u': 17, 'v': 22}, {'u': 17, 'v': 24}, {'u': 21, 'v': 10}, {'u': 21, 'v': 14}, {'u': 21, 'v': 18}, {'u': 21, 'v': 24}, {'u': 22, 'v': 0}, {'u': 22, 'v': 1}, {'u': 22, 'v': 12}, {'u': 22, 'v': 14}, {'u': 22, 'v': 15}, {'u': 22, 'v': 23}, {'u': 23, 'v': 1}, {'u': 23, 'v': 14}, {'u': 5, 'v': 8}, {'u': 5, 'v': 20}, {'u': 24, 'v': 8}, {'u': 24, 'v': 10}, {'u': 24, 'v': 14}, {'u': 24, 'v': 18}, {'u': 4, 'v': 14}, {'u': 4, 'v': 19}, {'u': 20, 'v': 0}, {'u': 20, 'v': 8}, {'u': 20, 'v': 9}, {'u': 11, 'v': 3}, {'u': 19, 'v': 14}, {'u': 6, 'v': 1}, {'u': 6, 'v': 2}, {'u': 6, 'v': 15}, {'u': 0, 'v': 8}, {'u': 0, 'v': 9}, {'u': 1, 'v': 14}, {'u': 1, 'v': 15}, {'u': 2, 'v': 13}, {'u': 2, 'v': 14}, {'u': 3, 'v': 10}, {'u': 3, 'v': 14}, {'u': 8, 'v': 14}, {'u': 13, 'v': 14}]}","[[5, 6, 8, 9, 10, 11, 14, 16, 17, 18, 22], [0, 1, 2, 3, 4, 7, 12, 13, 15, 19, 20, 21, 23, 24]]",43,csv,0
MAXCUT,MAXCUT,"Someone on the planning team wants the acts split between two stages so that connected duos and groups are mostly performing on opposite stages — the task is to decide which stage each performer will get. The way to judge any arrangement is simple: count the performer pairs from the list that end up on different stages; the higher that number, the better the split. Each performer needs to be placed exactly once, with no duplicates or omissions. The concrete performer list and pairings follow below.
{
""num_performers"": 21,
""num_performer_pairs"": 43,
""edges"": [
{
""performer_a"": ""E"",
""performer_b"": ""H""
},
{
""performer_a"": ""E"",
""performer_b"": ""I""
},
{
""performer_a"": ""E"",
""performer_b"": ""J""
},
{
""performer_a"": ""H"",
""performer_b"": ""A""
},
{
""performer_a"": ""H"",
""performer_b"": ""B""
},
{
""performer_a"": ""H"",
""performer_b"": ""I""
},
{
""performer_a"": ""H"",
""performer_b"": ""J""
},
{
""performer_a"": ""H"",
""performer_b"": ""K""
},
{
""performer_a"": ""H"",
""performer_b"": ""L""
},
{
""performer_a"": ""H"",
""performer_b"": ""R""
},
{
""performer_a"": ""H"",
""performer_b"": ""S""
},
{
""performer_a"": ""H"",
""performer_b"": ""T""
},
{
""performer_a"": ""H"",
""performer_b"": ""U""
},
{
""performer_a"": ""C"",
""performer_b"": ""F""
},
{
""performer_a"": ""C"",
""performer_b"": ""G""
},
{
""performer_a"": ""C"",
""performer_b"": ""I""
},
{
""performer_a"": ""C"",
""performer_b"": ""O""
},
{
""performer_a"": ""C"",
""performer_b"": ""T""
},
{
""performer_a"": ""U"",
""performer_b"": ""A""
},
{
""performer_a"": ""N"",
""performer_b"": ""O""
},
{
""performer_a"": ""N"",
""performer_b"": ""R""
},
{
""performer_a"": ""J"",
""performer_b"": ""B""
},
{
""performer_a"": ""J"",
""performer_b"": ""G""
},
{
""performer_a"": ""J"",
""performer_b"": ""I""
},
{
""performer_a"": ""J"",
""performer_b"": ""M""
},
{
""performer_a"": ""J"",
""performer_b"": ""Q""
},
{
""performer_a"": ""J"",
""performer_b"": ""S""
},
{
""performer_a"": ""J"",
""performer_b"": ""T""
},
{
""performer_a"": ""P"",
""performer_b"": ""R""
},
{
""performer_a"": ""P"",
""performer_b"": ""T""
},
{
""performer_a"": ""Q"",
""performer_b"": ""S""
},
{
""performer_a"": ""Q"",
""performer_b"": ""T""
},
{
""performer_a"": ""T"",
""performer_b"": ""G""
},
{
""performer_a"": ""T"",
""performer_b"": ""M""
},
{
""performer_a"": ""T"",
""performer_b"": ""O""
},
{
""performer_a"": ""T"",
""performer_b"": ""R""
},
{
""performer_a"": ""T"",
""performer_b"": ""S""
},
{
""performer_a"": ""G"",
""performer_b"": ""I""
},
{
""performer_a"": ""B"",
""performer_b"": ""S""
},
{
""performer_a"": ""I"",
""performer_b"": ""D""
},
{
""performer_a"": ""I"",
""performer_b"": ""K""
},
{
""performer_a"": ""A"",
""performer_b"": ""K""
},
{
""performer_a"": ""O"",
""performer_b"": ""R""
}
]
}
You can just reply with a small JSON object showing which performers go on each stage. Something like this is the shape I expect:
{
""solution"": [
[""performer_id"", ""performer_id"", ...],
[""performer_id"", ""performer_id"", ...]
]
}
The first inner list is everyone assigned to one stage, and the second inner list is everyone assigned to the other stage. Think of it like a simple sign-up sheet — each performer appears exactly once, and the two lists together are the full lineup. This JSON is just a sketch of the format I need, not the actual assignment.
Please make sure to use the performer 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': 'MAXCUT', 'num_nodes': 21, 'num_edges': 43, 'edges': [{'u': 5, 'v': 8}, {'u': 5, 'v': 9}, {'u': 5, 'v': 10}, {'u': 8, 'v': 1}, {'u': 8, 'v': 2}, {'u': 8, 'v': 9}, {'u': 8, 'v': 10}, {'u': 8, 'v': 11}, {'u': 8, 'v': 12}, {'u': 8, 'v': 18}, {'u': 8, 'v': 19}, {'u': 8, 'v': 20}, {'u': 8, 'v': 21}, {'u': 3, 'v': 6}, {'u': 3, 'v': 7}, {'u': 3, 'v': 9}, {'u': 3, 'v': 15}, {'u': 3, 'v': 20}, {'u': 21, 'v': 1}, {'u': 14, 'v': 15}, {'u': 14, 'v': 18}, {'u': 10, 'v': 2}, {'u': 10, 'v': 7}, {'u': 10, 'v': 9}, {'u': 10, 'v': 13}, {'u': 10, 'v': 17}, {'u': 10, 'v': 19}, {'u': 10, 'v': 20}, {'u': 16, 'v': 18}, {'u': 16, 'v': 20}, {'u': 17, 'v': 19}, {'u': 17, 'v': 20}, {'u': 20, 'v': 7}, {'u': 20, 'v': 13}, {'u': 20, 'v': 15}, {'u': 20, 'v': 18}, {'u': 20, 'v': 19}, {'u': 7, 'v': 9}, {'u': 2, 'v': 19}, {'u': 9, 'v': 4}, {'u': 9, 'v': 11}, {'u': 1, 'v': 11}, {'u': 15, 'v': 18}], 'source_file': 'wy2010.mtx', 'density': 0.20476190476190476, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0043.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0043.png', 'edge_connectivity': 1}","[[1, 6, 7, 8, 9, 13, 14, 15, 16, 17, 19], [2, 3, 4, 5, 10, 11, 12, 18, 20, 21]]",32.0,"{'num_nodes': 21, 'num_edges': 43, 'edges': [{'u': 'E', 'v': 'H'}, {'u': 'E', 'v': 'I'}, {'u': 'E', 'v': 'J'}, {'u': 'H', 'v': 'A'}, {'u': 'H', 'v': 'B'}, {'u': 'H', 'v': 'I'}, {'u': 'H', 'v': 'J'}, {'u': 'H', 'v': 'K'}, {'u': 'H', 'v': 'L'}, {'u': 'H', 'v': 'R'}, {'u': 'H', 'v': 'S'}, {'u': 'H', 'v': 'T'}, {'u': 'H', 'v': 'U'}, {'u': 'C', 'v': 'F'}, {'u': 'C', 'v': 'G'}, {'u': 'C', 'v': 'I'}, {'u': 'C', 'v': 'O'}, {'u': 'C', 'v': 'T'}, {'u': 'U', 'v': 'A'}, {'u': 'N', 'v': 'O'}, {'u': 'N', 'v': 'R'}, {'u': 'J', 'v': 'B'}, {'u': 'J', 'v': 'G'}, {'u': 'J', 'v': 'I'}, {'u': 'J', 'v': 'M'}, {'u': 'J', 'v': 'Q'}, {'u': 'J', 'v': 'S'}, {'u': 'J', 'v': 'T'}, {'u': 'P', 'v': 'R'}, {'u': 'P', 'v': 'T'}, {'u': 'Q', 'v': 'S'}, {'u': 'Q', 'v': 'T'}, {'u': 'T', 'v': 'G'}, {'u': 'T', 'v': 'M'}, {'u': 'T', 'v': 'O'}, {'u': 'T', 'v': 'R'}, {'u': 'T', 'v': 'S'}, {'u': 'G', 'v': 'I'}, {'u': 'B', 'v': 'S'}, {'u': 'I', 'v': 'D'}, {'u': 'I', 'v': 'K'}, {'u': 'A', 'v': 'K'}, {'u': 'O', 'v': 'R'}]}","[['A', 'F', 'G', 'H', 'I', 'M', 'N', 'O', 'P', 'Q', 'S'], ['B', 'C', 'D', 'E', 'J', 'K', 'L', 'R', 'T', 'U']]",44,json,names
MAXCUT,MAXCUT,"Recently the team set up two review groups and needed to figure out who goes where: everyone has to be assigned to one of the two groups, and the point is to arrange the split so that the greatest number of known collaborator pairs end up separated between the groups. The decision is purely who joins which group, and what makes one arrangement superior is that it splits more of those pairs. To judge any arrangement, count the number of pairs that ended up on opposite sides — a bigger count means a better split. No contributor should be omitted or put into both groups. The detailed list of contributors and their pairings is shown below.
{
""total_contributors"": 23,
""total_collaboration_pairs"": 43,
""edges"": [
{
""contributor_a"": ""W"",
""contributor_b"": ""C""
},
{
""contributor_a"": ""W"",
""contributor_b"": ""I""
},
{
""contributor_a"": ""W"",
""contributor_b"": ""K""
},
{
""contributor_a"": ""W"",
""contributor_b"": ""N""
},
{
""contributor_a"": ""W"",
""contributor_b"": ""R""
},
{
""contributor_a"": ""W"",
""contributor_b"": ""V""
},
{
""contributor_a"": ""L"",
""contributor_b"": ""O""
},
{
""contributor_a"": ""L"",
""contributor_b"": ""R""
},
{
""contributor_a"": ""L"",
""contributor_b"": ""U""
},
{
""contributor_a"": ""U"",
""contributor_b"": ""D""
},
{
""contributor_a"": ""U"",
""contributor_b"": ""M""
},
{
""contributor_a"": ""U"",
""contributor_b"": ""O""
},
{
""contributor_a"": ""U"",
""contributor_b"": ""R""
},
{
""contributor_a"": ""A"",
""contributor_b"": ""P""
},
{
""contributor_a"": ""A"",
""contributor_b"": ""Q""
},
{
""contributor_a"": ""B"",
""contributor_b"": ""C""
},
{
""contributor_a"": ""B"",
""contributor_b"": ""J""
},
{
""contributor_a"": ""B"",
""contributor_b"": ""Q""
},
{
""contributor_a"": ""B"",
""contributor_b"": ""V""
},
{
""contributor_a"": ""C"",
""contributor_b"": ""J""
},
{
""contributor_a"": ""C"",
""contributor_b"": ""T""
},
{
""contributor_a"": ""G"",
""contributor_b"": ""D""
},
{
""contributor_a"": ""G"",
""contributor_b"": ""H""
},
{
""contributor_a"": ""G"",
""contributor_b"": ""P""
},
{
""contributor_a"": ""H"",
""contributor_b"": ""E""
},
{
""contributor_a"": ""H"",
""contributor_b"": ""R""
},
{
""contributor_a"": ""I"",
""contributor_b"": ""E""
},
{
""contributor_a"": ""I"",
""contributor_b"": ""R""
},
{
""contributor_a"": ""I"",
""contributor_b"": ""S""
},
{
""contributor_a"": ""O"",
""contributor_b"": ""F""
},
{
""contributor_a"": ""O"",
""contributor_b"": ""R""
},
{
""contributor_a"": ""D"",
""contributor_b"": ""M""
},
{
""contributor_a"": ""D"",
""contributor_b"": ""R""
},
{
""contributor_a"": ""E"",
""contributor_b"": ""P""
},
{
""contributor_a"": ""E"",
""contributor_b"": ""Q""
},
{
""contributor_a"": ""E"",
""contributor_b"": ""S""
},
{
""contributor_a"": ""K"",
""contributor_b"": ""F""
},
{
""contributor_a"": ""K"",
""contributor_b"": ""T""
},
{
""contributor_a"": ""F"",
""contributor_b"": ""N""
},
{
""contributor_a"": ""Q"",
""contributor_b"": ""V""
},
{
""contributor_a"": ""R"",
""contributor_b"": ""M""
},
{
""contributor_a"": ""R"",
""contributor_b"": ""N""
},
{
""contributor_a"": ""S"",
""contributor_b"": ""V""
}
]
}
Oh — and when you send back the split, please use this simple JSON layout so it's easy to check automatically. Something like:
{
""solution"": [
[""contributor_id"", ""contributor_id"", ...],
[""contributor_id"", ""contributor_id"", ...]
]
}
Here the two inner lists are the two review groups, and each placeholder like ""contributor_id"" stands for one person’s identifier from the instance. Think of it like a little form: list who goes in group one, then list who goes in group two. This is just the shape I need, not the actual grouping — you'll fill in the real IDs.
Please make sure to use the exact identifiers from the instance input — do not rename them or introduce 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': 'MAXCUT', 'num_nodes': 23, 'num_edges': 43, 'edges': [{'u': 23, 'v': 3}, {'u': 23, 'v': 9}, {'u': 23, 'v': 11}, {'u': 23, 'v': 14}, {'u': 23, 'v': 18}, {'u': 23, 'v': 22}, {'u': 12, 'v': 15}, {'u': 12, 'v': 18}, {'u': 12, 'v': 21}, {'u': 21, 'v': 4}, {'u': 21, 'v': 13}, {'u': 21, 'v': 15}, {'u': 21, 'v': 18}, {'u': 1, 'v': 16}, {'u': 1, 'v': 17}, {'u': 2, 'v': 3}, {'u': 2, 'v': 10}, {'u': 2, 'v': 17}, {'u': 2, 'v': 22}, {'u': 3, 'v': 10}, {'u': 3, 'v': 20}, {'u': 7, 'v': 4}, {'u': 7, 'v': 8}, {'u': 7, 'v': 16}, {'u': 8, 'v': 5}, {'u': 8, 'v': 18}, {'u': 9, 'v': 5}, {'u': 9, 'v': 18}, {'u': 9, 'v': 19}, {'u': 15, 'v': 6}, {'u': 15, 'v': 18}, {'u': 4, 'v': 13}, {'u': 4, 'v': 18}, {'u': 5, 'v': 16}, {'u': 5, 'v': 17}, {'u': 5, 'v': 19}, {'u': 11, 'v': 6}, {'u': 11, 'v': 20}, {'u': 6, 'v': 14}, {'u': 17, 'v': 22}, {'u': 18, 'v': 13}, {'u': 18, 'v': 14}, {'u': 19, 'v': 22}], 'source_file': 'wy2010.mtx', 'density': 0.16996047430830039, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0044.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0044.png', 'edge_connectivity': 2}","[[3, 4, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 22], [1, 2, 5, 6, 7, 18, 19, 20, 21, 23]]",36.0,"{'num_nodes': 23, 'num_edges': 43, 'edges': [{'u': 'W', 'v': 'C'}, {'u': 'W', 'v': 'I'}, {'u': 'W', 'v': 'K'}, {'u': 'W', 'v': 'N'}, {'u': 'W', 'v': 'R'}, {'u': 'W', 'v': 'V'}, {'u': 'L', 'v': 'O'}, {'u': 'L', 'v': 'R'}, {'u': 'L', 'v': 'U'}, {'u': 'U', 'v': 'D'}, {'u': 'U', 'v': 'M'}, {'u': 'U', 'v': 'O'}, {'u': 'U', 'v': 'R'}, {'u': 'A', 'v': 'P'}, {'u': 'A', 'v': 'Q'}, {'u': 'B', 'v': 'C'}, {'u': 'B', 'v': 'J'}, {'u': 'B', 'v': 'Q'}, {'u': 'B', 'v': 'V'}, {'u': 'C', 'v': 'J'}, {'u': 'C', 'v': 'T'}, {'u': 'G', 'v': 'D'}, {'u': 'G', 'v': 'H'}, {'u': 'G', 'v': 'P'}, {'u': 'H', 'v': 'E'}, {'u': 'H', 'v': 'R'}, {'u': 'I', 'v': 'E'}, {'u': 'I', 'v': 'R'}, {'u': 'I', 'v': 'S'}, {'u': 'O', 'v': 'F'}, {'u': 'O', 'v': 'R'}, {'u': 'D', 'v': 'M'}, {'u': 'D', 'v': 'R'}, {'u': 'E', 'v': 'P'}, {'u': 'E', 'v': 'Q'}, {'u': 'E', 'v': 'S'}, {'u': 'K', 'v': 'F'}, {'u': 'K', 'v': 'T'}, {'u': 'F', 'v': 'N'}, {'u': 'Q', 'v': 'V'}, {'u': 'R', 'v': 'M'}, {'u': 'R', 'v': 'N'}, {'u': 'S', 'v': 'V'}]}","[['C', 'D', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'V'], ['A', 'B', 'E', 'F', 'G', 'R', 'S', 'T', 'U', 'W']]",45,json,names
MAXCUT,MAXCUT,"I was thinking about a little retail puzzle: a bunch of products need to be split between the left and right sides of a shop, and some products are known to be paired together (people often buy them together). The task is to decide which side each product goes on so that as many of those paired items as possible end up on opposite sides. The way to tell if one layout is better than another is straightforward — count how many of the known pairs sit on different sides — higher counts are better. Every product has to be placed on one side or the other, nothing gets skipped or copied. The concrete list of products and pairings is shown below.
There are 20 products in total and 43 product pairs.
| product_a_id | product_b_id |
|---|---|
| C | E |
| C | F |
| C | H |
| C | J |
| C | K |
| C | N |
| C | S |
| G | F |
| G | J |
| G | M |
| G | O |
| G | R |
| A | D |
| A | I |
| A | L |
| A | Q |
| P | D |
| P | F |
| P | K |
| P | R |
| L | B |
| L | I |
| L | Q |
| O | J |
| O | R |
| Q | R |
| K | D |
| K | F |
| K | I |
| J | F |
| N | R |
| N | S |
| I | H |
| R | B |
| R | D |
| R | E |
| R | F |
| R | M |
| R | S |
| R | T |
| S | E |
| E | T |
| F | M |
If you want to send the layout back, just use a tiny JSON snippet with the two sides listed. Something like this:
{
""solution"": [
[""product_id"", ""product_id"", ...],
[""product_id"", ""product_id"", ...]
]
}
Pretty simple: the outer ""solution"" is a pair of lists — the first inner list is everything you put on the left side, the second inner list is everything on the right side. Put each product's identifier (exactly as it appears in the instance) into one of the lists. This JSON is just a sketch of the shape I expect, not the actual placement.
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': 'MAXCUT', 'num_nodes': 20, 'num_edges': 43, 'edges': [{'u': 3, 'v': 5}, {'u': 3, 'v': 6}, {'u': 3, 'v': 8}, {'u': 3, 'v': 10}, {'u': 3, 'v': 11}, {'u': 3, 'v': 14}, {'u': 3, 'v': 19}, {'u': 7, 'v': 6}, {'u': 7, 'v': 10}, {'u': 7, 'v': 13}, {'u': 7, 'v': 15}, {'u': 7, 'v': 18}, {'u': 1, 'v': 4}, {'u': 1, 'v': 9}, {'u': 1, 'v': 12}, {'u': 1, 'v': 17}, {'u': 16, 'v': 4}, {'u': 16, 'v': 6}, {'u': 16, 'v': 11}, {'u': 16, 'v': 18}, {'u': 12, 'v': 2}, {'u': 12, 'v': 9}, {'u': 12, 'v': 17}, {'u': 15, 'v': 10}, {'u': 15, 'v': 18}, {'u': 17, 'v': 18}, {'u': 11, 'v': 4}, {'u': 11, 'v': 6}, {'u': 11, 'v': 9}, {'u': 10, 'v': 6}, {'u': 14, 'v': 18}, {'u': 14, 'v': 19}, {'u': 9, 'v': 8}, {'u': 18, 'v': 2}, {'u': 18, 'v': 4}, {'u': 18, 'v': 5}, {'u': 18, 'v': 6}, {'u': 18, 'v': 13}, {'u': 18, 'v': 19}, {'u': 18, 'v': 20}, {'u': 19, 'v': 5}, {'u': 5, 'v': 20}, {'u': 6, 'v': 13}], 'source_file': 'wi2010.mtx', 'density': 0.22631578947368422, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0045.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0045.png', 'edge_connectivity': 2}","[[2, 3, 4, 6, 7, 9, 15, 16, 17, 19, 20], [1, 5, 8, 10, 11, 12, 13, 14, 18]]",33.0,"{'num_nodes': 20, 'num_edges': 43, 'edges': [{'u': 'C', 'v': 'E'}, {'u': 'C', 'v': 'F'}, {'u': 'C', 'v': 'H'}, {'u': 'C', 'v': 'J'}, {'u': 'C', 'v': 'K'}, {'u': 'C', 'v': 'N'}, {'u': 'C', 'v': 'S'}, {'u': 'G', 'v': 'F'}, {'u': 'G', 'v': 'J'}, {'u': 'G', 'v': 'M'}, {'u': 'G', 'v': 'O'}, {'u': 'G', 'v': 'R'}, {'u': 'A', 'v': 'D'}, {'u': 'A', 'v': 'I'}, {'u': 'A', 'v': 'L'}, {'u': 'A', 'v': 'Q'}, {'u': 'P', 'v': 'D'}, {'u': 'P', 'v': 'F'}, {'u': 'P', 'v': 'K'}, {'u': 'P', 'v': 'R'}, {'u': 'L', 'v': 'B'}, {'u': 'L', 'v': 'I'}, {'u': 'L', 'v': 'Q'}, {'u': 'O', 'v': 'J'}, {'u': 'O', 'v': 'R'}, {'u': 'Q', 'v': 'R'}, {'u': 'K', 'v': 'D'}, {'u': 'K', 'v': 'F'}, {'u': 'K', 'v': 'I'}, {'u': 'J', 'v': 'F'}, {'u': 'N', 'v': 'R'}, {'u': 'N', 'v': 'S'}, {'u': 'I', 'v': 'H'}, {'u': 'R', 'v': 'B'}, {'u': 'R', 'v': 'D'}, {'u': 'R', 'v': 'E'}, {'u': 'R', 'v': 'F'}, {'u': 'R', 'v': 'M'}, {'u': 'R', 'v': 'S'}, {'u': 'R', 'v': 'T'}, {'u': 'S', 'v': 'E'}, {'u': 'E', 'v': 'T'}, {'u': 'F', 'v': 'M'}]}","[['B', 'C', 'D', 'F', 'G', 'I', 'O', 'P', 'Q', 'S', 'T'], ['A', 'E', 'H', 'J', 'K', 'L', 'M', 'N', 'R']]",46,markdown_table,names
MAXCUT,MAXCUT,"I’m helping organize a book club exercise where everyone splits into two opposite discussion circles, and the fun is in trying to separate as many friend-pairs as possible — you pick which circle each reader goes to, making sure every person is in exactly one circle and nobody is duplicated or left out, and the score is just how many pairs of readers end up in different circles; the exact list of members and their pairings is shown below.
# total_readers=22
# total_friend_pairs=39
reader_id_a,reader_id_b
H,J
H,Q
G,J
G,L
G,O
G,Q
S,F
S,J
S,P
S,T
D,J
D,U
A,B
A,R
N,E
N,V
L,C
L,E
L,J
L,M
L,U
P,J
P,R
P,T
T,F
B,I
B,J
B,U
U,E
V,E
V,O
Q,O
C,E
K,F
K,J
I,E
J,F
J,R
O,E
If you want to hand back a proposed split, just use this small JSON layout so it's easy to read and check:
{
""solution"": [
[""reader_id"", ""reader_id"", ...],
[""reader_id"", ""reader_id"", ...]
]
}
Think of it like a simple form: ""solution"" holds two lists — the first list is everyone you put in one circle, the second list is everyone in the opposite circle. Each entry is a reader identifier (leave them as they appear in the instance).
This is just a sketch of the shape I need, not the actual answer — please fill in the real identifiers from the instance.
Please make sure you use the identifiers exactly as they appear in the 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': 'MAXCUT', 'num_nodes': 22, 'num_edges': 39, 'edges': [{'u': 8, 'v': 10}, {'u': 8, 'v': 17}, {'u': 7, 'v': 10}, {'u': 7, 'v': 12}, {'u': 7, 'v': 15}, {'u': 7, 'v': 17}, {'u': 19, 'v': 6}, {'u': 19, 'v': 10}, {'u': 19, 'v': 16}, {'u': 19, 'v': 20}, {'u': 4, 'v': 10}, {'u': 4, 'v': 21}, {'u': 1, 'v': 2}, {'u': 1, 'v': 18}, {'u': 14, 'v': 5}, {'u': 14, 'v': 22}, {'u': 12, 'v': 3}, {'u': 12, 'v': 5}, {'u': 12, 'v': 10}, {'u': 12, 'v': 13}, {'u': 12, 'v': 21}, {'u': 16, 'v': 10}, {'u': 16, 'v': 18}, {'u': 16, 'v': 20}, {'u': 20, 'v': 6}, {'u': 2, 'v': 9}, {'u': 2, 'v': 10}, {'u': 2, 'v': 21}, {'u': 21, 'v': 5}, {'u': 22, 'v': 5}, {'u': 22, 'v': 15}, {'u': 17, 'v': 15}, {'u': 3, 'v': 5}, {'u': 11, 'v': 6}, {'u': 11, 'v': 10}, {'u': 9, 'v': 5}, {'u': 10, 'v': 6}, {'u': 10, 'v': 18}, {'u': 15, 'v': 5}], 'source_file': 'wa2010.mtx', 'density': 0.16883116883116883, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0046.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0046.png', 'edge_connectivity': 1}","[[1, 3, 6, 9, 10, 13, 14, 15, 16, 17, 21], [2, 4, 5, 7, 8, 11, 12, 18, 19, 20, 22]]",32.0,"{'num_nodes': 22, 'num_edges': 39, 'edges': [{'u': 'H', 'v': 'J'}, {'u': 'H', 'v': 'Q'}, {'u': 'G', 'v': 'J'}, {'u': 'G', 'v': 'L'}, {'u': 'G', 'v': 'O'}, {'u': 'G', 'v': 'Q'}, {'u': 'S', 'v': 'F'}, {'u': 'S', 'v': 'J'}, {'u': 'S', 'v': 'P'}, {'u': 'S', 'v': 'T'}, {'u': 'D', 'v': 'J'}, {'u': 'D', 'v': 'U'}, {'u': 'A', 'v': 'B'}, {'u': 'A', 'v': 'R'}, {'u': 'N', 'v': 'E'}, {'u': 'N', 'v': 'V'}, {'u': 'L', 'v': 'C'}, {'u': 'L', 'v': 'E'}, {'u': 'L', 'v': 'J'}, {'u': 'L', 'v': 'M'}, {'u': 'L', 'v': 'U'}, {'u': 'P', 'v': 'J'}, {'u': 'P', 'v': 'R'}, {'u': 'P', 'v': 'T'}, {'u': 'T', 'v': 'F'}, {'u': 'B', 'v': 'I'}, {'u': 'B', 'v': 'J'}, {'u': 'B', 'v': 'U'}, {'u': 'U', 'v': 'E'}, {'u': 'V', 'v': 'E'}, {'u': 'V', 'v': 'O'}, {'u': 'Q', 'v': 'O'}, {'u': 'C', 'v': 'E'}, {'u': 'K', 'v': 'F'}, {'u': 'K', 'v': 'J'}, {'u': 'I', 'v': 'E'}, {'u': 'J', 'v': 'F'}, {'u': 'J', 'v': 'R'}, {'u': 'O', 'v': 'E'}]}","[['A', 'C', 'F', 'I', 'J', 'M', 'N', 'O', 'P', 'Q', 'U'], ['B', 'D', 'E', 'G', 'H', 'K', 'L', 'R', 'S', 'T', 'V']]",47,csv,names
MAXCUT,MAXCUT,"The organizers sketched out a plan to put fans into two opposing stands so that a maximum number of specified fan-pairs would be separated across the field. For any seating plan, you count how many of the listed pairs end up on opposite stands — that count is the measure of how good the plan is. It’s important that each fan is assigned to exactly one stand, with nobody assigned twice or forgotten. The exact list of fans and which pairs matter will be shown below.
There are 25 total fans and 51 specified pairs; assign each fan to exactly one of the two opposing stands and the score is the number of listed pairs seated on opposite stands.
Fans 12 and 10 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 12 and 16 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 5 and 1 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 5 and 3 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 5 and 6 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 5 and 16 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 21 and 9 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 21 and 13 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 21 and 16 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 21 and 25 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 8 and 13 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 8 and 14 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 8 and 15 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 8 and 18 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 8 and 22 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 22 and 15 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 22 and 19 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 23 and 4 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 23 and 15 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 23 and 16 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 23 and 18 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 11 and 15 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 11 and 17 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 11 and 20 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 11 and 24 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 24 and 15 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 24 and 20 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 9 and 13 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 9 and 16 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 10 and 16 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 10 and 25 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 16 and 3 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 16 and 7 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 16 and 13 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 16 and 18 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 16 and 25 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 25 and 13 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 13 and 14 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 13 and 18 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 15 and 2 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 15 and 3 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 15 and 17 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 15 and 18 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 15 and 19 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 15 and 20 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 17 and 20 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 7 and 6 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 3 and 1 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 3 and 2 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 3 and 4 form a specified pair — they contribute 1 if seated on opposite stands.
Fans 3 and 6 form a specified pair — they contribute 1 if seated on opposite stands.
Count each listed pair that ends up on opposite stands to compute the final score.
Oh, and when you send me the seating plan, please stick to this simple JSON shape so I can read it easily:
{
""solution"": [
[""fan_id"", ""fan_id"", ...],
[""fan_id"", ""fan_id"", ...]
]
}
Think of the two inner lists as the two stands — just list which fan IDs sit in the left stand and which sit in the right stand. This is just a sketch of the expected shape, not the actual answer itself.
Please make sure you use the exact identifiers from the instance input — don't rename them or invent new ones.
- for example: ""Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.""","{'problem_type': 'MAXCUT', 'num_nodes': 25, 'num_edges': 51, 'edges': [{'u': 12, 'v': 10}, {'u': 12, 'v': 16}, {'u': 5, 'v': 1}, {'u': 5, 'v': 3}, {'u': 5, 'v': 6}, {'u': 5, 'v': 16}, {'u': 21, 'v': 9}, {'u': 21, 'v': 13}, {'u': 21, 'v': 16}, {'u': 21, 'v': 25}, {'u': 8, 'v': 13}, {'u': 8, 'v': 14}, {'u': 8, 'v': 15}, {'u': 8, 'v': 18}, {'u': 8, 'v': 22}, {'u': 22, 'v': 15}, {'u': 22, 'v': 19}, {'u': 23, 'v': 4}, {'u': 23, 'v': 15}, {'u': 23, 'v': 16}, {'u': 23, 'v': 18}, {'u': 11, 'v': 15}, {'u': 11, 'v': 17}, {'u': 11, 'v': 20}, {'u': 11, 'v': 24}, {'u': 24, 'v': 15}, {'u': 24, 'v': 20}, {'u': 9, 'v': 13}, {'u': 9, 'v': 16}, {'u': 10, 'v': 16}, {'u': 10, 'v': 25}, {'u': 16, 'v': 3}, {'u': 16, 'v': 7}, {'u': 16, 'v': 13}, {'u': 16, 'v': 18}, {'u': 16, 'v': 25}, {'u': 25, 'v': 13}, {'u': 13, 'v': 14}, {'u': 13, 'v': 18}, {'u': 15, 'v': 2}, {'u': 15, 'v': 3}, {'u': 15, 'v': 17}, {'u': 15, 'v': 18}, {'u': 15, 'v': 19}, {'u': 15, 'v': 20}, {'u': 17, 'v': 20}, {'u': 7, 'v': 6}, {'u': 3, 'v': 1}, {'u': 3, 'v': 2}, {'u': 3, 'v': 4}, {'u': 3, 'v': 6}], 'source_file': 'wy2010.mtx', 'density': 0.17, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0047.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0047.png', 'edge_connectivity': 2}","[[1, 2, 4, 6, 10, 11, 14, 15, 16, 18, 21, 22], [3, 5, 7, 8, 9, 12, 13, 17, 19, 20, 23, 24, 25]]",38.0,"{'num_nodes': 25, 'num_edges': 51, 'edges': [{'u': 12, 'v': 10}, {'u': 12, 'v': 16}, {'u': 5, 'v': 1}, {'u': 5, 'v': 3}, {'u': 5, 'v': 6}, {'u': 5, 'v': 16}, {'u': 21, 'v': 9}, {'u': 21, 'v': 13}, {'u': 21, 'v': 16}, {'u': 21, 'v': 25}, {'u': 8, 'v': 13}, {'u': 8, 'v': 14}, {'u': 8, 'v': 15}, {'u': 8, 'v': 18}, {'u': 8, 'v': 22}, {'u': 22, 'v': 15}, {'u': 22, 'v': 19}, {'u': 23, 'v': 4}, {'u': 23, 'v': 15}, {'u': 23, 'v': 16}, {'u': 23, 'v': 18}, {'u': 11, 'v': 15}, {'u': 11, 'v': 17}, {'u': 11, 'v': 20}, {'u': 11, 'v': 24}, {'u': 24, 'v': 15}, {'u': 24, 'v': 20}, {'u': 9, 'v': 13}, {'u': 9, 'v': 16}, {'u': 10, 'v': 16}, {'u': 10, 'v': 25}, {'u': 16, 'v': 3}, {'u': 16, 'v': 7}, {'u': 16, 'v': 13}, {'u': 16, 'v': 18}, {'u': 16, 'v': 25}, {'u': 25, 'v': 13}, {'u': 13, 'v': 14}, {'u': 13, 'v': 18}, {'u': 15, 'v': 2}, {'u': 15, 'v': 3}, {'u': 15, 'v': 17}, {'u': 15, 'v': 18}, {'u': 15, 'v': 19}, {'u': 15, 'v': 20}, {'u': 17, 'v': 20}, {'u': 7, 'v': 6}, {'u': 3, 'v': 1}, {'u': 3, 'v': 2}, {'u': 3, 'v': 4}, {'u': 3, 'v': 6}]}","[[1, 2, 4, 6, 10, 11, 14, 15, 16, 18, 21, 22], [3, 5, 7, 8, 9, 12, 13, 17, 19, 20, 23, 24, 25]]",48,nl,1
MAXCUT,MAXCUT,"We had to divide the dorm into two opposing cleaning teams and try to make roommates work on different shifts whenever possible. The decision is which half of the residents are on shift A and which are on shift B, and a smarter split is the one that ends up separating the most roommate pairs. To check any split, just count the number of roommate-pairs that land on different teams. Every resident must belong to one of the two shifts and cannot be on both or omitted. The specific roster and roommate pairings are listed below.
There are 21 residents in total and 45 roommate pairs.
| resident_u | resident_v |
|---|---|
| 0 | 1 |
| 0 | 10 |
| 0 | 13 |
| 0 | 17 |
| 0 | 18 |
| 5 | 12 |
| 5 | 13 |
| 5 | 19 |
| 12 | 11 |
| 12 | 13 |
| 12 | 16 |
| 13 | 1 |
| 13 | 2 |
| 13 | 3 |
| 13 | 6 |
| 13 | 7 |
| 13 | 8 |
| 13 | 9 |
| 13 | 10 |
| 13 | 14 |
| 13 | 15 |
| 13 | 16 |
| 13 | 18 |
| 13 | 19 |
| 13 | 20 |
| 14 | 20 |
| 10 | 1 |
| 10 | 2 |
| 10 | 4 |
| 10 | 17 |
| 15 | 6 |
| 15 | 9 |
| 6 | 9 |
| 6 | 19 |
| 20 | 7 |
| 20 | 9 |
| 2 | 3 |
| 2 | 4 |
| 16 | 3 |
| 16 | 11 |
| 7 | 9 |
| 11 | 3 |
| 18 | 17 |
| 17 | 4 |
| 3 | 4 |
You can just hand me a proposed split in a little JSON form like this so I know which people go on shift A and which go on shift B.
{
""solution"": [
[""resident_id"", ""resident_id"", ...],
[""resident_id"", ""resident_id"", ...]
]
}
Think of the first list as everyone on shift A and the second list as everyone on shift B — just put each resident's identifier in the appropriate list. This JSON is only a sketch of the shape I need, not the actual answer itself.
Please use the exact identifiers from the instance input — don't rename them or make up 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': 'MAXCUT', 'num_nodes': 21, 'num_edges': 45, 'edges': [{'u': 1, 'v': 2}, {'u': 1, 'v': 11}, {'u': 1, 'v': 14}, {'u': 1, 'v': 18}, {'u': 1, 'v': 19}, {'u': 6, 'v': 13}, {'u': 6, 'v': 14}, {'u': 6, 'v': 20}, {'u': 13, 'v': 12}, {'u': 13, 'v': 14}, {'u': 13, 'v': 17}, {'u': 14, 'v': 2}, {'u': 14, 'v': 3}, {'u': 14, 'v': 4}, {'u': 14, 'v': 7}, {'u': 14, 'v': 8}, {'u': 14, 'v': 9}, {'u': 14, 'v': 10}, {'u': 14, 'v': 11}, {'u': 14, 'v': 15}, {'u': 14, 'v': 16}, {'u': 14, 'v': 17}, {'u': 14, 'v': 19}, {'u': 14, 'v': 20}, {'u': 14, 'v': 21}, {'u': 15, 'v': 21}, {'u': 11, 'v': 2}, {'u': 11, 'v': 3}, {'u': 11, 'v': 5}, {'u': 11, 'v': 18}, {'u': 16, 'v': 7}, {'u': 16, 'v': 10}, {'u': 7, 'v': 10}, {'u': 7, 'v': 20}, {'u': 21, 'v': 8}, {'u': 21, 'v': 10}, {'u': 3, 'v': 4}, {'u': 3, 'v': 5}, {'u': 17, 'v': 4}, {'u': 17, 'v': 12}, {'u': 8, 'v': 10}, {'u': 12, 'v': 4}, {'u': 19, 'v': 18}, {'u': 18, 'v': 5}, {'u': 4, 'v': 5}], 'source_file': 'wy2010.mtx', 'density': 0.21428571428571427, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0048.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0048.png', 'edge_connectivity': 1}","[[1, 2, 3, 5, 6, 7, 8, 9, 10, 12, 15, 17, 19], [4, 11, 13, 14, 16, 18, 20, 21]]",32.0,"{'num_nodes': 21, 'num_edges': 45, 'edges': [{'u': 0, 'v': 1}, {'u': 0, 'v': 10}, {'u': 0, 'v': 13}, {'u': 0, 'v': 17}, {'u': 0, 'v': 18}, {'u': 5, 'v': 12}, {'u': 5, 'v': 13}, {'u': 5, 'v': 19}, {'u': 12, 'v': 11}, {'u': 12, 'v': 13}, {'u': 12, 'v': 16}, {'u': 13, 'v': 1}, {'u': 13, 'v': 2}, {'u': 13, 'v': 3}, {'u': 13, 'v': 6}, {'u': 13, 'v': 7}, {'u': 13, 'v': 8}, {'u': 13, 'v': 9}, {'u': 13, 'v': 10}, {'u': 13, 'v': 14}, {'u': 13, 'v': 15}, {'u': 13, 'v': 16}, {'u': 13, 'v': 18}, {'u': 13, 'v': 19}, {'u': 13, 'v': 20}, {'u': 14, 'v': 20}, {'u': 10, 'v': 1}, {'u': 10, 'v': 2}, {'u': 10, 'v': 4}, {'u': 10, 'v': 17}, {'u': 15, 'v': 6}, {'u': 15, 'v': 9}, {'u': 6, 'v': 9}, {'u': 6, 'v': 19}, {'u': 20, 'v': 7}, {'u': 20, 'v': 9}, {'u': 2, 'v': 3}, {'u': 2, 'v': 4}, {'u': 16, 'v': 3}, {'u': 16, 'v': 11}, {'u': 7, 'v': 9}, {'u': 11, 'v': 3}, {'u': 18, 'v': 17}, {'u': 17, 'v': 4}, {'u': 3, 'v': 4}]}","[[0, 1, 2, 4, 5, 6, 7, 8, 9, 11, 14, 16, 18], [3, 10, 12, 13, 15, 17, 19, 20]]",49,markdown_table,0
MAXCUT,MAXCUT,"We’re trying to organize a mailing setup where the whole address book gets split into two opposing lists. The decision is simply assigning each contact to either List 1 or List 2, and the aim is to maximize the number of connections that cross between the lists — in other words, the better arrangement is the one that results in more linked pairs sitting in different lists. To measure success, just count how many connected pairs span the two groups. Every person must appear on one list only, with no duplicates or omissions. The specific contacts and their ties are listed below.
Below are the 25 contacts and their 42 connections:
Contact G is connected to contact C.
Contact G is connected to contact E.
Contact G is connected to contact V.
Contact H is connected to contact D.
Contact H is connected to contact P.
Contact H is connected to contact T.
Contact H is connected to contact X.
Contact A is connected to contact C.
Contact A is connected to contact L.
Contact A is connected to contact N.
Contact A is connected to contact S.
Contact L is connected to contact C.
Contact L is connected to contact D.
Contact L is connected to contact E.
Contact L is connected to contact X.
Contact M is connected to contact S.
Contact M is connected to contact W.
Contact U is connected to contact D.
Contact U is connected to contact O.
Contact U is connected to contact R.
Contact U is connected to contact T.
Contact U is connected to contact Y.
Contact V is connected to contact J.
Contact V is connected to contact O.
Contact Q is connected to contact O.
Contact Q is connected to contact R.
Contact R is connected to contact Y.
Contact K is connected to contact B.
Contact K is connected to contact P.
Contact K is connected to contact T.
Contact T is connected to contact B.
Contact T is connected to contact Y.
Contact P is connected to contact F.
Contact P is connected to contact W.
Contact W is connected to contact X.
Contact X is connected to contact S.
Contact J is connected to contact C.
Contact S is connected to contact N.
Contact C is connected to contact E.
Contact C is connected to contact I.
Contact D is connected to contact E.
Contact E is connected to contact O.
Make sure we place every contact on exactly one list so we can count how many of the 42 connections cross between the two lists.
Oh, and when you send back your assignment, please use a simple JSON layout like this so it's easy to read and check:
{
""solution"": [
[""contact_id"", ""contact_id"", ...],
[""contact_id"", ""contact_id"", ...]
]
}
The idea is straightforward: ""solution"" holds two lists — the first inner list is everyone you put on List 1, the second inner list is everyone you put on List 2. Each item is a contact identifier (just the exact ID from the instance), and every contact should appear once and only once. This JSON is just a sketch of the shape I expect, not the actual answer.
Also, 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': 'MAXCUT', 'num_nodes': 25, 'num_edges': 42, 'edges': [{'u': 7, 'v': 3}, {'u': 7, 'v': 5}, {'u': 7, 'v': 22}, {'u': 8, 'v': 4}, {'u': 8, 'v': 16}, {'u': 8, 'v': 20}, {'u': 8, 'v': 24}, {'u': 1, 'v': 3}, {'u': 1, 'v': 12}, {'u': 1, 'v': 14}, {'u': 1, 'v': 19}, {'u': 12, 'v': 3}, {'u': 12, 'v': 4}, {'u': 12, 'v': 5}, {'u': 12, 'v': 24}, {'u': 13, 'v': 19}, {'u': 13, 'v': 23}, {'u': 21, 'v': 4}, {'u': 21, 'v': 15}, {'u': 21, 'v': 18}, {'u': 21, 'v': 20}, {'u': 21, 'v': 25}, {'u': 22, 'v': 10}, {'u': 22, 'v': 15}, {'u': 17, 'v': 15}, {'u': 17, 'v': 18}, {'u': 18, 'v': 25}, {'u': 11, 'v': 2}, {'u': 11, 'v': 16}, {'u': 11, 'v': 20}, {'u': 20, 'v': 2}, {'u': 20, 'v': 25}, {'u': 16, 'v': 6}, {'u': 16, 'v': 23}, {'u': 23, 'v': 24}, {'u': 24, 'v': 19}, {'u': 10, 'v': 3}, {'u': 19, 'v': 14}, {'u': 3, 'v': 5}, {'u': 3, 'v': 9}, {'u': 4, 'v': 5}, {'u': 5, 'v': 15}], 'source_file': 'wy2010.mtx', 'density': 0.14, 'viz_instance': 'generated_data/MAXCUT/viz/MAXCUT_L/instance_0049.png', 'viz_solution': 'generated_data/MAXCUT/viz/MAXCUT_L/solution_0049.png', 'edge_connectivity': 1}","[[1, 4, 7, 9, 10, 13, 14, 15, 16, 18, 20, 24], [2, 3, 5, 6, 8, 11, 12, 17, 19, 21, 22, 23, 25]]",36.0,"{'num_nodes': 25, 'num_edges': 42, 'edges': [{'u': 'G', 'v': 'C'}, {'u': 'G', 'v': 'E'}, {'u': 'G', 'v': 'V'}, {'u': 'H', 'v': 'D'}, {'u': 'H', 'v': 'P'}, {'u': 'H', 'v': 'T'}, {'u': 'H', 'v': 'X'}, {'u': 'A', 'v': 'C'}, {'u': 'A', 'v': 'L'}, {'u': 'A', 'v': 'N'}, {'u': 'A', 'v': 'S'}, {'u': 'L', 'v': 'C'}, {'u': 'L', 'v': 'D'}, {'u': 'L', 'v': 'E'}, {'u': 'L', 'v': 'X'}, {'u': 'M', 'v': 'S'}, {'u': 'M', 'v': 'W'}, {'u': 'U', 'v': 'D'}, {'u': 'U', 'v': 'O'}, {'u': 'U', 'v': 'R'}, {'u': 'U', 'v': 'T'}, {'u': 'U', 'v': 'Y'}, {'u': 'V', 'v': 'J'}, {'u': 'V', 'v': 'O'}, {'u': 'Q', 'v': 'O'}, {'u': 'Q', 'v': 'R'}, {'u': 'R', 'v': 'Y'}, {'u': 'K', 'v': 'B'}, {'u': 'K', 'v': 'P'}, {'u': 'K', 'v': 'T'}, {'u': 'T', 'v': 'B'}, {'u': 'T', 'v': 'Y'}, {'u': 'P', 'v': 'F'}, {'u': 'P', 'v': 'W'}, {'u': 'W', 'v': 'X'}, {'u': 'X', 'v': 'S'}, {'u': 'J', 'v': 'C'}, {'u': 'S', 'v': 'N'}, {'u': 'C', 'v': 'E'}, {'u': 'C', 'v': 'I'}, {'u': 'D', 'v': 'E'}, {'u': 'E', 'v': 'O'}]}","[['A', 'D', 'G', 'I', 'J', 'M', 'N', 'O', 'P', 'R', 'T', 'X'], ['B', 'C', 'E', 'F', 'H', 'K', 'L', 'Q', 'S', 'U', 'V', 'W', 'Y']]",50,nl,names
|