結果

問題 No.5014 セクスタプル (reactive)
ユーザー wanui
提出日時 2022-12-29 21:14:02
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,632 ms / 2,000 ms
コード長 8,523 bytes
コンパイル時間 3,462 ms
実行使用メモリ 22,864 KB
スコア 609,581,910
平均クエリ数 34.30
最終ジャッジ日時 2022-12-29 21:16:52
合計ジャッジ時間 167,203 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 100
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// clang-format off
using namespace std;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>void print(H h,T... t){print0(h);if(sizeof...(T)>0)print0(" ");print(t...);}
#define debug1(a) { cerr<<#a<<":"<<a<<endl; }
#define debug2(a,b) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<endl; }
#define debug3(a,b,c) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<" "<<#c<<":"<<c<<endl; }
#define debug4(a,b,c,d) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<" "<<#c<<":"<<c<<" "<<#d<<":"<<d<<endl; }
using pii = pair<int,int>;
// clang-format on

namespace marathon {
mt19937 engine(0);
clock_t start_time;
double now() {
    return 1000.0 * (clock() - start_time) / CLOCKS_PER_SEC;
}
void marathon_init() {
    start_time = clock();
    random_device seed_gen;
    engine.seed(seed_gen());
}
int randint(int mn, int mx) {
    int rng = mx - mn + 1;
    return mn + (engine() % rng);
}
bool anneal_accept(double new_score, double old_score, double cur_time, double begin_time, double end_time, double begin_temp, double end_temp) {
    const int ANNEAL_RND = 1e8;
    const double ANNEAL_EPS = 1e-6;
    double temp = (begin_temp * (end_time - cur_time) + end_temp * (cur_time - begin_time)) / (end_time - begin_time);
    return (exp((new_score - old_score) / temp) > double(engine() % ANNEAL_RND) / ANNEAL_RND + ANNEAL_EPS);
}
}  // namespace marathon

const int N2 = 36;
const int N = 6;
const int SCORE_BASE = 3;
const double END_TIME = 1900;

