信息奥赛一本通 - 1248: Dungeon Master

#include<bits/stdc++.h>
using namespace std;
char a[100][100][100];
bool b[100][100][100];
int l,r,c,fx,fy,fz;
int q[100][4],head=0,tail=0;
int wx[6]={-1,+1,00,00,00,00};
int wy[6]={00,00,-1,+1,00,00};
int wz[6]={00,00,00,00,-1,+1};
void bfs(int sx,int sy,int sz){
	tail++;
	q[tail][0]=sx;
	q[tail][1]=sy;
	q[tail][2]=sz;
	while(head<tail){
		head++;
		int x=q[head][0],y=q[head][1],z=q[head][2],s=q[head][3];
		for(int i=0;i<6;i++){
			int nx=x+wx[i],ny=y+wy[i],nz=z+wz[i];
//			cout<<nx<<" "<<ny<<" "<<nz<<endl;
			if(b[nx][ny][nz]==1){
				tail++;
				q[tail][0]=nx;
				q[tail][1]=ny;
				q[tail][2]=nz;
				q[tail][3]=s+1;
				b[nx][ny][nz]=0;
				if(nx==fx&&ny==fy&&nz==fz){
					cout<<"Escaped in "<<q[tail][3]<<" minute(s).";
					cout<<endl;
					return;
				}
			}
		}
	}
	cout<<"Trapped!"<<endl;
	return;
}
int main(){
	while(1){
		cin>>l>>r>>c;
		if(l==0) break;
		int sx,sy,sz;
		memset(a,0,sizeof(a));memset(b,0,sizeof(b));
		memset(q,0,sizeof(q));head=0;tail=0;
		for(int i=1;i<=l;i++){
			for(int j=1;j<=r;j++){
				for(int k=1;k<=c;k++){
					cin>>a[i][j][k];
					if(a[i][j][k]=='.') b[i][j][k]=1;
					else if(a[i][j][k]=='#') b[i][j][k]=0;
					if(a[i][j][k]=='S'){
						sx=i;sy=j;sz=k;
						b[i][j][k]=1;
					}else if(a[i][j][k]=='E'){
						fx=i;fy=j;fz=k;
						b[i][j][k]=1;
					}
				}
			}
		}
//		cout<<sx<<" "<<sy<<" "<<sz<<endl;
//		cout<<fx<<" "<<fy<<" "<<fz<<endl;
		bfs(sx,sy,sz);
	}
	return 0;
}