[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[][][];
 int d[][] = {{,,},{,,-},{,,},{,-,},{,,},{-,,}};
 int l, r, c;
 int main()
 {
 //    freopen("in.in","r",stdin);
     char tp[];
     node start, tmp;
     int ans = ;
     queue<node>q;
     while(cin>>l>>r>>c)
     {
         ans = ;
         memset(dung,,sizeof(dung));
         if(l*r*c == )    break;
         for(int k = ; k <= l; k++)
             for(int i = ; i <= r; i++)
             {
                 cin>>tp;
                 for(int j = ; j <= c; j++)
                 {
                     dung[k][i][j] = tp[j-];
                     if(tp[j-]=='S')
                     {
                         start.x = i;
                         start.y = j;
                         start.z = k;
                         start.step = ;
                     }
                 }
             }
         q.push(start);
         dung[start.z][start.x][start.y] = '#';
         while(q.size())
         {
             start = q.front();
             q.pop();
             for(int i = ; i < ; i++)
             {
                 tmp.x = start.x + d[i][];
                 tmp.y = start.y + d[i][];
                 tmp.z = start.z + d[i][];
                 tmp.step = start.step + ;
                 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 ;
 }