poj2251Dungeon Master（bfs模板题）

题目链接：http://poj.org/problem?id=2251

可以说是bfs的模板题了。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
using namespace std;
char pic[32][32][32];
int vis[32][32][32];
int dir[6][3]={0,0,1,0,0,-1,1,0,0,-1,0,0,0,1,0,0,-1,0};

int ex,ey,ez;
int l,n,m;

struct node
{
    int x,y,z;
    int d;
}now,nex;



int bfs()
{

    queue<node> q;
    now.d=0;
    q.push(now);
    while(!q.empty())
    {
        now=q.front();
        q.pop();
        if(now.x==ex&&now.y==ey&&now.z==ez) return now.d;
        for(int i=0;i<6;i++)
        {
            nex.x=now.x+dir[i][0];
            nex.y=now.y+dir[i][1];
            nex.z=now.z+dir[i][2];
            if(!vis[nex.x][nex.y][nex.z]&&pic[nex.x][nex.y][nex.z]!='#'
               &&nex.x>=0&&nex.x<l&&nex.y>=0&&nex.y<n&&nex.z>=0&&nex.z<m)
            {
                nex.d=now.d+1;
                vis[nex.x][nex.y][nex.z]=1;
                q.push(nex);
            }
        }
    }
    return -1;

}

int main()
{
    while(scanf("%d%d%d",&l,&n,&m)!=EOF&&(m||n||l))
    {
        memset(vis,0,sizeof(vis));

        for(int i=0;i<l;i++)
            for(int j=0;j<n;j++)
                 for(int k=0;k<m;k++)
        {
                cin>>pic[i][j][k];
                  if(pic[i][j][k]=='S') {vis[i][j][k]=1;now.x=i;now.y=j;now.z=k;}
                  if(pic[i][j][k]=='E') {ex=i;ey=j;ez=k;}

        }
        int st=bfs();
        if(st==-1) puts("Trapped!");
        else printf("Escaped in %d minute(s).
", st);
    }
    return 0;
}