POJ 2251 Dungeon Master

http://poj.org/problem?id=2251

这道题 就是3D版的迷宫问题 

利用BFS求解即可 只需多加Z轴这一维度

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
#define READ() freopen("in.txt", "r", stdin);

using namespace std;


struct Loc
{
    int l, r, c, step;
    Loc () {}
    Loc (int l, int r, int c, int step) : l(l), r(r), c(c), step(step) {}
};
int L, R, C, sl, sr, sc;
char maze[32][32][32];
bool use[32][32][32];


int d[6][3] =
{
    0, -1, 0,
    0, 0, 1,
    0, 1, 0,
    0, 0, -1,
    1, 0, 0,
    -1, 0, 0
};
bool OK(int l, int r, int c)
{
    if (l < 0 || l >= L || r < 0 || r >= R || c < 0 || c >= C) return false;
    if (maze[l][r][c] == '#') return false;
    else return true;
}
int bfs()
{
    queue<Loc> que;
    Loc sloc = Loc(sl, sr, sc, 0);
    que.push(sloc);
    while (!que.empty())
    {
        Loc loc = que.front();
        que.pop();
        if (use[loc.l][loc.r][loc.c]) continue;
        use[loc.l][loc.r][loc.c] = true;
        for (int i = 0; i < 6; i++)
        {
            int nl = loc.l + d[i][0], nr = loc.r + d[i][1], nc = loc.c + d[i][2];
            if (OK(nl, nr, nc))
            {
                if (maze[nl][nr][nc] == 'E') return loc.step+1;
                else if (!use[nl][nr][nc]);
                {
                    Loc nloc = Loc(nl, nr, nc, loc.step+1);
                    que.push(nloc);
                }
            }
        }
    }
    return -1;
}

int main()
{
    //READ()
    while (~scanf("%d%d%d",  &L, &R, &C))
    {
        if (L == 0 && R == 0 && C == 0) break;
        getchar();
        for (int l = 0; l < L; l++)
        {
            for (int r = 0; r < R; r++)
            {
                for (int c = 0; c < C; c++)
                {
                    scanf("%c", &maze[l][r][c]);
                    if (maze[l][r][c] == 'S')
                    {
                        sl = l;
                        sr = r;
                        sc = c;
                    }
                }
                getchar();
            }
            getchar();
        }
        memset(use, 0, sizeof(use));
        int ans = bfs();
        if ( ans == -1) puts("Trapped!");
        else printf("Escaped in %d minute(s).\n", ans);
    }
}