首页 > 代码库 > hdu 2251 Dungeon Master bfs
hdu 2251 Dungeon Master bfs
Dungeon Master
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 17555 | Accepted: 6835 |
Description
You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south, east, west, up or down. You cannot move diagonally and the maze is surrounded by solid rock on all sides.
Is an escape possible? If yes, how long will it take?
Is an escape possible? If yes, how long will it take?
Input
The input consists of a number of dungeons. Each dungeon description starts with a line containing three integers L, R and C (all limited to 30 in size).
L is the number of levels making up the dungeon.
R and C are the number of rows and columns making up the plan of each level.
Then there will follow L blocks of R lines each containing C characters. Each character describes one cell of the dungeon. A cell full of rock is indicated by a ‘#‘ and empty cells are represented by a ‘.‘. Your starting position is indicated by ‘S‘ and the exit by the letter ‘E‘. There‘s a single blank line after each level. Input is terminated by three zeroes for L, R and C.
L is the number of levels making up the dungeon.
R and C are the number of rows and columns making up the plan of each level.
Then there will follow L blocks of R lines each containing C characters. Each character describes one cell of the dungeon. A cell full of rock is indicated by a ‘#‘ and empty cells are represented by a ‘.‘. Your starting position is indicated by ‘S‘ and the exit by the letter ‘E‘. There‘s a single blank line after each level. Input is terminated by three zeroes for L, R and C.
Output
Each maze generates one line of output. If it is possible to reach the exit, print a line of the form
where x is replaced by the shortest time it takes to escape.
If it is not possible to escape, print the line
Escaped in x minute(s).
where x is replaced by the shortest time it takes to escape.
If it is not possible to escape, print the line
Trapped!
Sample Input
3 4 5S.....###..##..###.#############.####...###########.#######E1 3 3S###E####0 0 0
Sample Output
Escaped in 11 minute(s).Trapped!
Source
Ulm Local 1997
bfs 六个方向直接乱搞就好
#include <cstdio>#include <cmath>#include <cstring>#include <ctime>#include <iostream>#include <algorithm>#include <set>#include <vector>#include <sstream>#include <queue>#include <typeinfo>#include <fstream>typedef long long ll;using namespace std;//freopen("D.in","r",stdin);//freopen("D.out","w",stdout);#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)#define maxn 31const int inf=0x7fffffff; //无限大int visited[maxn][maxn][maxn];struct node{ int x; int y; int z; int cnt;};int dx[6]={1,-1,0,0,0,0};int dy[6]={0,0,1,-1,0,0};int dz[6]={0,0,0,0,1,-1};int main(){ int n,m,k; string s; while(cin>>n>>m>>k) { if(n==0&&m==0&&k==0) break; memset(visited,0,sizeof(visited)); node sb; node sb2; for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { cin>>s; for(int t=0;t<k;t++) { if(s[t]==‘S‘) { sb.x=i; sb.y=j; sb.z=t; sb.cnt=0; } if(s[t]==‘E‘) { sb2.x=i; sb2.y=j; sb2.z=t; } if(s[t]==‘#‘) { visited[i][j][t]=1; } } } } queue<node> q; q.push(sb); visited[sb.x][sb.y][sb.z]=1; int flag=0; while(!q.empty()) { node now=q.front(); for(int i=0;i<6;i++) { node next; next.x=now.x+dx[i]; next.y=now.y+dy[i]; next.z=now.z+dz[i]; next.cnt=now.cnt+1; if(next.x<0||next.x>=n||next.y<0||next.y>=m||next.z<0||next.z>=k) continue; if(visited[next.x][next.y][next.z]) continue; visited[next.x][next.y][next.z]=1; if(next.x==sb2.x&&next.y==sb2.y&&next.z==sb2.z) flag=next.cnt; if(flag>0) break; q.push(next); } if(flag>0) break; q.pop(); } if(flag>0) printf("Escaped in %d minute(s).\n",flag); else cout<<"Trapped!"<<endl; } return 0;}
hdu 2251 Dungeon Master bfs
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。