結果

問題 No.5006 Hidden Maze
ユーザー wanuiwanui
提出日時 2022-06-12 16:35:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 11,355 bytes
コンパイル時間 2,625 ms
実行使用メモリ 22,768 KB
スコア 40,562
平均クエリ数 594.92
最終ジャッジ日時 2022-06-12 16:35:20
合計ジャッジ時間 14,378 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 76 ms
22,760 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 22 ms
21,952 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 36 ms
22,748 KB
testcase_08 AC 79 ms
22,572 KB
testcase_09 AC 21 ms
22,596 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 29 ms
21,904 KB
testcase_14 WA -
testcase_15 AC 19 ms
21,768 KB
testcase_16 AC 21 ms
21,736 KB
testcase_17 AC 22 ms
21,928 KB
testcase_18 AC 76 ms
21,768 KB
testcase_19 AC 21 ms
22,432 KB
testcase_20 WA -
testcase_21 AC 34 ms
21,928 KB
testcase_22 AC 42 ms
21,892 KB
testcase_23 AC 25 ms
22,216 KB
testcase_24 AC 77 ms
21,892 KB
testcase_25 AC 25 ms
22,456 KB
testcase_26 AC 73 ms
22,552 KB
testcase_27 AC 21 ms
21,952 KB
testcase_28 AC 20 ms
21,768 KB
testcase_29 AC 35 ms
22,584 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 82 ms
21,940 KB
testcase_33 WA -
testcase_34 AC 28 ms
22,596 KB
testcase_35 AC 29 ms
21,880 KB
testcase_36 AC 20 ms
22,216 KB
testcase_37 AC 29 ms
22,444 KB
testcase_38 AC 48 ms
22,432 KB
testcase_39 AC 19 ms
22,264 KB
testcase_40 AC 22 ms
22,588 KB
testcase_41 WA -
testcase_42 AC 25 ms
22,004 KB
testcase_43 AC 78 ms
22,516 KB
testcase_44 WA -
testcase_45 AC 85 ms
21,904 KB
testcase_46 AC 86 ms
21,916 KB
testcase_47 AC 20 ms
22,612 KB
testcase_48 WA -
testcase_49 AC 82 ms
22,584 KB
testcase_50 WA -
testcase_51 AC 29 ms
22,432 KB
testcase_52 WA -
testcase_53 AC 83 ms
22,516 KB
testcase_54 WA -
testcase_55 AC 21 ms
21,928 KB
testcase_56 AC 26 ms
21,940 KB
testcase_57 AC 77 ms
22,432 KB
testcase_58 AC 29 ms
22,572 KB
testcase_59 AC 20 ms
21,880 KB
testcase_60 WA -
testcase_61 AC 24 ms
21,952 KB
testcase_62 WA -
testcase_63 WA -
testcase_64 AC 45 ms
21,896 KB
testcase_65 AC 22 ms
21,964 KB
testcase_66 AC 22 ms
22,228 KB
testcase_67 AC 28 ms
22,504 KB
testcase_68 WA -
testcase_69 AC 29 ms
22,596 KB
testcase_70 WA -
testcase_71 AC 22 ms
21,780 KB
testcase_72 AC 19 ms
22,564 KB
testcase_73 AC 24 ms
21,768 KB
testcase_74 WA -
testcase_75 AC 82 ms
21,992 KB
testcase_76 AC 19 ms
22,276 KB
testcase_77 AC 41 ms
21,904 KB
testcase_78 AC 26 ms
21,940 KB
testcase_79 AC 76 ms
21,796 KB
testcase_80 WA -
testcase_81 AC 23 ms
21,952 KB
testcase_82 AC 48 ms
22,432 KB
testcase_83 AC 21 ms
21,928 KB
testcase_84 AC 21 ms
22,596 KB
testcase_85 AC 23 ms
22,572 KB
testcase_86 AC 18 ms
22,228 KB
testcase_87 AC 34 ms
22,420 KB
testcase_88 AC 39 ms
21,904 KB
testcase_89 AC 75 ms
22,264 KB
testcase_90 WA -
testcase_91 AC 28 ms
21,976 KB
testcase_92 AC 35 ms
21,780 KB
testcase_93 AC 21 ms
22,552 KB
testcase_94 WA -
testcase_95 AC 25 ms
22,204 KB
testcase_96 AC 19 ms
21,904 KB
testcase_97 AC 77 ms
22,704 KB
testcase_98 AC 68 ms
21,940 KB
testcase_99 AC 23 ms
22,432 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
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...);}
void perr0(){}; template<typename H,typename... T> void perr0(H h,T... t){cerr<<h;perr0(t...);}
void perr(){perr0("\n");}; template<typename H,typename... T>void perr(H h,T... t){perr0(h);if(sizeof...(T)>0)perr0(" ");perr(t...);}
void ioinit() { cout<<fixed<<setprecision(15); cerr<<fixed<<setprecision(6); ios_base::sync_with_stdio(0); cin.tie(0); }
// clang-format on
using pii = pair<int, int>;
using tii = tuple<int, int, int>;

