#815582 (C++17) No.5013 セクスタプル (open)

• 問題: No.5013 セクスタプル (open)
• ユーザー: trineutron
• 提出日時: 2022-11-10 23:48:15
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,992 ms / 2,000 ms
• コード長: 2,920 bytes
• コンパイル時間: 1,074 ms
• 実行使用メモリ: 6,952 KB
• スコア: 10,357
• 最終ジャッジ日時: 2022-12-29 13:37:39
• 合計ジャッジ時間: 206,840 ms
• ジャッジサーバーID （参考情報）: judge12 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1,992 ms; 4,904 KB
testcase_01	AC	1,991 ms; 4,900 KB
testcase_02	AC	1,991 ms; 4,900 KB
testcase_03	AC	1,991 ms; 4,900 KB
testcase_04	AC	1,992 ms; 6,952 KB
testcase_05	AC	1,991 ms; 4,904 KB
testcase_06	AC	1,991 ms; 4,900 KB
testcase_07	AC	1,991 ms; 4,904 KB
testcase_08	AC	1,991 ms; 4,904 KB
testcase_09	AC	1,990 ms; 6,948 KB
testcase_10	AC	1,992 ms; 6,948 KB
testcase_11	AC	1,992 ms; 4,904 KB
testcase_12	AC	1,991 ms; 4,904 KB
testcase_13	AC	1,992 ms; 4,904 KB
testcase_14	AC	1,992 ms; 4,900 KB
testcase_15	AC	1,992 ms; 4,904 KB
testcase_16	AC	1,992 ms; 4,904 KB
testcase_17	AC	1,991 ms; 4,904 KB
testcase_18	AC	1,992 ms; 4,900 KB
testcase_19	AC	1,991 ms; 4,900 KB
testcase_20	AC	1,992 ms; 6,948 KB
testcase_21	AC	1,992 ms; 6,948 KB
testcase_22	AC	1,991 ms; 4,900 KB
testcase_23	AC	1,992 ms; 4,904 KB
testcase_24	AC	1,991 ms; 6,952 KB
testcase_25	AC	1,991 ms; 4,900 KB
testcase_26	AC	1,991 ms; 4,900 KB
testcase_27	AC	1,991 ms; 4,904 KB
testcase_28	AC	1,992 ms; 4,904 KB
testcase_29	AC	1,992 ms; 6,952 KB
testcase_30	AC	1,991 ms; 4,900 KB
testcase_31	AC	1,991 ms; 4,904 KB
testcase_32	AC	1,991 ms; 4,904 KB
testcase_33	AC	1,992 ms; 4,904 KB
testcase_34	AC	1,990 ms; 4,908 KB
testcase_35	AC	1,992 ms; 4,904 KB
testcase_36	AC	1,991 ms; 4,908 KB
testcase_37	AC	1,991 ms; 4,904 KB
testcase_38	AC	1,990 ms; 6,948 KB
testcase_39	AC	1,992 ms; 4,904 KB
testcase_40	AC	1,991 ms; 4,904 KB
testcase_41	AC	1,991 ms; 6,948 KB
testcase_42	AC	1,991 ms; 6,948 KB
testcase_43	AC	1,992 ms; 6,952 KB
testcase_44	AC	1,992 ms; 6,952 KB
testcase_45	AC	1,992 ms; 4,904 KB
testcase_46	AC	1,991 ms; 4,904 KB
testcase_47	AC	1,991 ms; 4,904 KB
testcase_48	AC	1,991 ms; 6,952 KB
testcase_49	AC	1,992 ms; 4,900 KB
testcase_50	AC	1,991 ms; 4,900 KB
testcase_51	AC	1,991 ms; 4,900 KB
testcase_52	AC	1,991 ms; 6,948 KB
testcase_53	AC	1,991 ms; 6,948 KB
testcase_54	AC	1,991 ms; 4,908 KB
testcase_55	AC	1,991 ms; 4,900 KB
testcase_56	AC	1,991 ms; 4,904 KB
testcase_57	AC	1,991 ms; 6,952 KB
testcase_58	AC	1,991 ms; 4,908 KB
testcase_59	AC	1,991 ms; 4,904 KB
testcase_60	AC	1,991 ms; 6,948 KB
testcase_61	AC	1,992 ms; 4,904 KB
testcase_62	AC	1,990 ms; 6,948 KB
testcase_63	AC	1,991 ms; 4,908 KB
testcase_64	AC	1,992 ms; 6,948 KB
testcase_65	AC	1,991 ms; 6,948 KB
testcase_66	AC	1,991 ms; 4,900 KB
testcase_67	AC	1,990 ms; 4,900 KB
testcase_68	AC	1,992 ms; 4,904 KB
testcase_69	AC	1,991 ms; 6,952 KB
testcase_70	AC	1,992 ms; 4,904 KB
testcase_71	AC	1,991 ms; 4,900 KB
testcase_72	AC	1,991 ms; 4,904 KB
testcase_73	AC	1,991 ms; 4,900 KB
testcase_74	AC	1,992 ms; 6,948 KB
testcase_75	AC	1,991 ms; 4,904 KB
testcase_76	AC	1,992 ms; 6,948 KB
testcase_77	AC	1,991 ms; 6,952 KB
testcase_78	AC	1,991 ms; 6,948 KB
testcase_79	AC	1,991 ms; 4,904 KB
testcase_80	AC	1,991 ms; 4,900 KB
testcase_81	AC	1,991 ms; 4,908 KB
testcase_82	AC	1,992 ms; 4,904 KB
testcase_83	AC	1,991 ms; 6,948 KB
testcase_84	AC	1,992 ms; 4,900 KB
testcase_85	AC	1,991 ms; 4,904 KB
testcase_86	AC	1,991 ms; 4,904 KB
testcase_87	AC	1,990 ms; 4,904 KB
testcase_88	AC	1,991 ms; 6,948 KB
testcase_89	AC	1,992 ms; 4,900 KB
testcase_90	AC	1,992 ms; 4,904 KB
testcase_91	AC	1,991 ms; 4,900 KB
testcase_92	AC	1,991 ms; 4,904 KB
testcase_93	AC	1,991 ms; 4,904 KB
testcase_94	AC	1,991 ms; 6,948 KB
testcase_95	AC	1,992 ms; 4,904 KB
testcase_96	AC	1,991 ms; 4,904 KB
testcase_97	AC	1,992 ms; 4,900 KB
testcase_98	AC	1,992 ms; 4,904 KB
testcase_99	AC	1,991 ms; 4,900 KB

