POJ 2251 Dungeon Master

题意：给出一个长宽高分别为a,b,c的迷宫，S为起点，E为终点，每移动一格需要1minute，求出起点到终点的最短时间

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

思路：六方向广搜

注意点：无

以下为AC代码：

Run ID	User	Problem	Result	Memory	Time	Language	Code Length	Submit Time
13917543	luminous11	2251	Accepted	880K	32MS	G++	2608B	2015-02-27 22:12:19

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);
bool vis[35][35][35];
string s[35][35];
int dir[6][3] = { 1,0,0, -1,0,0, 0,1,0, 0,-1,0, 0,0,1, 0,0,-1 };
struct node{
    int x, y, z, cnt;
    node(){};
    node( int _x, int _y, int _z, int _cnt ): x(_x), y(_y), z(_z), cnt(_cnt){}
};
int a, b, c;
int bfs ( node tmp ){
    queue<node> q;
    q.push ( tmp );
    vis[tmp.x][tmp.y][tmp.z] = 1;
    while ( ! q.empty() ){
        tmp = q.front();
        q.pop();
        if ( s[tmp.x][tmp.y][tmp.z] == 'E' )return tmp.cnt;
        for ( int i = 0; i < 6; i ++ ){
            if ( tmp.x + dir[i][0] >= 0 && tmp.x + dir[i][0] < a &&
                 tmp.y + dir[i][1] >= 0 && tmp.y + dir[i][1] < b &&
                 tmp.z + dir[i][2] >= 0 && tmp.z + dir[i][2] < c &&
                vis[tmp.x+dir[i][0]][tmp.y+dir[i][1]][tmp.z+dir[i][2]] == 0
                && s[tmp.x+dir[i][0]][tmp.y+dir[i][1]][tmp.z+dir[i][2]] != '#' ){
                vis[tmp.x+dir[i][0]][tmp.y+dir[i][1]][tmp.z+dir[i][2]] = 1;
                q.push ( node( tmp.x+dir[i][0], tmp.y+dir[i][1], tmp.z+dir[i][2], tmp.cnt + 1 ) );
            }
        }
    }
    return -1;
}
int main()
{
    ios::sync_with_stdio( false );
    while ( cin >> a >> b >> c ){
        if ( a == 0 && b == 0 && c == 0 )return 0;
        node be, en;
        for ( int i = 0; i < a; i ++ ){
            for ( int j = 0; j < b; j ++ ){
                cin.ignore();
                cin >> s[i][j];
                for ( int k = 0; k < s[i][j].size(); k ++ ){
                    if ( s[i][j][k] == 'S' ){be.x=i;be.y=j;be.z=k;be.cnt=0;}
                    if ( s[i][j][k] == 'E' ){en.x=i;en.y=j;en.z=k;be.cnt=0;}
                }
            }
        }
        clr ( vis, 0 );
        int ans = bfs ( be );
        if ( ans > 0 ){
            cout << "Escaped in " << ans << " minute(s). " << endl;
        }
        else{
            cout << "Trapped!" << endl;
        }
    }
    return 0;
}