struct point {
    int i;
    int j;
};
bool operator==(const point &lhs, const point &rhs) { return (lhs.i == rhs.i && lhs.j == rhs.j); }
bool operator!=(const point &lhs, const point &rhs) { return !(lhs == rhs); }
bool operator<(const point &lhs, const point &rhs) {
    if (lhs.i != rhs.i) {
        return lhs.i < rhs.i;
    }
    return lhs.j < rhs.j;
}
std::ostream &operator<<(std::ostream &os, point &pt) {
    string s;
    s.push_back('(');
    s = s + to_string(pt.i);
    s = s + ", ";
    s = s + to_string(pt.j);
    s.push_back(')');
    return os << s;
}

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);
}
double uniform(double x, double y) {
    const int RND = 1e8;
    double mean = (x + y) / 2.0;
    double dif = y - mean;
    double p = double(engine() % RND) / RND;
    return mean + dif * (1.0 - 2.0 * p);
}
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 = cur_time * (end_temp - begin_temp) / (end_time - begin_time) + (end_time * begin_temp - end_temp * begin_time) / (end_time - begin_time);
    return (exp((new_score - old_score) / temp) > double(engine() % ANNEAL_RND) / ANNEAL_RND + ANNEAL_EPS);
}

const int N = 20;
const int OPS = 1000;
const int LOCAL = 0;

