POJ 2251 Dungeon Master

　　毫无意义的三维BFS.....

　　从 S 出发 每次可以选择六个方向 求到 E 的最小移动次数　。

　　

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <queue>

using namespace std;

char maze[31][31][31];
bool MarkMaze[31][31][31];

struct P
{
    int l,r,c,step;
}sp,ep,tp,np;

int L,R,C,len;

int jl[] = { 0, 0, 0, 0, 1,-1};
int jr[] = {-1, 0, 1, 0, 0, 0};
int jc[] = { 0,-1, 0, 1, 0, 0};

void bfs()
{
    queue<P> q;
    sp.step = 0;
    q.push(sp);

    while(q.empty() == false)
    {
        tp = q.front();
        q.pop();

        if(tp.l == ep.l && tp.c == ep.c && tp.r == ep.r)
        {
            len = tp.step;
            return ;
        }

        for(int i = 0;i < 6; ++i)
        {
            np.c = tp.c + jc[i];
            np.l = tp.l + jl[i];
            np.r = tp.r + jr[i];
            np.step = tp.step + 1;
            if(np.c >= 1 && np.c <= C && np.l >= 1 && np.l <= L && np.r >= 1 && np.r <= R && maze[np.l][np.r][np.c] != '#' && MarkMaze[np.l][np.r][np.c] == false)
            {
                MarkMaze[np.l][np.r][np.c] = true;
                q.push(np);
            }
        }
    }
}

int main()
{
    int i,j,k;

    while(scanf("%d %d %d",&L,&R,&C) && (L || R || C))
    {
        len = -1;

        memset(MarkMaze,false,sizeof(MarkMaze));

        for(i = 1;i <= L; ++i)
        {
            for(j = 1;j <= R; ++j)
            {
                scanf("%s",maze[i][j]+1);
            }
            getchar();
        }

        for(i = 1;i <= L; ++i)
        {
            for(j = 1;j <= R; ++j)
            {
                for(k = 1;k <= C; ++k)
                {
                    if(maze[i][j][k] == 'S')
                    {
                        sp.l = i;
                        sp.r = j;
                        sp.c = k;
                    }
                    else if(maze[i][j][k] == 'E')
                    {
                        ep.l = i;
                        ep.r = j;
                        ep.c = k;
                    }
                }
            }
        }

        bfs();

        if(len == -1)
            printf("Trapped!
");
        else
            printf("Escaped in %d minute(s).
",len);
    }
}