POJ 2252 Dungeon Master 三维水bfs

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

#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;

char maze[60][60][60];
bool vis[60][60][60];
int dir[6][3] = {{0,0,1}, {0,1,0}, {1,0,0}, {0,0,-1}, {0,-1,0}, {-1,0,0}};

struct Point
{
    int x, y, z, step;
};

struct Point start;

queue<struct Point>q;
void bfs()
{
    while(!q.empty())q.pop();
    memset(vis, 0, sizeof(vis));
    q.push(start);
    vis[start.x][start.y][start.z] = 1;
    while(!q.empty())
    {
        struct Point u = q.front();
        q.pop();
        if(maze[u.x][u.y][u.z] == 'E')
        {
            printf("Escaped in %d minute(s).
", u.step);
            return;
        }
        for(int d = 0; d < 6; d++)
        {
            int nx = u.x + dir[d][0];
            int ny = u.y + dir[d][1];
            int nz = u.z + dir[d][2];
            if(maze[nx][ny][nz] != '#' && maze[nx][ny][nz] != 0 && !vis[nx][ny][nz])
            {
                q.push((struct Point){nx, ny, nz, u.step+1});
                vis[nx][ny][nz] = 1;
            }
        }
    }
    printf("Trapped!
");
}

int main()
{
    int a, b, c;
    while(scanf("%d %d %d", &a, &b, &c) != EOF)
    {
        if(a == 0 && b == 0 && c == 0)break;
        memset(maze, 0, sizeof(maze));
        for(int i = 1; i <= a; i++)
        {
            for(int j = 1; j <= b; j++)
            {
                scanf("%s", &maze[i][j][1]);
                for(int k = 1; k <= c; k++)
                {
                    if(maze[i][j][k] == 'S')
                        start = (struct Point){i, j, k, 0};
                }
            }
        }
        bfs();
    }
    return 0;
}