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?
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.
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!
3 4 5 S.... .###. .##.. ###.# ##### ##### ##.## ##... ##### ##### #.### ####E 1 3 3 S## #E# ### 0 0 0
Escaped in 11 minute(s). Trapped!
#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
char map[50][50][50];//三维数组
int vis[50][50][50];
int k,n,m,sx,sy,sz,ex,ey,ez;
int to[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 check(int x,int y,int z)//判断是否越界和是否遇见石头
{
if(x<0||y<0||z<0||x>=k||y>=n||z>=m)
return 1;
else if(map[x][y][z]=='#')
return 1;
else if(vis[x][y][z])
return 1;
return 0;
}
int dfs()
{
int i;
node a,next;
queue<node>Q;
a.x=sx,a.y=sy,a.z=sz;
a.step=0;
vis[sx][sy][sz]=1;//标记起始点
Q.push(a);
while(!Q.empty())
{
a=Q.front();
Q.pop();
if(a.x==ex&&a.y==ey&&a.z==ez)
return a.step;
for(i=0; i<6; i++)
{
next=a;//用next队列来进行运算
next.x=a.x+to[i][0];
next.y=a.y+to[i][1];
next.z=a.z+to[i][2];
if(check(next.x,next.y,next.z))//条件为真就跳过
continue;
vis[next.x][next.y][next.z]=1;//条件为假就执行
next.step=a.step+1;
Q.push(next);//广搜核心,把next放入队列 进行新的循环
}
}
return 0;//***没有这个return 0,会WA;
}
int main()
{
int i,r,j;
while(scanf("%d%d%d",&k,&n,&m),k+m+n)
{
for(i=0; i<k; i++) //k是宽
{
for(j=0; j<n; j++) //n是高
{
scanf("%s",map[i][j]);//%s输入,一层一层的输入
for(r=0; r<m; r++) //m是长
{
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=dfs();
if(ans)
printf("Escaped in %d minute(s).\n",ans);
else
printf("Trapped!\n");
}
}