#include #include #include #include #include #include using Board = std::array, 36>; class xrand { uint64_t x; public: using result_type = uint32_t; static constexpr result_type min() { return std::numeric_limits::min(); } static constexpr result_type max() { return std::numeric_limits::max(); } xrand(uint64_t k) : x(k) {} xrand() : xrand(1) {} result_type operator()() { x ^= x << 9; x ^= x >> 7; return (x * 0x123456789abcdef) >> 32; } }; int score(const Board &board) { std::array, 6> contain_row, contain_col; std::array, 6> count_row, count_col; for (int i = 0; i < 6; i++) { contain_row[i].fill(true); contain_col[i].fill(true); count_row[i].fill(0); count_col[i].fill(0); } for (int row = 0; row < 6; row++) { for (int col = 0; col < 6; col++) { const int idx = 6 * row + col; for (int type = 0; type < 6; type++) { if (board[idx][type] == 0) { contain_row[row][type] = false; contain_col[col][type] = false; } else { count_row[row][type] += board[idx][type]; count_col[col][type] += board[idx][type]; } } } } int s = 0; for (int i = 0; i < 6; i++) { for (int type = 0; type < 6; type++) { if (contain_row[i][type]) { s += count_row[i][type] - 3; } if (contain_col[i][type]) { s += count_col[i][type] - 3; } } } return s; } int main() { auto start{std::chrono::steady_clock::now()}; xrand rng; std::uniform_int_distribution<> dist(0, 35); auto time = [&]() { return (std::chrono::steady_clock::now() - start).count(); }; Board board; for (int i = 0; i < 36; i++) { board[i].fill(0); for (int j = 0; j < 6; j++) { int d; std::cin >> d; d--; board[i][d]++; } } std::array idx; std::iota(idx.begin(), idx.end(), 0); int best = score(board); std::array best_idx = idx; int count = 0; while (time() < 990000000) { for (int _ = 0; _ < 1000; _++) { int x = dist(rng); int y = dist(rng); if (x == y) continue; std::swap(board[idx[x]], board[idx[y]]); std::swap(idx[x], idx[y]); int s = score(board); if (s > best) { best = s; best_idx = idx; } else { std::swap(idx[x], idx[y]); std::swap(board[idx[x]], board[idx[y]]); } count++; } } std::cerr << best << std::endl; std::cerr << count << std::endl; for (int i = 0; i < 36; i++) { std::cout << best_idx[i] / 6 + 1 << ' ' << best_idx[i] % 6 + 1 << '\n'; } return 0; }