J - Dungeon Master
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!
题意:在三维空间中求从‘S’到‘E’的最短距离,如果‘S’到不了‘E’ 输出‘Trapped!’;
思路:在 普通广搜中 加一个 方向。详见代码。
代码:
#include<queue>
#include<cstdio>
#include<string>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
#define mem(a,b) memset(a,0,sizeof(a))
char tu[35][35][35];
int ne[6][3]= {{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}}; //三维,加一个方向;
int book[35][35][35]; //标记是否走过;
int L,R,C,s_x,s_y,s_z,i,j,k;
struct zaq
{
int x,y,z,step;
};
bool jud(int a,int b,int c)
{
if(tu[a][b][c]!='#'&&a>=0&&b>=0&&c>=0&&a<L&&b<R&&c<C&&!book[a][b][c])
return 1;
return 0;
}
zaq now,nex;
queue<zaq>qaq;
int bfs()
{
while(!qaq.empty())
qaq.pop();
now.x=s_x;
now.y=s_y;
now.z=s_z;
now.step=0;
qaq.push(now);
book[now.x][now.y][now.z]=1;
while(!qaq.empty())
{
now=qaq.front();
qaq.pop();
if(tu[now.x][now.y][now.z]=='E')
{
return now.step;
}
for(int i=0; i<6; i++)
{
nex.x=now.x+ne[i][0];
nex.y=now.y+ne[i][1];
nex.z=now.z+ne[i][2];
if(jud(nex.x,nex.y,nex.z))
{
nex.step=now.step+1;
qaq.push(nex);
book[nex.x][nex.y][nex.z]=1;
}
}
}
return -1;
}
int main()
{
while(~scanf("%d%d%d",&L,&R,&C)&&(L||R||C))
{
mem(book,0);
for(i=0; i<L; i++)
{
for(j=0; j<R; j++)
{
scanf("%s",&tu[i][j]);
for(k=0; k<C; k++)
{
if(tu[i][j][k]=='S')
{
s_x=i;
s_y=j; //存下‘S’所在位置;
s_z=k;
}
}
}
}
k=bfs();
if(k==-1)
printf("Trapped!\n");
else
printf("Escaped in %d minute(s).\n",k);
}
return 0;
}