結果

問題 No.5006 Hidden Maze
ユーザー 👑 NachiaNachia
提出日時 2022-06-12 16:44:07
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 73 ms / 2,000 ms
コード長 4,122 bytes
コンパイル時間 1,058 ms
実行使用メモリ 22,868 KB
スコア 86,204
平均クエリ数 138.96
最終ジャッジ日時 2022-06-12 16:44:16
合計ジャッジ時間 8,733 ms
ジャッジサーバーID
（参考情報） 		judge10 / judge11
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 23 ms
21,928 KB
testcase_01 AC 36 ms
21,980 KB
testcase_02 AC 22 ms
21,780 KB
testcase_03 AC 24 ms
22,600 KB
testcase_04 AC 21 ms
22,576 KB
testcase_05 AC 38 ms
21,952 KB
testcase_06 AC 22 ms
21,992 KB
testcase_07 AC 51 ms
22,588 KB
testcase_08 AC 71 ms
21,928 KB
testcase_09 AC 26 ms
22,596 KB
testcase_10 AC 22 ms
21,940 KB
testcase_11 AC 23 ms
22,216 KB
testcase_12 AC 24 ms
21,824 KB
testcase_13 AC 23 ms
21,928 KB
testcase_14 AC 23 ms
21,892 KB
testcase_15 AC 24 ms
22,456 KB
testcase_16 AC 33 ms
21,904 KB
testcase_17 AC 24 ms
21,588 KB
testcase_18 AC 28 ms
21,892 KB
testcase_19 AC 23 ms
21,928 KB
testcase_20 AC 22 ms
21,660 KB
testcase_21 AC 22 ms
21,892 KB
testcase_22 AC 25 ms
21,952 KB
testcase_23 AC 23 ms
21,992 KB
testcase_24 AC 24 ms
21,780 KB
testcase_25 AC 20 ms
21,756 KB
testcase_26 AC 39 ms
22,216 KB
testcase_27 AC 22 ms
22,432 KB
testcase_28 AC 23 ms
22,600 KB
testcase_29 AC 31 ms
21,892 KB
testcase_30 AC 22 ms
21,892 KB
testcase_31 AC 21 ms
21,940 KB
testcase_32 AC 25 ms
21,768 KB
testcase_33 AC 21 ms
21,780 KB
testcase_34 AC 29 ms
22,620 KB
testcase_35 AC 22 ms
21,928 KB
testcase_36 AC 23 ms
21,880 KB
testcase_37 AC 64 ms
22,216 KB
testcase_38 AC 36 ms
22,588 KB
testcase_39 AC 23 ms
22,444 KB
testcase_40 AC 23 ms
22,228 KB
testcase_41 AC 21 ms
21,940 KB
testcase_42 AC 23 ms
21,992 KB
testcase_43 AC 25 ms
22,004 KB
testcase_44 AC 21 ms
21,892 KB
testcase_45 AC 27 ms
21,992 KB
testcase_46 AC 39 ms
22,252 KB
testcase_47 AC 22 ms
22,588 KB
testcase_48 AC 29 ms
21,952 KB
testcase_49 AC 47 ms
22,216 KB
testcase_50 AC 20 ms
21,904 KB
testcase_51 AC 20 ms
21,756 KB
testcase_52 AC 25 ms
21,904 KB
testcase_53 AC 26 ms
21,780 KB
testcase_54 AC 20 ms
22,216 KB
testcase_55 AC 22 ms
21,928 KB
testcase_56 AC 21 ms
22,868 KB
testcase_57 AC 27 ms
21,892 KB
testcase_58 AC 22 ms
21,940 KB
testcase_59 AC 27 ms
22,276 KB
testcase_60 AC 22 ms
21,756 KB
testcase_61 AC 21 ms
21,892 KB
testcase_62 AC 24 ms
21,904 KB
testcase_63 AC 22 ms
22,456 KB
testcase_64 AC 35 ms
22,444 KB
testcase_65 AC 21 ms
21,756 KB
testcase_66 AC 22 ms
21,892 KB
testcase_67 AC 37 ms
21,980 KB
testcase_68 AC 31 ms
21,904 KB
testcase_69 AC 31 ms
21,880 KB
testcase_70 AC 22 ms
21,904 KB
testcase_71 AC 24 ms
21,892 KB
testcase_72 AC 22 ms
21,992 KB
testcase_73 AC 25 ms
21,952 KB
testcase_74 AC 33 ms
21,824 KB
testcase_75 AC 26 ms
21,880 KB
testcase_76 AC 21 ms
21,940 KB
testcase_77 AC 29 ms
22,564 KB
testcase_78 AC 30 ms
21,928 KB
testcase_79 AC 72 ms
21,892 KB
testcase_80 AC 22 ms
21,940 KB
testcase_81 AC 25 ms
21,928 KB
testcase_82 AC 23 ms
21,780 KB
testcase_83 AC 21 ms
22,264 KB
testcase_84 AC 37 ms
21,892 KB
testcase_85 AC 26 ms
21,756 KB
testcase_86 AC 24 ms
22,856 KB
testcase_87 AC 26 ms
22,004 KB
testcase_88 AC 33 ms
22,576 KB
testcase_89 AC 73 ms
22,576 KB
testcase_90 AC 23 ms
21,756 KB
testcase_91 AC 27 ms
21,928 KB
testcase_92 AC 23 ms
22,276 KB
testcase_93 AC 22 ms
22,704 KB
testcase_94 AC 30 ms
21,904 KB
testcase_95 AC 25 ms
21,892 KB
testcase_96 AC 22 ms
21,892 KB
testcase_97 AC 24 ms
21,952 KB
testcase_98 AC 35 ms
21,980 KB
testcase_99 AC 23 ms
21,916 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cmath>
#include <atcoder/modint>

