【POJ2251】Dungeon Master(bfs)

记录一个菜逼成长。。

简单的bfs求最短路径。
二维的相信都会。
这题是三维的，只是多加了两个操作。其他都一样。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
#include <cctype>
#include <bitset>
#include <cmath>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define cl(a,b) memset(a,b,sizeof(a))
#define bp __builtin_popcount
#define pb push_back
#define mp make_pair
#define fin freopen("D://in.txt","r",stdin)
#define fout freopen("D://out.txt","w",stdout)
#define lson t<<1,l,mid
#define rson t<<1|1,mid+1,r
#define seglen (node[t].r-node[t].l+1)
#define pi 3.1415926
#define exp  2.718281828459
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef vector<PII> VPII;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
template <typename T>
inline void read(T &x){
    T ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    x = ans;
}
inline bool DBread(double &num)
{
    char in;double Dec=0.1;
    bool IsN=false,IsD=false;
    in=getchar();
    if(in==EOF) return false;
    while(in!='-'&&in!='.'&&(in<'0'||in>'9'))
        in=getchar();
    if(in=='-'){IsN=true;num=0;}
    else if(in=='.'){IsD=true;num=0;}
    else num=in-'0';
    if(!IsD){
        while(in=getchar(),in>='0'&&in<='9'){
            num*=10;num+=in-'0';}
    }
    if(in!='.'){
        if(IsN) num=-num;
            return true;
    }else{
        while(in=getchar(),in>='0'&&in<='9'){
                num+=Dec*(in-'0');Dec*=0.1;
        }
    }
    if(IsN) num=-num;
    return true;
}
template <typename T>
inline void write(T a) {
    if(a < 0) { putchar('-'); a = -a; }
    if(a >= 10) write(a / 10);
    putchar(a % 10 + '0');
}
/******************head***********************/
char g[35][35][35];
int vis[35][35][35];//保存距离和标记访问的点
int dx[] = {-1,0,1,0},dy[] = {0,1,0,-1};
int l,r,c;
struct node{
    int level,x,y;
};
bool bfs(int L,int x,int y)
{
    queue<node>q;
    node a,b;
    a.level = L;
    a.x = x;
    a.y = y;
    q.push(a);
    cl(vis,0);
    vis[L][x][y] = 1;
    int d = 1,cnt = 1,t = 0;
    while(!q.empty()){
        b = q.front();q.pop();
        if(cnt)cnt--;
        if(g[b.level][b.x][b.y] == 'E')return true;
        for( int i = 0; i < 4; i++ ){
            node tmp = b;
            tmp.x += dx[i],tmp.y += dy[i];
            if(vis[tmp.level][tmp.x][tmp.y] || g[tmp.level][tmp.x][tmp.y] == '#')continue;
            if(tmp.x < 1 || tmp.x > r || tmp.y < 1 || tmp.y > c)continue;
            vis[tmp.level][tmp.x][tmp.y] = d;
            q.push(tmp);
            t++;
        }
        node tmp = b;
        tmp.level += 1;
        if(tmp.level <= l && !vis[tmp.level][tmp.x][tmp.y] && g[tmp.level][tmp.x][tmp.y] != '#'){
            vis[tmp.level][tmp.x][tmp.y] = d;
            t++;
            q.push(tmp);
        }
        tmp.level -= 2;
        if(tmp.level > 0 && !vis[tmp.level][tmp.x][tmp.y] && g[tmp.level][tmp.x][tmp.y] != '#'){
            vis[tmp.level][tmp.x][tmp.y] = d;
            t++;
            q.push(tmp);
        }
        if(!cnt){cnt = t; t = 0; d++;}
    }
    return false;
}
int main()
{
    while(~scanf("%d%d%d",&l,&r,&c) && l && r && c){
        int sl,sx,sy;
        int el,ex,ey;
        for( int i = 1; i <= l; i++ ){
            for( int j = 1; j <= r; j++ ){
                scanf("%s",g[i][j]+1);
                for( int k = 1; k <= c; k++ ){
                    if(g[i][j][k] == 'S'){
                        sl = i,sx = j,sy = k;
                    }
                    if(g[i][j][k] == 'E'){
                        el = i,ex = j,ey = k;
                    }
                }
            }
        }
        bool ret = bfs(sl,sx,sy);
        if(ret){
            printf("Escaped in %d minute(s).\n",vis[el][ex][ey]);
        }
        else puts("Trapped!");
    }
    return 0;
}