POJ 2251

增加了方向的搜索

#include<map>
#include<set>
#include<list>
#include<stack>
#include<deque>
#include<queue>
#include<vector>
#include<sstream>
#include<iomanip>
#include<iostream>
#include<math.h>
#include<ctype.h>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<functional>
#define CPY(A,B)memcpy(A,B,sizeof(A))
#define fin freopen("in.txt","r",stdin)
#define fout freopen("out.txt","w",stdout)
typedef long long LL;
typedef unsigned long long uLL;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
const LL INFF=0x3f3f3f3f3f3f3f3fLL;
const double OO=1e20;
const double EPS=1e-9;
const double PI=acos (-1.0);
int dx[]= {0,1,0,-1};
int dy[]= {1,0,-1,0};
using namespace std;
int gcd (const LL &a,const LL &b) {
    return b==0?a:gcd (b,a%b);
}
inline int dcmp (double a,double b) {
    if (fabs (a-b) <EPS) { return 0; }
    return a<b?-1:1;
}
const int M=30030;
struct q {
    int x,y,z;
} q[M];
int len[M],l,r,c,sx,sy,sz;
int xx[]= {1,-1,0,0,0,0};
int yy[]= {0,0,0,0,-1,1};
int zz[]= {0,0,-1,1,0,0};
bool vis[40][40][40];
char Map[40][40][40];
int DFS() {
    int rear,fro,X,Y,Z;
    memset (vis,false,sizeof vis);
    memset (len,0,sizeof len);
    q[0].x=sx,q[0].y=sy,q[0].z=sz;
    fro=rear=0;
    while (fro<=rear) {
        for (int i=0; i<6; ++i) {
            X=q[fro].x+xx[i];
            Y=q[fro].y+yy[i];
            Z=q[fro].z+zz[i];
            if (!vis[X][Y][Z]&& (Map[X][Y][Z]=='.'||Map[X][Y][Z]=='E') &&X>=0&&X<l&&Y>=0&&Y<r&&Z>=0&&Z<c) {
                vis[X][Y][Z]=true;
                q[++rear].x=X;
                q[rear].y=Y;
                q[rear].z=Z;
                len[rear]=len[fro]+1;
                if (Map[X][Y][Z]=='E') return len[rear];
            }
        }
        fro++;
    }
    return 0;
}
int main() {
    while (scanf ("%d%d%d\n",&l,&r,&c) ) {
        if (l==0&&r==0&&c==0) break;
        for (int i=0; i<l; ++i,getchar() ) {
            for (int j=0; j<r; ++j,getchar() ) {
                for (int k=0; k<c; ++k) {
                    scanf ("%c",&Map[i][j][k]);
                    if (Map[i][j][k]=='S') {
                        sx=i,sy=j,sz=k;
                    }
                }
            }
        }
        int ans=DFS();
        if (ans) printf ("Escaped in %d minute(s).\n",ans);
        else printf ("Trapped!\n");
    }
    return 0;
}