結果

問題 No.5006 Hidden Maze
ユーザー 👑 platinumplatinum
提出日時 2022-06-12 00:13:20
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 69 ms / 2,000 ms
コード長 4,253 bytes
コンパイル時間 1,848 ms
実行使用メモリ 22,868 KB
スコア 78,002
平均クエリ数 220.98
最終ジャッジ日時 2022-06-12 13:36:22
合計ジャッジ時間 9,165 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 23 ms
21,916 KB
testcase_01 AC 42 ms
21,780 KB
testcase_02 AC 21 ms
22,456 KB
testcase_03 AC 22 ms
21,940 KB
testcase_04 AC 20 ms
21,904 KB
testcase_05 AC 41 ms
21,868 KB
testcase_06 AC 23 ms
21,940 KB
testcase_07 AC 30 ms
22,228 KB
testcase_08 AC 22 ms
21,892 KB
testcase_09 AC 63 ms
21,952 KB
testcase_10 AC 21 ms
22,240 KB
testcase_11 AC 23 ms
22,600 KB
testcase_12 AC 27 ms
22,276 KB
testcase_13 AC 25 ms
22,288 KB
testcase_14 AC 38 ms
22,300 KB
testcase_15 AC 19 ms
21,904 KB
testcase_16 AC 21 ms
21,780 KB
testcase_17 AC 28 ms
21,904 KB
testcase_18 AC 29 ms
21,916 KB
testcase_19 AC 22 ms
21,940 KB
testcase_20 AC 21 ms
22,004 KB
testcase_21 AC 20 ms
21,928 KB
testcase_22 AC 21 ms
21,768 KB
testcase_23 AC 25 ms
22,228 KB
testcase_24 AC 25 ms
21,940 KB
testcase_25 AC 20 ms
22,644 KB
testcase_26 AC 37 ms
22,216 KB
testcase_27 AC 23 ms
22,276 KB
testcase_28 AC 32 ms
21,904 KB
testcase_29 AC 26 ms
22,456 KB
testcase_30 AC 21 ms
21,940 KB
testcase_31 AC 22 ms
21,904 KB
testcase_32 AC 28 ms
22,704 KB
testcase_33 AC 27 ms
22,588 KB
testcase_34 AC 23 ms
21,940 KB
testcase_35 AC 24 ms
22,624 KB
testcase_36 AC 26 ms
21,964 KB
testcase_37 AC 50 ms
21,784 KB
testcase_38 AC 40 ms
21,952 KB
testcase_39 AC 23 ms
21,904 KB
testcase_40 AC 20 ms
22,716 KB
testcase_41 AC 19 ms
21,904 KB
testcase_42 AC 20 ms
22,632 KB
testcase_43 AC 22 ms
22,276 KB
testcase_44 AC 20 ms
21,928 KB
testcase_45 AC 25 ms
21,904 KB
testcase_46 AC 66 ms
21,904 KB
testcase_47 AC 39 ms
22,868 KB
testcase_48 AC 67 ms
21,916 KB
testcase_49 AC 66 ms
21,940 KB
testcase_50 AC 22 ms
21,952 KB
testcase_51 AC 20 ms
22,540 KB
testcase_52 AC 21 ms
21,904 KB
testcase_53 AC 34 ms
22,612 KB
testcase_54 AC 20 ms
22,600 KB
testcase_55 AC 27 ms
21,780 KB
testcase_56 AC 23 ms
22,228 KB
testcase_57 AC 23 ms
21,940 KB
testcase_58 AC 27 ms
21,904 KB
testcase_59 AC 19 ms
22,216 KB
testcase_60 AC 18 ms
21,940 KB
testcase_61 AC 19 ms
22,728 KB
testcase_62 AC 24 ms
22,624 KB
testcase_63 AC 22 ms
21,964 KB
testcase_64 AC 30 ms
22,636 KB
testcase_65 AC 27 ms
22,444 KB
testcase_66 AC 20 ms
22,228 KB
testcase_67 AC 33 ms
21,976 KB
testcase_68 AC 43 ms
21,992 KB
testcase_69 AC 38 ms
22,636 KB
testcase_70 AC 20 ms
21,952 KB
testcase_71 AC 19 ms
21,904 KB
testcase_72 AC 21 ms
22,228 KB
testcase_73 AC 21 ms
21,748 KB
testcase_74 AC 20 ms
22,636 KB
testcase_75 AC 31 ms
21,964 KB
testcase_76 AC 21 ms
21,952 KB
testcase_77 AC 67 ms
21,904 KB
testcase_78 AC 43 ms
21,892 KB
testcase_79 AC 69 ms
22,216 KB
testcase_80 AC 24 ms
22,456 KB
testcase_81 AC 24 ms
21,780 KB
testcase_82 AC 22 ms
22,228 KB
testcase_83 AC 18 ms
21,940 KB
testcase_84 AC 44 ms
22,600 KB
testcase_85 AC 29 ms
22,596 KB
testcase_86 AC 26 ms
22,612 KB
testcase_87 AC 27 ms
22,624 KB
testcase_88 AC 67 ms
21,780 KB
testcase_89 AC 69 ms
21,892 KB
testcase_90 AC 24 ms
21,952 KB
testcase_91 AC 23 ms
21,952 KB
testcase_92 AC 26 ms
21,892 KB
testcase_93 AC 21 ms
22,588 KB
testcase_94 AC 23 ms
21,916 KB
testcase_95 AC 20 ms
21,904 KB
testcase_96 AC 18 ms
22,004 KB
testcase_97 AC 58 ms
22,228 KB
testcase_98 AC 25 ms
22,540 KB
testcase_99 AC 32 ms
22,004 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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;

