POJ - 2251 Dungeon Master —— DFS

最新推荐文章于 2019-11-03 17:01:37 发布

Lngxling

最新推荐文章于 2019-11-03 17:01:37 发布

阅读量540

点赞数

分类专栏： DFS

本文链接：https://blog.csdn.net/Lngxling/article/details/77968198

版权

poj 同时被 2 个专栏收录

61 篇文章 0 订阅

订阅专栏

DFS

14 篇文章 0 订阅

订阅专栏

Dungeon Master

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 37514		Accepted: 14346

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

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!

题意：在一个三维迷宫里找出口

思路：把深搜时的dir数组加两个方向即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#define max 33
using namespace std;
char map[max][max][max];
int l,n,m,ex,ey,el,flag=0;
int dir[6][3]={0,1,0,0,-1,0,0,0,1,0,0,-1,1,0,0,-1,0,0};
bool vis[max][max][max];
struct point
{
	int l,x,y,time;
	
}z,pp[max][max][max];
queue<point>q;
void bfs()
{
	flag=0;
	while(q.size())
	{
		z=q.front();
		if(z.x==ex&&z.y==ey&&z.l==el)
		{
			flag=1;
			break;
		}
		int k;
		for(k=0;k<6;k++)
		{
			int tl=z.l+dir[k][0];
			int tx=z.x+dir[k][1];
			int ty=z.y+dir[k][2];
			if(tl>=1&&tx>=1&&ty>=1&&tl<=l&&tx<=n&&ty<=m)
			{
				if(map[tl][tx][ty]!='#'&&vis[tl][tx][ty]==false)
				{
					pp[tl][tx][ty].time=z.time+1;
					vis[tl][tx][ty]=true;
					q.push(pp[tl][tx][ty]);
					//cout<<tl<<tx<<ty<<endl;
				}
			}
		}
		q.pop();
	}
}
int main()
{
	while(cin>>l>>n>>m)
	{
		if(l==0&&n==0&&m==0)
		break;
		memset(map,0,sizeof(map));
		memset(vis,false,sizeof(vis));
		while(q.size())
		q.pop();
		int i,j,k;
		for(i=1;i<=l;i++)
		{
			for(j=1;j<=n;j++)
			{
				for(k=1;k<=m;k++)
				{
					cin>>map[i][j][k];
					pp[i][j][k].l=i;
					pp[i][j][k].x=j;
					pp[i][j][k].y=k;
					if(map[i][j][k]=='S')
					{
						pp[i][j][k].time=1;
						q.push(pp[i][j][k]);
						vis[i][j][k]=true;
					}
					if(map[i][j][k]=='E')
					{
						el=i;ex=j;ey=k;
					}
				}
			}
		}
		//cout<<el<<ex<<ey<<endl;
		bfs();
		if(flag)
		cout<<"Escaped in "<<q.front().time-1<<" minute(s)."<<endl;
		else
		cout<<"Trapped!"<<endl;
	}
}