[kuangbin带你飞]专题一 简单搜索 - B - Dungeon Master

#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
struct node
{
int x;
int y;
int z;
int step;
};
char dung[35][35][35];
int d[6][3] = {{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}};
int l, r, c;
int main()
{
//    freopen("in.in","r",stdin);
char tp[40];
node start, tmp;
int ans = 0;
queue<node>q;
while(cin>>l>>r>>c)
{
ans = 0;
memset(dung,0,sizeof(dung));
if(l*r*c == 0)    break;
for(int k = 1; k <= l; k++)
for(int i = 1; i <= r; i++)
{
cin>>tp;
for(int j = 1; j <= c; j++)
{
dung[k][i][j] = tp[j-1];
if(tp[j-1]=='S')
{
start.x = i;
start.y = j;
start.z = k;
start.step = 0;
}
}
}
q.push(start);
dung[start.z][start.x][start.y] = '#';
while(q.size())
{
start = q.front();
q.pop();
for(int i = 0; i < 6; i++)
{
tmp.x = start.x + d[i][0];
tmp.y = start.y + d[i][1];
tmp.z = start.z + d[i][2];
tmp.step = start.step + 1;
if(dung[tmp.z][tmp.x][tmp.y] == 'E')
{
ans = tmp.step;
break;
}
if(dung[tmp.z][tmp.x][tmp.y]!='.')    continue;
q.push(tmp);
dung[tmp.z][tmp.x][tmp.y] = '#';
}
}
if(ans)        printf("Escaped in %d minute(s).\n",ans);
else        printf("Trapped!\n");
while(q.size())    q.pop();
}
return 0;
}