怎么全WA了，求调

#include<bits/stdc++.h>
#define x first
#define y second.first
#define z second.second
using namespace std;
int l,r,c,sx,sy,sz,fx,fy,fz,mp[35][35][35],flag[35][35][35];
int dx[7]={0,1,-1,0,0,0,0},dy[7]={0,0,0,1,-1,0,0},dz[7]={0,0,0,0,0,1,-1};
bool check(int xx,int yy,int zz){
    if(xx>0&&xx<=r&&yy>0&&yy<=c&&zz>0&&zz<=l&&!flag[xx][yy][zz])return true;
    return false;
}
int main(){
    cin>>l>>r>>c;
    for(int i=1;i<=l;i++){
        for(int j=1;j<=r;j++){
            for(int k=1;k<=c;k++){
                char C;
                cin>>C;
                if(C=='#')mp[j][k][i]=1;
                if(C=='S')sx=j,sy=k,sz=i;
                if(C=='E')fx=j,fy=k,fz=i;
            }
        }
    }
    queue<pair<int,pair<int,int>>>q;
    pair<int,pair<int,int>>e;
    e.x=sx;e.y=sy;e.z=sz;
    flag[sx][sy][sz]=1;
    q.push(e);
    int step=1;
    while(!q.empty()){
        int len=q.size();
        step++;
        while(len--){
            pair<int,pair<int,int>>p;
            p=q.front();
            q.pop();
            if(p.x==fx&&p.y==fy&&p.z==fz){
                cout<<"Escaped in "<<step<<" minute(s).";
                return 0;
            }
            for(int i=1;i<=6;i++){
                int xx=p.x+dx[i];
                int yy=p.y+dy[i];
                int zz=p.z+dz[i];
                if(check(xx,yy,zz)){
                    flag[xx][yy][zz]=1;
                    e.x=xx,e.y=yy,e.z=zz;
                    q.push(e);
                }
            }
        }
    }
    cout<<"Trapped!";
    return 0;
}