結果

問題 No.5014 セクスタプル (reactive)
ユーザー trineutrontrineutron
提出日時 2022-11-11 15:36:45
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 27 ms / 2,000 ms
コード長 2,940 bytes
コンパイル時間 1,174 ms
実行使用メモリ 22,864 KB
スコア 590,745,959
平均クエリ数 35.00
最終ジャッジ日時 2022-11-11 15:36:58
合計ジャッジ時間 8,871 ms
ジャッジサーバーID
(参考情報)
judge11 / judge13
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 22 ms
21,916 KB
testcase_01 AC 22 ms
21,880 KB
testcase_02 AC 22 ms
21,916 KB
testcase_03 AC 22 ms
21,768 KB
testcase_04 AC 21 ms
21,844 KB
testcase_05 AC 22 ms
22,588 KB
testcase_06 AC 22 ms
22,564 KB
testcase_07 AC 22 ms
22,612 KB
testcase_08 AC 21 ms
21,980 KB
testcase_09 AC 22 ms
21,916 KB
testcase_10 AC 22 ms
22,240 KB
testcase_11 AC 22 ms
21,880 KB
testcase_12 AC 23 ms
21,892 KB
testcase_13 AC 21 ms
21,880 KB
testcase_14 AC 22 ms
22,576 KB
testcase_15 AC 22 ms
22,668 KB
testcase_16 AC 24 ms
22,132 KB
testcase_17 AC 26 ms
22,432 KB
testcase_18 AC 25 ms
22,588 KB
testcase_19 AC 23 ms
21,940 KB
testcase_20 AC 22 ms
21,892 KB
testcase_21 AC 22 ms
21,968 KB
testcase_22 AC 22 ms
21,744 KB
testcase_23 AC 22 ms
21,736 KB
testcase_24 AC 22 ms
21,744 KB
testcase_25 AC 21 ms
22,204 KB
testcase_26 AC 23 ms
21,892 KB
testcase_27 AC 23 ms
21,904 KB
testcase_28 AC 22 ms
22,432 KB
testcase_29 AC 22 ms
21,744 KB
testcase_30 AC 23 ms
21,928 KB
testcase_31 AC 23 ms
21,812 KB
testcase_32 AC 22 ms
21,916 KB
testcase_33 AC 23 ms
22,252 KB
testcase_34 AC 23 ms
21,768 KB
testcase_35 AC 23 ms
22,564 KB
testcase_36 AC 23 ms
21,756 KB
testcase_37 AC 22 ms
22,444 KB
testcase_38 AC 24 ms
21,756 KB
testcase_39 AC 26 ms
22,004 KB
testcase_40 AC 27 ms
21,756 KB
testcase_41 AC 24 ms
22,864 KB
testcase_42 AC 21 ms
21,992 KB
testcase_43 AC 22 ms
21,756 KB
testcase_44 AC 23 ms
21,880 KB
testcase_45 AC 22 ms
21,980 KB
testcase_46 AC 23 ms
22,252 KB
testcase_47 AC 22 ms
21,892 KB
testcase_48 AC 22 ms
21,928 KB
testcase_49 AC 22 ms
22,576 KB
testcase_50 AC 22 ms
22,216 KB
testcase_51 AC 23 ms
21,916 KB
testcase_52 AC 22 ms
21,744 KB
testcase_53 AC 22 ms
21,892 KB
testcase_54 AC 23 ms
22,432 KB
testcase_55 AC 22 ms
21,756 KB
testcase_56 AC 22 ms
21,916 KB
testcase_57 AC 22 ms
21,880 KB
testcase_58 AC 21 ms
21,916 KB
testcase_59 AC 21 ms
21,880 KB
testcase_60 AC 22 ms
22,588 KB
testcase_61 AC 23 ms
22,252 KB
testcase_62 AC 25 ms
22,540 KB
testcase_63 AC 25 ms
21,904 KB
testcase_64 AC 25 ms
22,036 KB
testcase_65 AC 22 ms
22,564 KB
testcase_66 AC 22 ms
21,880 KB
testcase_67 AC 22 ms
22,692 KB
testcase_68 AC 22 ms
21,928 KB
testcase_69 AC 21 ms
21,992 KB
testcase_70 AC 21 ms
21,880 KB
testcase_71 AC 22 ms
22,680 KB
testcase_72 AC 22 ms
22,264 KB
testcase_73 AC 23 ms
22,612 KB
testcase_74 AC 22 ms
22,444 KB
testcase_75 AC 23 ms
22,612 KB
testcase_76 AC 22 ms
21,880 KB
testcase_77 AC 22 ms
22,844 KB
testcase_78 AC 22 ms
21,880 KB
testcase_79 AC 23 ms
22,844 KB
testcase_80 AC 23 ms
21,892 KB
testcase_81 AC 23 ms
21,928 KB
testcase_82 AC 23 ms
22,692 KB
testcase_83 AC 23 ms
22,564 KB
testcase_84 AC 24 ms
22,596 KB
testcase_85 AC 24 ms
22,420 KB
testcase_86 AC 25 ms
22,588 KB
testcase_87 AC 24 ms
21,768 KB
testcase_88 AC 23 ms
21,796 KB
testcase_89 AC 24 ms
22,588 KB
testcase_90 AC 22 ms
22,108 KB
testcase_91 AC 23 ms
21,756 KB
testcase_92 AC 23 ms
21,880 KB
testcase_93 AC 24 ms
22,444 KB
testcase_94 AC 22 ms
22,692 KB
testcase_95 AC 23 ms
21,892 KB
testcase_96 AC 23 ms
21,916 KB
testcase_97 AC 23 ms
21,756 KB
testcase_98 AC 22 ms
22,564 KB
testcase_99 AC 23 ms
22,204 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#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;
    }
};

