#829042 (C++17) No.5014 セクスタプル (reactive)

提出ソース

結果

問題	No.5014 セクスタプル (reactive)
ユーザー	wanui
提出日時	2022-12-29 15:47:50
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	743 ms / 2,000 ms
コード長	5,817 bytes
コンパイル時間	3,059 ms
実行使用メモリ	22,864 KB
スコア	572,160,361
平均クエリ数	35.00
最終ジャッジ日時	2022-12-29 15:52:17
合計ジャッジ時間	82,746 ms
ジャッジサーバーID （参考情報）	judge12 / judge13
	純コード判定しない問題か言語

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	726 ms 22,444 KB
testcase_01	AC	729 ms 21,928 KB
testcase_02	AC	730 ms 21,880 KB
testcase_03	AC	730 ms 22,844 KB
testcase_04	AC	733 ms 22,540 KB
testcase_05	AC	725 ms 21,780 KB
testcase_06	AC	726 ms 22,844 KB
testcase_07	AC	731 ms 21,992 KB
testcase_08	AC	729 ms 22,692 KB
testcase_09	AC	728 ms 21,880 KB
testcase_10	AC	727 ms 22,588 KB
testcase_11	AC	732 ms 21,880 KB
testcase_12	AC	731 ms 22,216 KB
testcase_13	AC	731 ms 22,864 KB
testcase_14	AC	727 ms 22,432 KB
testcase_15	AC	734 ms 22,464 KB
testcase_16	AC	726 ms 21,880 KB
testcase_17	AC	729 ms 21,992 KB
testcase_18	AC	732 ms 22,444 KB
testcase_19	AC	727 ms 21,868 KB
testcase_20	AC	734 ms 22,608 KB
testcase_21	AC	723 ms 21,880 KB
testcase_22	AC	739 ms 22,420 KB
testcase_23	AC	734 ms 22,540 KB
testcase_24	AC	731 ms 22,192 KB
testcase_25	AC	726 ms 22,864 KB
testcase_26	AC	734 ms 21,756 KB
testcase_27	AC	734 ms 21,868 KB
testcase_28	AC	732 ms 22,372 KB
testcase_29	AC	733 ms 22,692 KB
testcase_30	AC	730 ms 21,904 KB
testcase_31	AC	738 ms 21,868 KB
testcase_32	AC	727 ms 21,940 KB
testcase_33	AC	742 ms 21,992 KB
testcase_34	AC	738 ms 21,780 KB
testcase_35	AC	735 ms 21,748 KB
testcase_36	AC	729 ms 21,892 KB
testcase_37	AC	730 ms 21,892 KB
testcase_38	AC	726 ms 21,756 KB
testcase_39	AC	732 ms 22,600 KB
testcase_40	AC	726 ms 22,564 KB
testcase_41	AC	728 ms 21,928 KB
testcase_42	AC	730 ms 21,880 KB
testcase_43	AC	735 ms 21,928 KB
testcase_44	AC	734 ms 21,928 KB
testcase_45	AC	724 ms 21,756 KB
testcase_46	AC	724 ms 21,980 KB
testcase_47	AC	731 ms 21,784 KB
testcase_48	AC	725 ms 22,576 KB
testcase_49	AC	731 ms 22,252 KB
testcase_50	AC	734 ms 21,880 KB
testcase_51	AC	736 ms 21,916 KB
testcase_52	AC	729 ms 21,756 KB
testcase_53	AC	730 ms 21,992 KB
testcase_54	AC	726 ms 21,928 KB
testcase_55	AC	728 ms 21,980 KB
testcase_56	AC	728 ms 22,576 KB
testcase_57	AC	724 ms 22,192 KB
testcase_58	AC	726 ms 22,252 KB
testcase_59	AC	731 ms 21,892 KB
testcase_60	AC	731 ms 21,756 KB
testcase_61	AC	730 ms 21,980 KB
testcase_62	AC	735 ms 21,892 KB
testcase_63	AC	731 ms 21,940 KB
testcase_64	AC	727 ms 21,744 KB
testcase_65	AC	727 ms 21,940 KB
testcase_66	AC	733 ms 22,264 KB
testcase_67	AC	736 ms 22,252 KB
testcase_68	AC	732 ms 21,880 KB
testcase_69	AC	722 ms 21,940 KB
testcase_70	AC	731 ms 21,768 KB
testcase_71	AC	731 ms 21,880 KB
testcase_72	AC	726 ms 22,240 KB
testcase_73	AC	729 ms 21,916 KB
testcase_74	AC	735 ms 22,204 KB
testcase_75	AC	731 ms 21,968 KB
testcase_76	AC	733 ms 21,992 KB
testcase_77	AC	737 ms 22,180 KB
testcase_78	AC	732 ms 22,576 KB
testcase_79	AC	736 ms 22,564 KB
testcase_80	AC	727 ms 21,992 KB
testcase_81	AC	734 ms 21,928 KB
testcase_82	AC	733 ms 21,768 KB
testcase_83	AC	724 ms 21,768 KB
testcase_84	AC	728 ms 22,704 KB
testcase_85	AC	735 ms 21,880 KB
testcase_86	AC	734 ms 21,916 KB
testcase_87	AC	735 ms 21,892 KB
testcase_88	AC	727 ms 22,564 KB
testcase_89	AC	730 ms 22,844 KB
testcase_90	AC	729 ms 21,748 KB
testcase_91	AC	743 ms 21,916 KB
testcase_92	AC	730 ms 22,656 KB
testcase_93	AC	730 ms 22,252 KB
testcase_94	AC	736 ms 21,880 KB
testcase_95	AC	731 ms 21,904 KB
testcase_96	AC	730 ms 21,980 KB
testcase_97	AC	732 ms 21,880 KB
testcase_98	AC	728 ms 21,928 KB
testcase_99	AC	738 ms 22,444 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