/*
string bfs(){
	int dist[20][20];
	rep(i,20){
		rep(j,20) dist[i][j] = -1;
	}
	dist[0][0] = 0;
	queue<P> q;
	q.emplace(0, 0);
	while(!q.empty()){
		pair<int,int> p = q.front(); q.pop();
		int y = p.first, x = p.second;
		int d = dist[y][x];
		if(v[y][x] < 0.5 && dist[y-1][x] == -1){
			dist[y-1][x] = d + 1;
			q.emplace(y - 1, x);
		}
		if(v[y+1][x] < 0.5 && dist[y+1][x] == -1){
			dist[y+1][x] = d + 1;
			q.emplace(y + 1, x);
		}
		if(h[y][x] < 0.5 && dist[y][x-1] == -1){
			dist[y][x-1] = d + 1;
			q.emplace(y, x - 1);
		}
		if(h[y][x+1] < 0.5 && dist[y][x+1] == -1){
			dist[y][x+1] = d + 1;
			q.emplace(y, x + 1);
		}
	}
	string res;
	int y = 19, x = 19;
	if(dist[y][x] == -1){
		rep(i,19) res.push_back('R');
		rep(i,19) res.push_back('D');
		return res;
	}
	while(y != 0 || x != 0){
		int d = dist[y][x];
		if(v[y][x] < 0.5 && dist[y-1][x] == d - 1){
			res.push_back('D');
			y--;
		}
		else if(v[y+1][x] < 0.5 && dist[y+1][x] == d - 1){
			res.push_back('U');
			y++;
		}
		else if(h[y][x] < 0.5 && dist[y][x-1] == d - 1){
			res.push_back('R');
			x--;
		}
		else if(h[y][x+1] < 0.5 && dist[y][x+1] == d - 1){
			res.push_back('L');
			x++;
		}
		else break;
	}
	reverse(res.begin(), res.end());
	return res;
}
*/

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;
}

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] = 0.5;
	}
	rep(i,19){
		rep(j,20) v[i+1][j] = 0.5;
	}

	rep(trial,1001){
		//string ans = bfs();
		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] > eps) v[y][x] = 1.0 - (1.0 - v[y][x]) * p;
			if(c == 'D' && v[y+1][x] > eps) v[y+1][x] = 1.0 - (1.0 - v[y+1][x]) * p;
			if(c == 'L' && h[y][x] > eps) h[y][x] = 1.0 - (1.0 - h[y][x]) * p;
			if(c == 'R' && h[y][x+1] > eps) h[y][x+1] = 1.0 - (1.0 - h[y][x+1]) * p;
			*/
			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]);
		}
	}

	return 0;
}
0