using namespace std;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)


const i64 INF = 1001001001001001001;
using modint = atcoder::static_modint<1000000007>;

const int H = 20;
const int W = 20;

const int dx[4] = { 0, 1, 0, -1 };
const int dy[4] = { 1, 0, -1, 0 };
const string DIRCHAR = "DRUL";



template<class E>
using nega_queue = priority_queue<E, vector<E>, greater<E>>;

int judgeInteraction(string S){
    cout << S << '\n' << flush;
    int res; cin >> res;
    return res;
}

double p;
double log_p;

double HEdge[H-1][W];
double VEdge[H][W-1];
void initEdge(){
    const double UNKNOWN = 0.35;
    rep(y,H-1) rep(x,W) HEdge[y][x] = UNKNOWN;
    rep(y,H) rep(x,W-1) VEdge[y][x] = UNKNOWN;
}


struct Pos {
    int y, x;
    Pos movedByDirection(int dir) const {
        Pos res;
        res.x = x + dx[dir];
        res.y = y + dy[dir];
        return res;
    }

    bool isInBoard() const {
        return 0 <= y && 0 <= x && y < H && x < W;
    }

    double& dirCostRef(int dir) const {
        if(!movedByDirection(dir).isInBoard()) exit(1);
        if(dir > 4) exit(1);
        switch(DIRCHAR[dir]){
        case 'L' : return VEdge[y][x-1];
        case 'R' : return VEdge[y][x];
        case 'U' : return HEdge[y-1][x];
        case 'D' : return HEdge[y][x];
        }
        exit(1);
    }

    double dirCost(int dir) const {
        if(!movedByDirection(dir).isInBoard()) return 1.0e100;
        if(dir > 4) return 1.0e100;
        switch(DIRCHAR[dir]){
        case 'L' : return VEdge[y][x-1];
        case 'R' : return VEdge[y][x];
        case 'U' : return HEdge[y-1][x];
        case 'D' : return HEdge[y][x];
        }
        return 1.0e100;
    }

    static Pos getGoal(){ return Pos{ H-1, W-1 }; }
};


vector<int> dijkstra(int turnid = 0){
    static double dist[H][W];
    static int prevdir[H][W];
    rep(y,H) rep(x,W) dist[y][x] = 1.0e100;
    rep(y,H) rep(x,W) prevdir[y][x] = -1;
    dist[0][0] = 0;
    struct DijkstraNode{
        double d; Pos p;
        bool operator>(const DijkstraNode& r) const { return d > r.d; }
    };

    const double cost_offset = -log(1.0 - p) * max(0, 400 - turnid) / 150.0;

    nega_queue<DijkstraNode> A;
    A.push({ 0.0, Pos{0, 0} });
    while(A.size()){
        auto [d,pos] = A.top();
        A.pop();
        if(dist[pos.y][pos.x] != d) continue;
        rep(dir,4){
            Pos nx = pos.movedByDirection(dir);
            if(!nx.isInBoard()) continue;
            double nxd = pos.dirCost(dir) + d + cost_offset;
            if(dist[nx.y][nx.x] <= nxd) continue;
            dist[nx.y][nx.x] = nxd;
            prevdir[nx.y][nx.x] = dir;
            A.push({ nxd, nx });
        }
    }
    
    Pos p = Pos::getGoal();
    vector<int> res;
    while(prevdir[p.y][p.x] != -1){
        res.push_back(prevdir[p.y][p.x]);
        p = p.movedByDirection(prevdir[p.y][p.x] ^ 2);
    }
    reverse(res.begin(), res.end());
    return res;
}


int ask(vector<int> D){
    string S;
    for(int d : D) S.push_back(DIRCHAR[d]);

	int res = judgeInteraction(S);
    if(res == -1) return -1;

    Pos p = { 0, 0 };
    for(int i=0; i<res; i++){
        int d = D[i];
        p.dirCostRef(d) = 0.0;
        p = p.movedByDirection(d);
        p.dirCostRef(d^2) = 0.0;
    }
    if(p.dirCostRef(D[res]) != 0.0){
        p.dirCostRef(D[res]) -= log_p;
        p = p.movedByDirection(D[res]);
        p.dirCostRef(D[res]^2) -= log_p;
    }
    return res;
}

void solve(int inH, int inW, int inP){
    initEdge();
    p = inP / 100.0;
    log_p = log(p);
    int t = 0;
    while(true){
        if(ask(dijkstra(t)) == -1) return;
        t++;
    }
}


int main(){
    initEdge();
    int h, w, pp; cin >> h >> w >> pp;
    solve(20, 20, pp);
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;
0