struct six {
    int val[6];
};
struct monte_carlo_state {
    bool row_exist[6][6];
    bool col_exist[6][6];
    int row_cnt[6][6];
    int col_cnt[6][6];
};
vector<six> all_rolls;
map<vector<int>, int> rev_all_rolls;
void make_all_rolls() {
    for (int a = 0; a < N; a++) {
        for (int b = 0; b < N; b++) {
            for (int c = 0; c < N; c++) {
                for (int d = 0; d < N; d++) {
                    for (int e = 0; e < N; e++) {
                        for (int f = 0; f < N; f++) {
                            six s;
                            for (int j = 0; j < N; j++) {
                                s.val[j] = 0;
                            }
                            s.val[a]++;
                            s.val[b]++;
                            s.val[c]++;
                            s.val[d]++;
                            s.val[e]++;
                            s.val[f]++;
                            vector<int> r(N);
                            for (int j = 0; j < N; j++) {
                                r[j] = s.val[j];
                            }
                            rev_all_rolls[r] = all_rolls.size();
                            all_rolls.push_back(s);
                        }
                    }
                }
            }
        }
    }
}
int calc_score(vector<vector<int>> &perm, vector<int> &rolls) {
    int score = 0;
    for (int i = 0; i < N; i++) {
        for (int d = 0; d < N; d++) {
            int cnt = 0;
            for (int j = 0; j < N; j++) {
                int rollid = perm[i][j];
                int roll_cnt = all_rolls[rolls[rollid]].val[d];
                if (!roll_cnt) {
                    cnt = 0;
                    break;
                }
                cnt += roll_cnt;
            }
            if (!cnt) continue;
            score += cnt - N + SCORE_BASE;
        }
    }
    for (int j = 0; j < N; j++) {
        for (int d = 0; d < N; d++) {
            int cnt = 0;
            for (int i = 0; i < N; i++) {
                int rollid = perm[i][j];
                int roll_cnt = all_rolls[rolls[rollid]].val[d];
                if (!roll_cnt) {
                    cnt = 0;
                    break;
                }
                cnt += roll_cnt;
            }
            if (!cnt) continue;
            score += cnt - N + SCORE_BASE;
        }
    }
    return score;
}
int row_score(vector<vector<int>> &perm, vector<six> &rolls, int xi) {
    int score = 0;
    {
        for (int d = 0; d < N; d++) {
            int cnt = 0;
            for (int j = 0; j < N; j++) {
                int rollid = perm[xi][j];
                int roll_cnt = rolls[rollid].val[d];
                if (!roll_cnt) {
                    cnt = 0;
                    break;
                }
                cnt += roll_cnt;
            }
            if (!cnt) continue;
            score += cnt - N + SCORE_BASE;
        }
    }
    return score;
}
int random_dice_roll() {
    return marathon::engine() % all_rolls.size();
}
int monte_carlo_score(int s_turn, vector<int> &s_rolls, vector<vector<int>> &s_perm, int si, int sj) {
    int MONTE_CARLO_ITER = 140;
    if (s_turn < 10) MONTE_CARLO_ITER = 50;

    int score = 0;
    for (int iter = 0; iter < MONTE_CARLO_ITER; iter++) {
        monte_carlo_state st;
        for (int i = 0; i < N; i++) {
            for (int d = 0; d < N; d++) {
                st.row_exist[i][d] = true;
                st.row_cnt[i][d] = 0;
                st.col_exist[i][d] = true;
                st.col_cnt[i][d] = 0;
            }
        }
        auto rolls = s_rolls;
        auto perm = s_perm;
        perm[si][sj] = s_turn;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if (perm[i][j] >= 0) {
                    int rollid = perm[i][j];
                    six roll = all_rolls[rolls[rollid]];
                    for (int d = 0; d < N; d++) {
                        st.row_cnt[i][d] += roll.val[d];
                        st.row_exist[i][d] &= (roll.val[d] > 0);
                        st.col_cnt[j][d] += roll.val[d];
                        st.col_exist[j][d] &= (roll.val[d] > 0);
                    }
                }
            }
        }
        for (int turn = s_turn + 1; turn < N2; turn++) {
            int rollid = random_dice_roll();
            six roll = all_rolls[rollid];
            rolls[turn] = rollid;

            pii pt;
            int bestscore = -1;
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < N; j++) {
                    if (perm[i][j] >= 0) continue;
                    int score = marathon::randint(1, 99);
                    for (int d = 0; d < N; d++) {
                        if (st.row_exist[i][d] && roll.val[d]) score += (roll.val[d] + st.row_cnt[i][d]) * 100;
                        if (st.col_exist[j][d] && roll.val[d]) score += (roll.val[d] + st.col_cnt[j][d]) * 100;
                    }
                    if (bestscore < score) {
                        bestscore = score;
                        pt = {i, j};
                    }
                }
            }
            for (int d = 0; d < N; d++) {
                int i = pt.first;
                int j = pt.second;
                st.row_cnt[i][d] += roll.val[d];
                st.row_exist[i][d] &= (roll.val[d] > 0);
                st.col_cnt[j][d] += roll.val[d];
                st.col_exist[j][d] &= (roll.val[d] > 0);
            }

            perm[pt.first][pt.second] = turn;
        }
        score += calc_score(perm, rolls);
    }
    return score;
}
pii select_op(int turn, vector<int> &rolls, vector<vector<int>> &perm) {
    vector<pair<int, pii>> scores;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (perm[i][j] >= 0) continue;
            int score = monte_carlo_score(turn, rolls, perm, i, j);
            scores.push_back({score, {i, j}});
        }
    }
    sort(scores.rbegin(), scores.rend());
    return scores[0].second;
}
int main() {
    marathon::marathon_init();
    make_all_rolls();
    vector<int> rolls(N2);
    vector<vector<int>> perm(N, vector<int>(N, -1));
    for (int turn = 0; turn < N2 - 1; turn++) {
        vector<int> s(N);
        for (int j = 0; j < N; j++) {
            int d;
            cin >> d;
            d--;
            s[d]++;
        }
        rolls[turn] = rev_all_rolls[s];
        pii op = select_op(turn, rolls, perm);
        cout << op.first + 1 << " " << op.second + 1 << endl;
        perm[op.first][op.second] = turn;
    }

    {
        rolls[N2 - 1] = random_dice_roll();
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if (perm[i][j] < 0) {
                    perm[i][j] = N2 - 1;
                }
            }
        }
        int score = calc_score(perm, rolls);
        int now = marathon::now();
        debug2(score, now);
    }
    return 0;
}
0