AcWing 1096. 地牢大师

https://www.acwing.com/problem/content/1098/

简单练手bfs题
需要注意的是此题是三维的数据,偏移量需要改一下

#include<iostream>
#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 105;
char map[N][N][N];
int dis[N][N][N];
int l,r,c;
int dx[6]={1,-1,0,0,0,0},dy[6]={0,0,1,-1,0,0},dz[6]={0,0,0,0,1,-1};
struct Point
{
    int x,y,z;
};

int bfs(Point start,Point end)
{
    queue<Point>q;
    q.push(start);
    memset(dis,-1,sizeof dis);//初始化距离
    dis[start.x][start.y][start.z]=0;
    while(q.size())
    {
        Point t = q.front();
        q.pop();
        for(int i=0;i<6;i++)
        {
            int x=t.x+dx[i],y=t.y+dy[i],z=t.z+dz[i];
            if(x<0 || x>=l || y<0 || y>=r || z<0 || z>=c)continue;//出界
            if(dis[x][y][z] != -1)continue;//走过
            if(map[x][y][z] == '#')continue;//障碍物
            dis[x][y][z]=dis[t.x][t.y][t.z]+1;//可走
            if(x == end.x && y== end.y && z == end.z || map[x][y][z]=='E')return dis[x][y][z];//是否是终点
            q.push({x,y,z});
        }
    }
    return -1;
}

int main()
{
    while(scanf("%d%d%d",&l,&r,&c)&& l || r || c)
    {
        Point start,end;
        for(int i=0;i<l;i++)
            for(int j=0;j<r;j++)
            {
                scanf("%s",map[i][j]);
                for(int k=0;k<c;k++)
                {
                    char key = map[i][j][k];
                    if(key=='S')start={i,j,k};
                    else if(key == 'E')end={i,j,k};
                }
            }
        int distance=bfs(start,end);
        if(distance==-1)printf("Trapped!\n");
        else printf("Escaped in %d minute(s).\n",distance);
    }
    return 0;
}