3维迷宫的bfs

最新推荐文章于 2022-05-31 20:29:08 发布

WudHHH

最新推荐文章于 2022-05-31 20:29:08 发布

阅读量382

点赞数 1

分类专栏： dfs&&bfs

本文链接：https://blog.csdn.net/qingqiu_WD/article/details/54313577

版权

dfs&&bfs 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <algorithm>
#include <queue>
#include <math.h>
#define MAX 30
#define INF 1e8

using namespace std;
int L,R,C;
char maze[MAX][MAX][MAX];
int d[MAX][MAX][MAX];
int move1[6][3] = {{-1,0,0},{0,1,0},{1,0,0},{0,-1,0},{0,0,1},{0,0,-1}};
int sx,sy,sz,ex,ey,ez;
struct P{
    int a,b,c;
};
void bfs()
{
    queue<P> que;
    P q,cq;
    q.a = sx,q.b = sy,q.c = sz;
    que.push(q);
    while (!que.empty())
    {
        q = que.front();
        que.pop();
        for (int i = 0;i < 6;i++)
        {
            int nx = q.a+move1[i][0],ny = q.b+move1[i][1],nz = q.c+move1[i][2];
            if((nx>=0&&nx<L)&&(ny>=0&&ny<R)&&(nz>=0&&nz<C)&&maze[nx][ny][nz] != '#'&&d[nx][ny][nz] == INF)
            {
                cq.a = nx,cq.b = ny,cq.c = nz;
                que.push(cq);
                d[nx][ny][nz] = d[q.a][q.b][q.c] + 1;
            }
        }
    }
}
int main(void)
{
    while(scanf("%d %d %d",&L,&R,&C) != EOF&&(L||R||C))
    {
        for (int i = 0;i < L;i++)
        {
            for (int j = 0;j < R;j++)
            {
                scanf("%s",maze[i][j]);
            }
        }
        for (int i = 0;i < L;i++)
        {
            for (int j = 0;j < R;j++)
            {
                for (int k = 0;k < C;k++)
                {
                    if(maze[i][j][k] == 'S')
                        sx = i,sy = j,sz = k;
                    else if(maze[i][j][k] == 'E')
                        ex = i,ey = j,ez = k;
                    d[i][j][k] = INF;
                }
            }
        }
        d[sx][sy][sz] = 0;
        bfs();
        if(d[ex][ey][ez] != INF)
            printf("Escaped in %d minute(s). \n",d[ex][ey][ez]);
        else
            cout<<"Trapped!"<<endl;
    }
    return 0;
}

一次就过- -松松无压力