HDU Dungeon Master广搜

题目https://vjudge.net/contest/145660?#problem/B
三维空间最短路问题用广搜

#include<iostream>
#include<string.h>
#include<queue>//队列头文件
using namespace std;
char map[35][35][35];//地图
int a,b,c;
int vis[35][35][35];//用于标记
struct node
{
    int sai,sbi,sci,ans;
};
int sa,sb,sc,da,db,dc;
int ans;
int go[6][3]= {{1,0,0},{-1,0,0},{0,0,1},{0,0,-1},{0,1,0},{0,-1,0}};//东西南北上下
int bfs(int sa,int sb,int sc)//广搜
{
    node now,next;//定义两个结构体
    queue<node>s;//定义一个队列
    now.sai=sa,now.sbi=sb,now.sci=sc,now.ans=0;
    s.push(now);//把入口压入队列
    while(!s.empty())//队列不为空时继续循环
    {
        now=s.front();//返回队列头部文件
        if(now.sai==da&&now.sbi==db&&now.sci==dc)
            return now.ans;//达到终点就返回步数
        for(int u=0; u<6; u++)//六个方向
        {
            int x=now.sai+go[u][0],y=now.sbi+go[u][1],z=now.sci+go[u][2];
            if(x>=0&&x<a&&y>=0&&y<b&&z>=0&&z<c&&map[x][y][z]!='#'&&!vis[x][y][z])//不越界且没走过
            {
                vis[x][y][z]=1;//标记已走过
                next.sai=x,next.sbi=y,next.sci=z,next.ans=now.ans+1;
                s.push(next);//压入队列
            }
        }
        s.pop();//删除
    }
    return 0;
}
int main()
{
    while(cin>>a>>b>>c)
    {
        if(a==0&&b==0&&c==0)
            return 0;
        memset(vis,0,sizeof(vis));
        int h,i,j;
        for(h=0; h<a; h++)
        {
            for(i=0; i<b; i++)
            {
                for(j=0; j<c; j++)
                {
                    cin>>map[h][i][j];
                    if(map[h][i][j]=='S')//找入口
                    {
                        sa=h;
                        sb=i;
                        sc=j;
                    }
                    if(map[h][i][j]=='E')//找出口
                    {
                        da=h;
                        db=i;
                        dc=j;
                    }
                }
            }
        }
        if(sa==da&&sb==db&&sc==dc)
        {
            cout<<"Escaped in 0 minute(s)."<<endl;
        }
        else
        {
            int q=bfs(sa,sb,sc);
            if(q!=0)
            {
                cout<<"Escaped in "<<q<<" minute(s)."<<endl;
            }
            else
            {
                cout<<"Trapped!"<<endl;
            }
        }
    }
    return 0;
}

转载于:https://www.cnblogs.com/zxy160/p/7215182.html