POJ2251-简单三维BFS

Question:

不解释三维的地图，S是起点，E是终点，如果可以逃出，输出最短路径

如果不能逃出，输出Trapped

Solution:

因为是要查找最短路径，所以说，这里我们采用BFS作为我们的搜索策略，本体水，没什么难度，记得开一个六个方向的移动数组就OK了

Code:32MS

#include"iostream"
#include"cstdio"
#include"cstring"
#include"cstdlib"
#define N 32

using namespace std;

typedef struct node
{
	int x;
	int y;
	int z;
	int s;
}point;

point queue[N*N*N];
int head;
int tail;
int l,r,c;
char map[N][N][N];
int book[N][N][N];
int nn[6][3]={{1,0,0},{-1,0,0},{0,0,-1},{0,0,1},{0,-1,0},{0,1,0}};
int bx,by,bz;
int sum;

bool bfs()
{
	memset(book,0,sizeof(book));
	head=tail=1;
	queue[head].x=bx;
	queue[head].y=by;
	queue[head].z=bz;
	queue[head].s=0;
	book[bz][bx][by]=1;
	tail++;
	while(head!=tail)
	{
		for(int i=0;i<6;i++)
		{
			int dx=queue[head].x+nn[i][1];
			int dy=queue[head].y+nn[i][2];
			int dz=queue[head].z+nn[i][0];
			if(dx<1||dy<1||dz<1||dx>r||dy>c||dz>l||book[dz][dx][dy]==1||map[dz][dx][dy]=='#') continue;
			else
			{
				if(map[dz][dx][dy]=='E') 
				{
					sum=queue[head].s+1;
					return 1;
				}
				else
				{
					book[dz][dx][dy]=1;
					queue[tail].x=dx;
					queue[tail].y=dy;
					queue[tail].z=dz;
					queue[tail].s=queue[head].s+1;
					tail++;
				}
			}
		}
		head++;
	}
	return 0;
}

int main()
{
	while(scanf("%d%d%d",&l,&r,&c)&&(l+r+c)!=0)
	{
		memset(map,0,sizeof(map));
		getchar();
		for(int i=1;i<=l;i++)
		{
			for(int j=1;j<=r;j++)
			{
				for(int k=1;k<=c;k++)
				{
					scanf("%c",&map[i][j][k]);
					if(map[i][j][k]=='S') bz=i,bx=j,by=k;
				}
				getchar();
			}
			getchar();
		}
		
		if(bfs()) cout<<"Escaped in "<<sum<<" minute(s)."<<endl;
		else cout<<"Trapped!"<<endl;
	}
	return 0;
}