搜索多层图

/*
 * Author:  ry 
 * Created Time:  2017/10/24 20:30:13
 * File Name: 1.cpp
 */
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <time.h>
using namespace std;
const int eps = 1e6+5;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
#define Max(a,b) a>b?a:b
#define Min(a,b) a>b?b:a
#define ll long long

char mp[35][35][35];
int dir[6][3] = {{1, 0, 0}, {-1, 0, 0}, {0, 1, 0}, {0, -1, 0}, {0, 0, 1}, {0, 0, -1}};
int l, n, m;
int sx, sy, sz, gx, gy, gz;
int pre[35][35][35];

struct node
{
    int x, y, z;
};

bool check(int x, int y, int z){
    if (x >= 1 && x <= l && y >= 1 && y <= n && z >= 1 && z <= m && pre[x][y][z] == -1 && mp[x][y][z] != ‘#‘){
        return true;
    }
    else return false;
}

void bfs(){
    node ff, t;
    queue<node>que;
    
    ff.x = sx, ff.y = sy, ff.z = sz;
    que.push(ff);
    pre[sx][sy][sz] = 0;
    while(!que.empty()){
        node v = que.front();
        que.pop();
        
        if (v.x == gx && v.y == gy && v.z == gz){
            break;
        }
        for(int i = 0; i < 6; i++){
            t.x = v.x + dir[i][0];
            t.y = v.y + dir[i][1];
            t.z = v.z + dir[i][2];
            if (check(t.x, t.y, t.z)){
                pre[t.x][t.y][t.z] = pre[v.x][v.y][v.z] + 1;
                que.push(t);
            }
        }
    }
}

int main() {
    
    while (~scanf("%d%d%d", &l, &n, &m) && l+n+m){
        memset(pre, -1, sizeof(pre));
        
        for(int i = 1; i <= l; i++){
            for(int j = 1; j <= n; j++){
                scanf("%s", mp[i][j]+1);
            }
        }
        for(int i = 1; i <=l ; i++){
            for(int j = 1; j <= n; j++){
                for(int k = 1; k <= m; k++){
                    if (mp[i][j][k] == ‘S‘) {
                        sx = i; sy = j; sz = k;
                    }
                    if (mp[i][j][k] == ‘E‘){
                        gx = i; gy = j; gz = k;
                    }
                }
            }
        }
        bfs();
        if (pre[gx][gy][gz] != -1)
            printf("Escaped in %d minute(s).\n", pre[gx][gy][gz]);
        else {
            printf("Trapped!\n");
        }
    }
    
    return 0;
}