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 formEscaped 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 lineTrapped!
Sample Input
3 4 5 S.... .###. .##.. ###.# ##### ##### ##.## ##... ##### ##### #.### ####E 1 3 3 S## #E# ### 0 0 0Sample Output
Escaped in 11 minute(s). Trapped!
本题题意:
就是给出一个一层一层立体字符二维数组,从中有入口S出口E,入口进,找出口最少步数,找不到输出Trapped!
凡是找这种最少步数几乎都是广搜,广搜套路解题
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;
char map[35][35][35];//三维数组
int vis[35][35][35];//记录是否访问过
int k,n,m,sx,sy,sz,ex,ey,ez;
int t[6][3] = {{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}};//六个方向
struct node
{
int x,y,z,step;
};
int judge(int x,int y,int z)//判断下一点是否合格
{
if(x<0||y<0||z<0||x>=k||y>=n||z>=m)
return 0;
else if(map[x][y][z]=='#')
return 0;
else if(vis[x][y][z])
return 0;
return 1;
}
int bfs()
{
int i;
node a,next;
queue<node>an;
a.x=sx,a.y=sy,a.z=sz;
a.step = 0;
vis[sx][sy][sz]=1;
an.push(a);
while(!an.empty())
{
a = an.front();//取出
an.pop();//踢出出去
if(a.x==ex&&a.y==ey&&a.z==ez)//找到
return a.step;
for(i = 0; i<6; i++)//六个方向
{
next = a;//记录位置
next.x = a.x+t[i][0];
next.y = a.y+t[i][1];
next.z = a.z+t[i][2];
if(judge(next.x,next.y,next.z))符合条件
{
vis[next.x][next.y][next.z] = 1;//标记
next.step = a.step+1;//步数加一
an.push(next);//塞进去
}
}
}
return 0;//找不到
}
int main()
{
int i,j,r;
while(cin>>k>>n>>m)
{
if(n+k+m==0) break;
for(i=0;i<k;i++)//录入三维数组
{
for(j=0;j<n;j++)
{
scanf("%s",map[i][j]);
for(r=0;r<m;r++)
{
if(map[i][j][r] == 'S')
{
sx=i,sy=j,sz=r;
}
else if(map[i][j][r] == 'E')
{
ex=i,ey=j,ez=r;
}
}
}
}
memset(vis,0,sizeof(vis));
int ans;
ans = bfs();
if(ans)
cout<<"Escaped in "<<ans<<" minute(s)."<<endl;
else
cout<<"Trapped!"<<endl;
}
return 0;
}