int calc_score(vector<vector<int>> &perm, vector<six> &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 = 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 = 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;
}
six random_dice_roll() {
    six s;
    for (int i = 0; i < N; i++) {
        s.val[i] = 0;
    }
    for (int i = 0; i < N; i++) {
        int d = marathon::engine() % N;
        s.val[d]++;
    }
    return s;
}
int monte_carlo_score(int s_turn, vector<six> &s_rolls, vector<vector<int>> &s_perm, int si, int sj) {
    const int MONTE_CARLO_ITER = 170;
    int score = 0;
    for (int iter = 0; iter < MONTE_CARLO_ITER; iter++) {
        auto rolls = s_rolls;
        auto perm = s_perm;
        perm[si][sj] = s_turn;
        for (int turn = s_turn + 1; turn < N2; turn++) {
            int rest = N2 - turn;
            int tgt = marathon::engine() % rest;
            int c = 0;
            rolls[turn] = random_dice_roll();
            for (int i = 0; (c >= 0 && i < N); i++) {
                for (int j = 0; (c >= 0 && j < N); j++) {
                    if (perm[i][j] >= 0) continue;
                    if (c == tgt) {
                        perm[i][j] = turn;
                        c = -1;
                        break;
                    }
                    c++;
                }
            }
            random_dice_roll();
        }
        score += calc_score(perm, rolls);
    }
    return score;
}
pair<int, int> select_op(int turn, vector<six> &rolls, vector<vector<int>> &perm) {
    vector<pair<int, pair<int, int>>> 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();
    vector<six> rolls(N2);
    vector<vector<int>> perm(N, vector<int>(N, -1));
    for (int turn = 0; turn < N2 - 1; turn++) {
        six s;
        for (int k = 0; k < N; k++) {
            s.val[k] = 0;
        }
        for (int j = 0; j < N; j++) {
            int d;
            cin >> d;
            d--;
            s.val[d]++;
        }
        rolls[turn] = s;
        pair<int, int> 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;
}

yukicoder

結果

テストケース

ソースコード