uestc 方老师与迷宫（三维迷宫）

本质上与二位迷宫裸题是一致的

#include<cstdio>
#include<cstring>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
using namespace std;
#define MAXN 33

struct node{
    int x, y, z;
    int time;
}s,e;
int dx[] = { 1, -1, 0, 0, 0, 0 };
int dy[] = { 0, 0, 1, -1, 0, 0 };
int dz[] = { 0, 0, 0, 0, 1, -1 }; 

char mp[MAXN][MAXN][MAXN];
bool vis[MAXN][MAXN][MAXN];
int l, r, c;

void init()
{
    memset(vis,0,sizeof(vis));
}


void input()
{
    init();
    for (int i = 1; i <= l; ++i)
        for (int j = 1; j <= r; ++j)
            for (int k = 1; k <= c; ++k) {
                cin >> mp[i][j][k];
                if (mp[i][j][k] == 'S') {
                    s.x = i;
                    s.y = j;
                    s.z = k;
                    s.time = 0;
                }
                else if (mp[i][j][k] == 'E') {
                    e.x = i;
                    e.y = j;
                    e.z = k;
                }
            }
    //cout << "s.x = " << s.x << " s.y = " << s.y << " s.z = " << s.z << endl;
    //cout << "e.x = " << e.x << " e.y = " << e.y << " e.z = " << e.z << endl;
}

bool judge(int i,int j,int k)
{
    if (i < 1 || i > l || j < 1 || j > r || k < 1 || k > c || vis[i][j][k])
        return true;
    return false;
}

int bfs()
{
    queue<node> q;
    q.push(s);
    vis[s.x][s.y][s.z] = true;
    while (!q.empty()) {
        node now = q.front();
        q.pop();
        //cout << "x = " << now.x << " y = " << now.y << " z = " << now.z << endl; 
        if (mp[now.x][now.y][now.z] == 'E') {
            return now.time;
        }
        node next;
        for (int i = 0; i < 6; ++i) {
            next.x = now.x + dx[i];
            next.y = now.y + dy[i];
            next.z = now.z + dz[i];
            if (judge(next.x, next.y, next.z)) continue;
            if (mp[next.x][next.y][next.z] != '#') {
                next.time = now.time + 1;
                q.push(next);
                vis[next.x][next.y][next.z] = true;
            }
        }
    }
    return -1;
}

int main()
{
    while (cin >> l >> r >> c, l + r + c) {
        input();
        int res = bfs();
        if (res == -1) puts("Trapped!");
        else printf("Escaped in %d minute(s).
",res);
    }
    return 0;
}