double P;
const int R = 0;
const int D = 1;
const int L = 2;
const int U = 3;
vector<point> mvs = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
int c2d(char c) {
    if (c == 'R') return R;
    if (c == 'D') return D;
    if (c == 'L') return L;
    if (c == 'U') return U;
    return -1;
}
char d2c(int d) {
    if (d == R) return 'R';
    if (d == D) return 'D';
    if (d == L) return 'L';
    if (d == U) return 'U';
    return '?';
}
vector<point> l_table[N][N];
int l_btable[N][N];
bool l_check_table() {
    queue<point> que;
    que.push({0, 0});
    vector<vector<bool>> done(N, vector<bool>(N));
    while (que.size()) {
        point p = que.front();
        que.pop();
        if (done[p.i][p.j]) continue;
        done[p.i][p.j] = true;
        for (auto mv : l_table[p.i][p.j]) {
            int ni = p.i + mv.i;
            int nj = p.j + mv.j;
            que.push({ni, nj});
        }
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (!done[i][j]) return false;
        }
    }
    return true;
}
void l_maketable(int M) {
    if (!LOCAL) return;
    while (true) {
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                l_table[i][j].clear();
                l_btable[i][j] = 0;
            }
        }
        set<tii> wallset;
        int nwall = 0;
        while (nwall < M) {
            if (randint(0, 1) == 0) {
                // 右
                int i = randint(0, N - 1);
                int j = randint(0, N - 2);
                tii w = {0, i, j};
                if (wallset.count(w)) continue;
                wallset.insert(w);
            } else {
                // 下
                int i = randint(0, N - 2);
                int j = randint(0, N - 1);
                tii w = {1, i, j};
                if (wallset.count(w)) continue;
                wallset.insert(w);
            }
            nwall++;
        }
        // RDLU の順
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if (i + 1 < N && !wallset.count({1, i, j})) {
                    l_table[i][j].push_back({1, 0});  //下
                    l_btable[i][j] += (1 << D);
                }
                if (i - 1 >= 0 && !wallset.count({1, i - 1, j})) {
                    l_table[i][j].push_back({-1, 0});  //上
                    l_btable[i][j] += (1 << U);
                }
                if (j + 1 < N && !wallset.count({0, i, j})) {
                    l_table[i][j].push_back({0, 1});  //右
                    l_btable[i][j] += (1 << R);
                }
                if (j - 1 >= 0 && !wallset.count({0, i, j - 1})) {
                    l_table[i][j].push_back({0, -1});  //左
                    l_btable[i][j] += (1 << L);
                }
            }
        }
        if (!l_check_table()) continue;
        perr("M=", M);
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                perr0("・");
                if (j + 1 < N && wallset.count({0, i, j})) {
                    perr0("│");
                } else {
                    perr0("　");
                }
            }
            perr0("\n");
            for (int j = 0; j < N; j++) {
                if (i + 1 < N && wallset.count({1, i, j})) {
                    perr0("─");
                } else {
                    perr0("　");
                }
                perr0("　");
            }
            perr0("\n");
        }
        break;
    }
}
int request(string ops) {
    cout << ops << endl;
    if (!LOCAL) {
        int res;
        cin >> res;
        return res;
    }
    {
        bool hitwall = false;
        point cur = {0, 0};
        point goal = {N - 1, N - 1};
        for (auto op : ops) {
            int d = 0;
            if (op == 'R') d = R;
            if (op == 'D') d = D;
            if (op == 'L') d = L;
            if (op == 'U') d = U;
            if (!(l_btable[cur.i][cur.j] & (1 << d))) {
                hitwall = true;
                break;
            }
            auto mv = mvs[d];
            cur = {cur.i + mv.i, cur.j + mv.j};
        }
        if (!hitwall && cur == goal) {
            return -1;
        }
    }
    {
        int opnum = 0;
        point cur = {0, 0};
        for (auto op : ops) {
            int d = c2d(op);
            if (!(l_btable[cur.i][cur.j] & (1 << d))) {
                return opnum;
            }
            if (uniform(0.0, 1.0) < P) {
                return opnum;
            }
            auto mv = mvs[d];
            cur = {cur.i + mv.i, cur.j + mv.j};
            opnum++;
        }
        return opnum;
    }
}
string rand_combination(string s0, int start_ind) {
    string s = s0;
    int r = 0;
    int d = 0;
    for (int j = 0; j < start_ind; j++) {
        if (s[j] == 'R') r++;
        if (s[j] == 'D') d++;
    }
    for (int i = start_ind; i < int(s.size()); i++) {
        if (r < N - 1 && d < N - 1) {
            if (randint(0, 1)) {
                s[i] = 'R';
                r++;
            } else {
                s[i] = 'D';
                d++;
            }
        } else if (r < N - 1) {
            s[i] = 'R';
            r++;
        } else {
            s[i] = 'D';
            d++;
        }
    }
    return s;
}
string randrd(int length) {
    string s;
    for (int o = 0; o < length; o++) {
        if (randint(0, 1)) {
            s.push_back('R');
        } else {
            s.push_back('D');
        }
    }
    return s;
}
string makeop(int opid, vector<pair<int, string>> &history) {
    // とりあえず R と D だけ。それで到達できないケースは諦める。
    int N2 = 2 * N - 2;

    // 全探索モード
    do {
        const int BRUTE_FORCE_START = 28;
        pair<int, string> maxhist = {0, ""};
        for (auto h : history) {
            if (maxhist.first < h.first) {
                maxhist = h;
            }
        }
        if (maxhist.first < BRUTE_FORCE_START) {
            break;
        }
        unordered_set<string> hist_ops;
        for (auto h : history) {
            hist_ops.insert(h.second);
        }
        int baseind = maxhist.first + 1;
        int brute_force_num = N2 - baseind;

        int r0 = 0;
        int d0 = 0;
        {
            string s = maxhist.second;
            for (int j = 0; j < baseind; j++) {
                if (s[j] == 'R') r0++;
                if (s[j] == 'D') d0++;
            }
        }
        for (int i = 0; i < (1 << brute_force_num); i++) {
            string s = maxhist.second;
            int r = r0;
            int d = d0;
            for (int j = 0; j < brute_force_num; j++) {
                char c;
                if ((i >> j) & 1) {
                    c = 'R';
                    r++;
                } else {
                    c = 'D';
                    c++;
                }
                s[j + baseind] = c;
            }
            if (r > N - 1 || d > N - 1) continue;
            if (hist_ops.count(s)) continue;
            return s;
        }
    } while (0);

    // 完全な無作為
    if (history.size() < 50 || opid % 10 == 0) {
        string s;
        s.resize(N2);
        return rand_combination(s, 0);
    }

    // 適当にサンプリング+改変
    {
        pair<int, string> sample = history.back();
        double total = 0;
        for (auto h : history) {
            total += (pow(1.0 * h.first, 2.0) + 0.5);
        }
        double rat = uniform(0.0, 1.0 * total);
        double cum = 0;
        for (auto h : history) {
            cum += (pow(1.0 * h.first, 2.0) + 0.5);
            if (rat < cum) {
                sample = h;
                break;
            }
        }

        if (sample.second.size() <= 1) {
            return randrd(N2);
        }

        // 後ろの方を適当に改変
        string sample_str = sample.second;
        int sample_moves = sample.first;
        int sz = sample_str.size();
        int changestart = sample_moves + randint(-2, 2);
        if (changestart < 0) changestart = 0;
        return rand_combination(sample_str, changestart);
    }
    return "";
}
void solve() {
    int opslimit = OPS;
    opslimit = 1000;

    int maxres = 0;
    vector<pair<int, string>> history;
    for (int opid = 0; opid < opslimit; opid++) {
        string s = makeop(opid, history);
        int res = request(s);
        if (res < 0) {
            perr(opid, "success!");
            return;
        }
        history.push_back({res, s});
        maxres = max(maxres, res);
        if (LOCAL) {
            perr(res, maxres);
        }
    }
    perr(opslimit, "failure!");
}
int main() {
    marathon_init();
    ioinit();
    int _h, _w;
    cin >> _h >> _w >> P;
    P *= 0.01;
    int M = 200;
    if (LOCAL) cin >> M;
    perr("P=", P);
    l_maketable(M);
    solve();
    return 0;
}
0