#862840 (C++17(gcc12)) No.5006 Hidden Maze

• 問題: No.5006 Hidden Maze
• ユーザー: platinum
• 提出日時: 2023-04-25 15:12:25
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 84 ms / 2,000 ms
• コード長: 2,994 bytes
• コンパイル時間: 2,341 ms
• コンパイル使用メモリ: 207,136 KB
• 実行使用メモリ: 24,372 KB
• スコア: 77,894
• 平均クエリ数: 222.06
• 最終ジャッジ日時: 2023-04-25 15:12:39
• 合計ジャッジ時間: 11,957 ms
• ジャッジサーバーID （参考情報）: judge13 / judge12

ファイルパターン	結果
other	AC * 100

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
using vv = vector<vector<int>>;
const int INF = (int)1e9;
const LL LINF = (LL)1e18;
const double eps = 1e-5;
const int min_p = 6;
const int max_p = 15;
int dy[4] = {-1, 1, 0, 0};
int dx[4] = {0, 0, -1, 1};
string dir = "UDLR";
double h[20][21], v[21][20];
int H, W, poss;
double p;
struct node{
    int y, x;
    double d;
    node(int y, int x, double d) : y(y), x(x), d(d) {}
    bool operator> (const node &u) const{
        return d > u.d;
    }
};
string dijkstra(){
    double dist[20][20];
    rep(i,20){
        rep(j,20) dist[i][j] = INF;
    }
    char par[20][20];
    dist[0][0] = 0;
    priority_queue<node,vector<node>,greater<>> pq;
    pq.emplace(0, 0, 0);
    while(!pq.empty()){
        node u = pq.top(); pq.pop();
        if(dist[u.y][u.x] < u.d) continue;
        rep(k,4){
            int ny = u.y + dy[k], nx = u.x + dx[k];
            if(ny < 0 || ny >= 20) continue;
            if(nx < 0 || nx >= 20) continue;
            double e = 0;
            if(k == 0) e = 1.0 / (1.0 - v[u.y][u.x]);
            else if(k == 1) e = 1.0 / (1.0 - v[u.y+1][u.x]);
            else if(k == 2) e = 1.0 / (1.0 - h[u.y][u.x]);
            else e = 1.0 / (1.0 - h[u.y][u.x+1]);
            double nd = u.d + e;
            if(dist[ny][nx] <= nd) continue;
            pq.emplace(ny, nx, nd);
            dist[ny][nx] = nd;
            par[ny][nx] = dir[k];
        }
    }
    int now_y = 19, now_x = 19;
    string res;
    while(now_y != 0 || now_x != 0){
        char c = par[now_y][now_x];
        res += c;
        if(c == 'U') now_y++;
        else if(c == 'D') now_y--;
        else if(c == 'L') now_x++;
        else now_x--;
    }
    reverse(res.begin(), res.end());
    return res;
}
double update(double now_p){
    if(now_p < eps) return now_p;
    double wall_p = now_p + (1.0 - now_p) * p;
    return now_p / wall_p;
}
void update_all(){
    double tot = 0.0;
    rep(i,20){
        rep(j,19){
            tot += h[i][j+1];
        }
    }
    rep(i,19){
        rep(j,20){
            tot += v[i+1][j];
        }
    }
    tot /= 150.0;
    rep(i,20){
        rep(j,19){
            h[i][j+1] /= tot;
        }
    }
    rep(i,19){
        rep(j,20){
            v[i+1][j] /= tot;
        }
    }
}
int main(){
    cin >> H >> W >> poss;
    assert(H == 20 && W == 20);
    assert(min_p <= poss && poss <= max_p);
    p = poss;
    p /= 100.0;
    rep(i,20){
        h[i][0] = 1.0;
        h[i][20] = 1.0;
    }
    rep(j,20){
        v[0][j] = 1.0;
        v[20][j] = 1.0;
    }
    rep(i,20){
        rep(j,19) h[i][j+1] = 150.0 / 760.0;
    }
    rep(i,19){
        rep(j,20) v[i+1][j] = 150.0 / 760.0;
    }
    rep(trial,1001){
        string ans = dijkstra();
        cout << ans << endl;
        int res;
        cin >> res;
        if(res == -1){
            cerr << "score = " << 1000 - trial << endl;
            break;
        }
        int y = 0, x = 0;
        int siz = ans.size();
        rep(i,res){
            char c = ans[i];
            if(c == 'U') v[y][x] = 0, y--;
            if(c == 'D') v[y+1][x] = 0, y++;
            if(c == 'L') h[y][x] = 0, x--;
            if(c == 'R') h[y][x+1] = 0, x++;
        }
        if(res < siz){
            char c = ans[res];
            if(c == 'U') v[y][x] = update(v[y][x]);
            if(c == 'D') v[y+1][x] = update(v[y+1][x]);
            if(c == 'L') h[y][x] = update(h[y][x]);
            if(c == 'R') h[y][x+1] = update(h[y][x+1]);
        }
        update_all();
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX