poj 2251

三维BFS仅此而已。

Source Code
Problem: 2251		User: Burglar
Memory: 724K		Time: 32MS
Language: C++		Result: Accepted

    Source Code

    #include<stdio.h>
    #include<string.h>
    #define INF 10000
    int dp[40][40][40];
    char map[40][40][40];
    struct queue{
        int x,y,z;
    };
    queue q[100000];
    int xx[]={1,-1,0,0,0,0};
    int yy[]={0,0,0,0,-1,1};
    int zz[]={0,0,-1,1,0,0};
    int main(){
        int l,n,m,sx,sy,sz,ans,nx,ny,nz;
        while(scanf("%d%d%d",&l,&n,&m)!=EOF&&l!=0&&n!=0&&m!=0){
            getchar();
            ans=-1;
            for(int i=0;i<l;i++,getchar())
                for(int j=0;j<n;j++,getchar())
                    for(int k=0;k<m;k++){
                        scanf("%c",&map[i][j][k]);
                        dp[i][j][k]=INF;
                        if(map[i][j][k]=='S') sx=i,sy=j,sz=k;
            }
            //printf("%d %d %d %c",sx,sy,sz,map[sx][sy][sz]);
            q[0].x=sx;
            q[0].y=sy;
            q[0].z=sz;
            dp[sx][sy][sz]=0;
            int front,push;
            front=0;
            push=1;
            while(front<push&&ans==-1){
            //printf("yes\n");
                for(int i=0;i<6;i++){
                    nx=q[front].x+xx[i];
                    ny=q[front].y+yy[i];
                    nz=q[front].z+zz[i];
                    if(0<=nx&&nx<l&&0<=ny&&ny<n&&0<=nz&&nz<m&&dp[nx][ny][nz]==INF&&map[nx][ny][nz]!='#'){
                        dp[nx][ny][nz]=dp[q[front].x][q[front].y][q[front].z]+1;
                        q[push].x=nx;
                        q[push].y=ny;
                        q[push++].z=nz;
                        if(map[nx][ny][nz]=='E'){
                            ans=dp[nx][ny][nz];
                            break;
                        }
                        //printf("yes\n");
                    }
                }
                front++;
               // printf("%d %d\n",front,push);
            }
            //printf("yes\n");
           if(ans==-1){
                printf("Trapped!\n");
           }
           else{
                printf("Escaped in %d minute(s).\n",ans);
           }
        }
        return 0;
    }