6593번 상범 빌딩

 BFS 기본 문제.

 

 x,y,z를 1씩 증가, 감소시키면서 출구 'E'를 찾으면 된다.

 

 

#include <iostream>
#include <queue>
#define MAX 31
#define visited true
#define Non_visited false
 
using namespace std;
 
struct location{
    int x;
    int y;
    int z;
};
 
int xx[6]={1,0,0,-1,0,0};
int yy[6]={0,1,0,0,-1,0};
int zz[6]={0,0,1,0,0,-1};
int cnt[MAX][MAX][MAX];
bool v[MAX][MAX][MAX];
int L,R,C;
char map[MAX][MAX][MAX];
queue<location> q;
queue<int> ans;
bool flag=true;
 
void bfs(){
    
    location Lo;
    
    while(!q.empty()){
        int x=q.front().x;
        int y=q.front().y;
        int z=q.front().z;
        q.pop();
        
        if(map[x][y][z]=='E'){
            break;
        }
        
        for(int i=0;i<6;i++){
            int nx=x+xx[i];
            int ny=y+yy[i];
            int nz=z+zz[i];
            
            if(nx<0 || ny<0 || nz<0 || nx>=L || ny>=R || nz>=C) continue;
            if(v[nx][ny][nz]!=visited && map[nx][ny][nz]!='#'){
                Lo.x=nx;
                Lo.y=ny;
                Lo.z=nz;
                q.push(Lo);
                v[nx][ny][nz]=visited;
                cnt[nx][ny][nz]=cnt[x][y][z]+1;
            }
        }
    }
}
 
void Clear(){
    for(int i=0;i<L;i++){
        for(int j=0;j<R;j++){
            for(int k=0;k<C;k++){
                v[i][j][k]=Non_visited;
                cnt[i][j][k]=0;
                map[i][j][k]=NULL;
            }
        }
    }
    while(!q.empty()){
        q.pop();
    }
}
 
void Check(){
    for(int i=0;i<L;i++){
        for(int j=0;j<R;j++){
            for(int k=0;k<C;k++){
                if(map[i][j][k]=='E'){
                    if(v[i][j][k]==visited){
                        ans.push(cnt[i][j][k]);
                        return;
                    }
                }
            }
        }
    }
    ans.push(0);
}
 
int main(){
    
    location Lo;
    
    while(flag){
        cin >> L >> R >> C;
        
        if(L==0 && R==0 && C==0){
            flag=false;
        }
        else{
            for(int i=0;i<L;i++){
                for(int j=0;j<R;j++){
                    for(int k=0;k<C;k++){
                        cin >> map[i][j][k];
                        if(map[i][j][k]=='S'){
                            Lo.x=i;
                            Lo.y=j;
                            Lo.z=k;
                            q.push(Lo);
                            v[i][j][k]=visited;
                        }
                    }
                }
            }
            bfs();
            Check();
            Clear();
        }
    }
    
    while(!ans.empty()){
        int x=ans.front();
        ans.pop();
        
        if(x==0){
            cout << "Trapped!" << endl;
        }
        else{
            cout << "Escaped in " << x << " minute(s)." << endl;
        }
    }
}