POJ - 2251 Dungeon Master(BFS)

#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int N = 35;

struct Node{
int x, y, z, time;
Node() {}
Node(int x, int y, int z, int time): x(x), y(y), z(z), time(time) {}
};

char map

;
bool vis

;
int dir[6][3] = {{1, 0, 0}, {-1, 0, 0}, {0, 0, -1}, {0, 0, 1}, {0, -1, 0}, {0, 1, 0}};//up, down, left, right, front, down
int L, R, C, sx, sy, sz, ex, ey, ez;

void init() {

for (int i = 1; i <= L; i++)
for (int j = 1; j <= R; j++) {
scanf("%s", map[i][j] + 1);
for (int k = 1; k <= C; k++)
if (map[i][j][k] == 'S') {
sx = i; sy = j; sz = k;
}
else if (map[i][j][k] == 'E') {
ex = i; ey = j; ez = k;
}
}
}

void solve() {
queue<Node> Q;
Q.push(Node(sx, sy, sz, 0));
memset(vis, 0, sizeof(vis));
vis[sx][sy][sz] = 1;
while (!Q.empty()) {
Node t = Q.front(); Q.pop();
int x = t.x;
int y = t.y;
int z = t.z;

if (x == ex && y == ey && z == ez) {
printf("Escaped in %d minute(s).\n", t.time);
return ;
}

for (int i = 0; i < 6; i++) {
int tx = x + dir[i][0];
int ty = y + dir[i][1];
int tz = z + dir[i][2];
if (tx <= 0 || tx > L || ty <= 0 || ty > R || tz <= 0 || tz > C || vis[tx][ty][tz] || map[tx][ty][tz] == '#') continue;
vis[tx][ty][tz] = 1;
Q.push(Node(tx, ty, tz, t.time + 1));
}
}
printf("Trapped!\n");
}

int main() {
while (scanf("%d%d%d", &L, &R, &C) != EOF && L + R + C) {
init();
solve();
}
return 0;
}