double calc_score(const Board &board, const std::array<bool, 36> &used) {
    std::array<std::array<double, 6>, 6> prob_row, prob_col;
    std::array<std::array<int, 6>, 6> count_row, count_col;
    for (int i = 0; i < 6; i++) {
        prob_row[i].fill(1.);
        prob_col[i].fill(1.);
        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 (not used[idx]) {
                    count_row[row][type]++;
                    count_col[col][type]++;
                } else if (board[idx][type] == 0) {
                    prob_row[row][type] = 0.;
                    prob_col[col][type] = 0.;
                } else {
                    count_row[row][type] += board[idx][type];
                    count_col[col][type] += board[idx][type];
                }
            }
        }
    }

    double s = 0;
    for (int i = 0; i < 6; i++) {
        for (int type = 0; type < 6; type++) {
            s += prob_row[i][type] * (count_row[i][type] - 3);
            s += prob_col[i][type] * (count_col[i][type] - 3);
        }
    }

    return s;
}

int main() {
    xrand rng;
    std::uniform_int_distribution<> dist(0, 5);

    Board board;
    for (int i = 0; i < 36; i++) {
        board[i].fill(0);
    }
    std::array<bool, 36> used;
    used.fill(false);
    for (int i = 0; i < 35; i++) {
        std::array<int, 6> dice;
        dice.fill(0);
        for (int j = 0; j < 6; j++) {
            int d;
            std::cin >> d;
            d--;
            dice[d]++;
        }
        std::array<double, 36> score;
        score.fill(0);
        for (int j = 0; j < 36; j++) {
            if (used[j]) {
                score[j]--;
                continue;
            }
            Board board_new = board;
            board_new[j] = dice;
            used[j] = true;
            score[j] = calc_score(board_new, used);
            used[j] = false;
        }
        int idx = std::max_element(score.begin(), score.end()) - score.begin();
        std::cout << idx / 6 + 1 << ' ' << idx % 6 + 1 << std::endl;
        used[idx] = true;
        board[idx] = dice;
    }
    return 0;
}
0