A - Dungeon Master

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<string>
using namespace std;
char mp[35][35][35];
int  vis[35][35][35];
int l,r,c;
//3D空间，所以有六个方向。标记
int fx[6]={0,0,0,0,-1,1};
int fy[6]={0,-1,0,1,0,0};
int fz[6]={1,0,-1,0,0,0};

int answer;

struct node
{
    int x,y,z;
    int sum;//记录步数
};
//node e,now;
bool check(int x,int y,int z){
    if(x<l&&x>=0&&y<r&&y>=0&&z<c&&z>=0&&mp[x][y][z]!=‘#‘){
        //printf("%d %d %d++++++\n",x,y,z);
        return 1;
    }
    return 0;
}
int  bfs(int x,int y,int z){
    queue<node> q;
    node now;
    q.push({x,y,z});
    now.sum=0;
    while(q.size()){
        now=q.front();
        q.pop();
        
        if(mp[now.x][now.y][now.z]==‘E‘){
        
        return now.sum; 
        } 
       for(int i=0;i<6;i++){         
                    node e;//对下一个进行标记
            e.x=now.x+fx[i];
            e.y=now.y+fy[i];
            e.z=now.z+fz[i];
        
            if(!vis[e.x][e.y][e.z]&&check(e.x,e.y,e.z)){//表示有路可走
                
                vis[e.x][e.y][e.z]=1;
                e.sum=now.sum+1;
                q.push(e);
            }
        
            
}

}
return -1;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int i,j,k;
    int si,sj,sk;
    while (cin>>l>>r>>c&&(l!=0||r!=0||c!=0))
    {
        memset(vis,0,sizeof(vis));
        for (i=0;i<l;i++)
            for (j=0;j<r;j++)
              for (k=0;k<c;k++)
          {
            cin>>mp[i][j][k];
            if (mp[i][j][k]==‘S‘)//记录当前士兵的位置
                {
                    si=i;
                    sj=j;
                    sk=k;
                }
          }
        
          answer=bfs(si,sj,sk);
          if (answer==-1)
            cout << "Trapped!" << endl;
          else
             cout << "Escaped in " << answer << " minute(s)." << endl;

    }
    return 0;
}