POJ 2251 Dungeon Master 三维bfs

题意：有个3D地牢，’#‘为障碍，’.'为通路，'E’为终点，求能否到达终点及到达终点最短用时
思路：比普通bfs多了一维，实际上就多了两个移动的方向，数组多了一维而已

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
const int maxn = 30;
const int dx[] = {0, 0, 1, -1, 0, 0};
const int dy[] = {1, -1, 0, 0, 0, 0};
const int dz[] = {0, 0, 0, 0, 1, -1};
int l, r, c, ans, vis[maxn][maxn][maxn];
char g[maxn][maxn][maxn];
struct node {
	int x, y, z, s;
	node(int x = 0, int y = 0, int z = 0, int s = 0) : x(x), y(y), z(z), s(s) {}
};
int main()
{
	while (cin >> l >> r >> c && l && r && c) {
		memset(vis, 0, sizeof(vis));
		node start;
		for (int i = 0; i < l; i++) {
			for (int j = 0; j < r; j++)
				for (int k = 0; k < c; k++) {
					cin >> g[i][j][k];
					if (g[i][j][k] == 'S') {
						start = node(i, j, k, 0);
					}
				}
		}
		queue<node> q;
		int ok = 0;
		q.push(start);
		while (!q.empty()) {
			node n1 = q.front(); q.pop();
			if (g[n1.x][n1.y][n1.z] == 'E') {
				printf("Escaped in %d minute(s).\n", n1.s);
				ok = 1;
				break;
			}
			for (int i = 0; i < 6; i++) {
				node n2 = node(n1.x+dx[i], n1.y+dy[i], n1.z+dz[i], n1.s+1);
				if (n2.x >= 0 && n2.x < l && n2.y >= 0 && n2.y < r && n2.z >= 0 && n2.z < c
					 && g[n2.x][n2.y][n2.z] != '#' && !vis[n2.x][n2.y][n2.z]) {
					 	q.push(n2);
					 	vis[n2.x][n2.y][n2.z] = 1;
				}
			}
		}
		if (!ok)
			printf("Trapped!\n");
	}
	return 0;
}