ソースコード

#include <algorithm>
#include <array>
#include <chrono>
#include <fstream>
#include <iostream>
#include <random>

using Board = std::array<std::array<int, 6>, 36>;

class xrand {
    uint64_t x;

   public:
    using result_type = uint32_t;
    static constexpr result_type min() {
        return std::numeric_limits<result_type>::min();
    }
    static constexpr result_type max() {
        return std::numeric_limits<result_type>::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<std::array<bool, 6>, 6> contain_row, contain_col;
    std::array<std::array<int, 6>, 6> count_row, count_col;
    for (int i = 0; i < 6; i++) {
        contain_row.at(i).fill(true);
        contain_col.at(i).fill(true);
        count_row.at(i).fill(0);
        count_col.at(i).fill(0);
    }

    for (int row = 0; row < 6; row++) {
        for (int col = 0; col < 6; col++) {
            std::array<bool, 6> contain;
            contain.fill(false);
            for (const auto &d : board.at(6 * row + col)) {
                contain.at(d) = true;
                count_row.at(row).at(d)++;
                count_col.at(col).at(d)++;
            }
            for (int type = 0; type < 6; type++) {
                if (not contain.at(type)) {
                    contain_row.at(row).at(type) = false;
                    contain_col.at(col).at(type) = false;
                }
            }
        }
    }

    int s = 0;
    for (int i = 0; i < 6; i++) {
        for (int type = 0; type < 6; type++) {
            if (contain_row.at(i).at(type)) {
                s += count_row.at(i).at(type) - 3;
            }
            if (contain_col.at(i).at(type)) {
                s += count_col.at(i).at(type) - 3;
            }
        }
    }

    return s;
}

int main() {
    auto start{std::chrono::steady_clock::now()};
    xrand rng;

    std::array<std::array<int, 6>, 36> dice;
    for (int i = 0; i < 36; i++) {
        for (int j = 0; j < 6; j++) {
            std::cin >> dice.at(i).at(j);
            dice.at(i).at(j)--;
        }
    }

    std::array<int, 36> idx;
    std::iota(idx.begin(), idx.end(), 0);
    Board board = dice;
    int best = score(board);
    std::array<int, 36> best_idx = idx;

    while ((std::chrono::steady_clock::now() - start).count() < 1990000000) {
        std::shuffle(idx.begin(), idx.end(), rng);
        for (int i = 0; i < 36; i++) {
            board.at(idx.at(i)) = dice.at(i);
        }
        int s = score(board);
        if (s > best) {
            best = s;
            best_idx = idx;
        }
    }

    std::cerr << best << std::endl;
    for (int i = 0; i < 36; i++) {
        std::cout << best_idx.at(i) / 6 + 1 << ' ' << best_idx.at(i) % 6 + 1 << '\n';
    }

    return 0;
}