結果
| 問題 | No.5015 Escape from Labyrinth |
| ユーザー |
 FplusFplusF
|
| 提出日時 | 2023-04-15 14:51:49 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 110 ms / 3,000 ms |
| コード長 | 6,464 bytes |
| コンパイル時間 | 3,166 ms |
| コンパイル使用メモリ | 232,960 KB |
| 実行使用メモリ | 4,372 KB |
| スコア | 109,410 |
| 最終ジャッジ日時 | 2023-04-15 14:52:05 |
| 合計ジャッジ時間 | 15,029 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge14 |
| 純コード判定しない問題か言語 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 100 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i,n) for (int i=0;i<(int)(n);i++)#define all(v) v.begin(),v.end()using ll=long long;using pll=pair<ll,ll>;using tll=tuple<ll,ll,ll>;const ll INF=(1ll<<60);template<class T> void chmin(T &a,T b){if(a>b){a=b;}}template<class T> void chmax(T &a,T b){if(a<b){a=b;}}vector<int> pi={0,1,0,-1},pj={1,0,-1,0};string dir="RDLU";struct enemy{int i,j,d;};struct input{int n,d,h;vector<string> s;int m;vector<enemy> e;vector<vector<int>> grid_enemy;int si,sj,ki,kj,gi,gj;void input_cin(){cin >> n >> d >> h;s.resize(n);rep(i,n) cin >> s[i];cin >> m;e.resize(m);grid_enemy.resize(n);rep(i,n) grid_enemy[i].resize(n,0);rep(i,m){cin >> e[i].i >> e[i].j >> e[i].d;grid_enemy[e[i].i][e[i].j]=e[i].d;}rep(i,n){rep(j,n){if(s[i][j]=='S'){si=i;sj=j;}if(s[i][j]=='K'){ki=i;kj=j;}if(s[i][j]=='G'){gi=i;gj=j;}}}}}input;struct solver{struct result{int score,hp;vector<vector<bool>> visited;};bool outside(int i,int j){if(i<0||input.n<=i||j<0||input.n<=j) return true;else return false;}int char_idx(char c){if(c=='R') return 0;else if(c=='D') return 1;else if(c=='L') return 2;else return 3;}result play(string s){int nt=s.size();int ni=input.si,nj=input.sj;vector<vector<bool>> visited(input.n,vector<bool>(input.n));result ret={0,input.h,visited};ret.visited[ni][nj]=true;rep(t,nt){ni+=pi[char_idx(s[t])];nj+=pj[char_idx(s[t])];if(outside(ni,nj)){ret.score=-1e9;return ret;}if(!ret.visited[ni][nj]&&input.s[ni][nj]=='J') ret.score+=10;ret.visited[ni][nj]=true;ret.hp--;for(int i=ni;0<=i;i--){if(input.s[i][nj]=='#') break;if(input.s[i][nj]=='E'){if((t+1)%input.grid_enemy[i][nj]==0) ret.hp-=input.d;break;}}for(int i=ni;i<input.n;i++){if(input.s[i][nj]=='#') break;if(input.s[i][nj]=='E'){if((t+1)%input.grid_enemy[i][nj]==0) ret.hp-=input.d;break;}}for(int j=nj;0<=j;j--){if(input.s[ni][j]=='#') break;if(input.s[ni][j]=='E'){if((t+1)%input.grid_enemy[ni][j]==0) ret.hp-=input.d;break;}}for(int j=nj;j<input.n;j++){if(input.s[ni][j]=='#') break;if(input.s[ni][j]=='E'){if((t+1)%input.grid_enemy[ni][j]==0) ret.hp-=input.d;break;}}if(ret.hp<=0) return {-(int)1e9,0};}if(ni==input.gi&&nj==input.gj) ret.hp++;else ret.score=-1e9;return ret;}vector<vector<int>> bfs(int si,int sj){queue<pair<int,int>> q;q.push({si,sj});vector<vector<int>> dist(input.n,vector<int>(input.n,-1));dist[si][sj]=0;while(!q.empty()){int ni,nj;tie(ni,nj)=q.front();q.pop();rep(k,4){int ti=ni+pi[k],tj=nj+pj[k];if(outside(ti,tj)) continue;if(input.s[ti][tj]=='#'||input.s[ti][tj]=='E') continue;if(dist[ti][tj]==-1){dist[ti][tj]=dist[ni][nj]+1;q.push({ti,tj});}}}return dist;}string min_path(int si,int sj,int gi,int gj){string ret;queue<pair<int,int>> q;q.push({gi,gj});vector<vector<int>> dist(input.n,vector<int>(input.n,-1));dist[gi][gj]=0;while(!q.empty()){int ni,nj;tie(ni,nj)=q.front();q.pop();rep(k,4){int ti=ni+pi[k],tj=nj+pj[k];if(outside(ti,tj)) continue;if(input.s[ti][tj]=='#'||input.s[ti][tj]=='E') continue;if(dist[ti][tj]==-1){dist[ti][tj]=dist[ni][nj]+1;q.push({ti,tj});}}}int ni=si,nj=sj;while(ni!=gi||nj!=gj){rep(k,4){int ti=ni+pi[k],tj=nj+pj[k];if(outside(ti,tj)) continue;if(dist[ti][tj]==dist[ni][nj]-1){ni=ti;nj=tj;ret.push_back(dir[k]);break;}}}return ret;}void solve(){string root;root+=min_path(input.si,input.sj,input.ki,input.kj);int ni=input.ki,nj=input.kj;vector<vector<bool>> visited=play(root).visited;while(true){vector<vector<int>> dist=bfs(ni,nj);pair<int,pair<int,int>> p={(int)1e9,{0,0}};rep(i,input.n){rep(j,input.n){if(dist[i][j]==-1) continue;if(!visited[i][j]&&input.s[i][j]=='J') chmin(p,{dist[i][j],{i,j}});}}if(p.first==1e9) break;int ti,tj;tie(ti,tj)=p.second;string new_root=root;new_root+=min_path(ni,nj,ti,tj);if(play(new_root+min_path(ti,tj,input.gi,input.gj)).hp<=0) break;result res=play(new_root);ni=ti;nj=tj;root=new_root;visited=res.visited;}root+=min_path(ni,nj,input.gi,input.gj);result now_result=play(root);for(auto &i:root){cout << "M " << i << '\n';}}}solver;int main(){ios::sync_with_stdio(false);cin.tie(nullptr);input.input_cin();solver.solve();}