#770325 (C++17) No.5006 Hidden Maze

提出ソース

結果

問題	No.5006 Hidden Maze
ユーザー	platinum
提出日時	2022-06-11 23:51:40
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	74 ms / 2,000 ms
コード長	3,899 bytes
コンパイル時間	2,613 ms
実行使用メモリ	22,888 KB
スコア	63,840
平均クエリ数	362.60
最終ジャッジ日時	2022-06-12 13:36:00
合計ジャッジ時間	12,279 ms
ジャッジサーバーID （参考情報）	judge15 / judge14
	純コード判定しない問題か言語

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	24 ms 22,276 KB
testcase_01	AC	40 ms 21,940 KB
testcase_02	AC	23 ms 22,004 KB
testcase_03	AC	31 ms 22,016 KB
testcase_04	AC	33 ms 22,016 KB
testcase_05	AC	47 ms 22,060 KB
testcase_06	AC	39 ms 22,276 KB
testcase_07	AC	69 ms 21,768 KB
testcase_08	AC	69 ms 21,904 KB
testcase_09	AC	47 ms 21,964 KB
testcase_10	AC	27 ms 22,552 KB
testcase_11	AC	27 ms 22,888 KB
testcase_12	AC	29 ms 21,904 KB
testcase_13	AC	27 ms 22,276 KB
testcase_14	AC	49 ms 21,952 KB
testcase_15	AC	23 ms 21,768 KB
testcase_16	AC	26 ms 22,600 KB
testcase_17	AC	24 ms 21,904 KB
testcase_18	AC	47 ms 22,228 KB
testcase_19	AC	26 ms 21,940 KB
testcase_20	AC	26 ms 21,916 KB
testcase_21	AC	22 ms 22,028 KB
testcase_22	AC	27 ms 21,904 KB
testcase_23	AC	35 ms 21,916 KB
testcase_24	AC	43 ms 22,276 KB
testcase_25	AC	23 ms 22,004 KB
testcase_26	AC	67 ms 21,940 KB
testcase_27	AC	70 ms 22,624 KB
testcase_28	AC	28 ms 21,892 KB
testcase_29	AC	66 ms 21,792 KB
testcase_30	AC	25 ms 22,444 KB
testcase_31	AC	26 ms 22,468 KB
testcase_32	AC	39 ms 22,588 KB
testcase_33	AC	37 ms 21,780 KB
testcase_34	AC	25 ms 21,940 KB
testcase_35	AC	34 ms 21,792 KB
testcase_36	AC	71 ms 22,288 KB
testcase_37	AC	68 ms 22,600 KB
testcase_38	AC	34 ms 22,016 KB
testcase_39	AC	44 ms 21,904 KB
testcase_40	AC	25 ms 21,904 KB
testcase_41	AC	24 ms 21,792 KB
testcase_42	AC	22 ms 22,228 KB
testcase_43	AC	19 ms 22,288 KB
testcase_44	AC	20 ms 22,588 KB
testcase_45	AC	31 ms 21,928 KB
testcase_46	AC	68 ms 22,600 KB
testcase_47	AC	22 ms 21,916 KB
testcase_48	AC	65 ms 21,952 KB
testcase_49	AC	68 ms 22,444 KB
testcase_50	AC	25 ms 21,892 KB
testcase_51	AC	28 ms 21,928 KB
testcase_52	AC	30 ms 21,780 KB
testcase_53	AC	26 ms 21,768 KB
testcase_54	AC	34 ms 22,276 KB
testcase_55	AC	25 ms 21,952 KB
testcase_56	AC	29 ms 21,904 KB
testcase_57	AC	58 ms 22,240 KB
testcase_58	AC	55 ms 22,276 KB
testcase_59	AC	19 ms 21,992 KB
testcase_60	AC	27 ms 22,276 KB
testcase_61	AC	21 ms 22,228 KB
testcase_62	AC	41 ms 21,892 KB
testcase_63	AC	21 ms 21,940 KB
testcase_64	AC	39 ms 21,904 KB
testcase_65	AC	26 ms 21,672 KB
testcase_66	AC	26 ms 22,596 KB
testcase_67	AC	44 ms 21,976 KB
testcase_68	AC	46 ms 21,904 KB
testcase_69	AC	49 ms 22,108 KB
testcase_70	AC	23 ms 22,504 KB
testcase_71	AC	25 ms 22,276 KB
testcase_72	AC	21 ms 21,952 KB
testcase_73	AC	42 ms 21,940 KB
testcase_74	AC	33 ms 21,916 KB
testcase_75	AC	27 ms 21,916 KB
testcase_76	AC	69 ms 21,780 KB
testcase_77	AC	64 ms 21,952 KB
testcase_78	AC	37 ms 22,808 KB
testcase_79	AC	74 ms 21,940 KB
testcase_80	AC	26 ms 22,588 KB
testcase_81	AC	20 ms 22,228 KB
testcase_82	AC	21 ms 22,216 KB
testcase_83	AC	19 ms 21,792 KB
testcase_84	AC	29 ms 21,780 KB
testcase_85	AC	63 ms 21,792 KB
testcase_86	AC	23 ms 21,952 KB
testcase_87	AC	36 ms 21,780 KB
testcase_88	AC	34 ms 22,016 KB
testcase_89	AC	64 ms 22,632 KB
testcase_90	AC	29 ms 22,288 KB
testcase_91	AC	30 ms 21,940 KB
testcase_92	AC	31 ms 22,004 KB
testcase_93	AC	21 ms 21,992 KB
testcase_94	AC	31 ms 21,952 KB
testcase_95	AC	51 ms 22,600 KB
testcase_96	AC	23 ms 21,952 KB
testcase_97	AC	64 ms 21,928 KB
testcase_98	AC	57 ms 21,792 KB
testcase_99	AC	23 ms 21,892 KB

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

ソースコード

raw source code

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

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, d;
	node(int y, int x, int d) : y(y), x(x), d(d) {}
	bool operator> (const node &u) const{
		return d > u.d;
	}
};

string dijkstra(){
	int 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;
			int 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]);
			int 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;
}

int main(){
	int H, W, poss;
	cin >> H >> W >> poss;
	assert(H == 20 && W == 20);
	assert(min_p <= poss && poss <= max_p);
	double p = poss;
	p /= 100;

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

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

	return 0;
}

yukicoder

結果

テストケース

ソースコード