hdu 2251 Dungeon Master bfs
2015-01-23 21:57
316 查看
Dungeon Master
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?
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.
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
Sample Input
Sample Output
Source
Ulm Local 1997
bfs 六个方向直接乱搞就好
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 17555 | Accepted: 6835 |
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?
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.
Output
Each maze generates one line of output. If it is possible to reach the exit, print a line of the form
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 5 S.... .###. .##.. ###.# ##### ##### ##.## ##... ##### ##### #.### ####E 1 3 3 S## #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 31 const 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; }
相关文章推荐
- POJ 2251:Dungeon Master(三维BFS)
- POJ - 2251 Dungeon Master BFS
- POJ 2251 Dungeon Master BFS
- POJ 2251 Dungeon Master BFS
- POJ 2251:Dungeon Master【bfs】
- poj2251 Dungeon Master bfs
- Dungeon Master POJ - 2251 (三维空间BFS搜索)
- POJ - 2251 Dungeon Master BFS
- POJ-2251 Dungeon Master bfs搜索
- Dungeon Master POJ - 2251 BFS
- POJ 2251 Dungeon Master bfs 难度:0
- poj 2251 Dungeon Master(bfs)
- POJ 2251 Dungeon Master BFS(广度优先搜索)
- POJ 2251:Dungeon Master(BFS)
- POJ 2251(WA)Dungeon Master(三维BFS)
- pku 2251 Dungeon Master BFS
- POJ 2251 Dungeon Master <三维BFS水题>
- [POJ](2251)Dungeon Master ---三维bfs
- POJ 2251:Dungeon Master(三维BFS)
- poj-2251 Dungeon Master BFS