POJ_2251_(BFS)

B

POJ 2251

• 三维bfs求最短路径
• 方向从 东南西北 加入 上下
• 注意L是层数的意思,从下层给到上层,
• bfs模板 + vis三维标记 + tx ty tz 三维坐标

#include <iostream>
#include <queue>
#include <string.h>

using namespace std;

struct node {
	int step;
	int x,y,z;
	node() {}
	node (int a,int b,int c,int step) {
		x = a; y = b; z = c; this->step = step;
	}
};
char e[31][31][31];
int n,m,h;
int next1[6][3] = {0,0,1, 0,0,-1, 0,1,0, 1,0,0, 0,-1,0, -1,0,0};
int s_x,s_y,s_z;
int e_x,e_y,e_z;
bool vis[31][31][31];
queue<node> que;
int ans;
bool flag;
void init() {
	memset(vis,0,sizeof vis);
	memset(e,0,sizeof e);
	while (!que.empty()) que.pop();
	ans = 0;
}
void bfs() {
	node t(s_x,s_y,s_z,0);
	que.push(t);
	vis[s_x][s_y][s_z] = 1;
	while (!que.empty()) {
		node cur = que.front();
		que.pop();
		for (int i=0; i<6; i++) {
			int tx = cur.x + next1[i][0];
			int ty = cur.y + next1[i][1];
			int tz = cur.z + next1[i][2];
			if ( tx<1 || tx>n || ty<1 || ty>m || tz<1 || tz>h) continue;
			if (!vis[tx][ty][tz] && e[tz][tx][ty] == '.') {
				node t(tx,ty,tz, cur.step+1 );
				que.push(t);
				vis[tx][ty][tz] = 1;
			}
			else if (!vis[tx][ty][tz] && e[tz][tx][ty] == 'E') {
				flag = 1;
				ans = cur.step+1;
				return ;
			}
		}
	}
	flag = 0;
	return ;
}
int main() {
//	freopen("a.txt","r",stdin); 
	while ( cin >> h >> n >> m ) {
		if (n==0 && m==0 && h==0) break;
		init();
		for (int i=1; i<=h; i++) {
			for (int j=1; j<=n; j++) {
				for (int k=1; k<=m; k++) {
					cin >> e[i][j][k];
					if (e[i][j][k] == 'S') {
						s_z = i;
						s_x = j;
						s_y = k;
					}
					else if (e[i][j][k] == 'E') {
						e_z = i;
						e_x = j;
						e_y = k;
					}
				}
			}
		}
		bfs();
		if (flag) printf("Escaped in %d minute(s).\n",ans);
		else printf("Trapped!\n");
	}
	return 0;
}