【复健系列】POJ 2251 Dungeon Master 宽度优先搜索

BFS裸题。

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

int L,R,C;
char mmp[35][35][35];
bool visited[35][35][35];
int stx, sty, stz;
int res = 0x3f3f3f3f;
struct pos{
    int x,y,z,step;
    pos(){}
    pos(int x,int y,int z,int step):x(x),y(y),z(z),step(step){}
};
int vv[6][3] = {
    {-1,0,0},{1,0,0},
    {0,-1,0},{0,1,0},
    {0,0,-1},{0,0,1}
};
void search(){
    queue< pos >ws;
    ws.push(pos(stx,sty,stz,0));
    while(!ws.empty()) {
        pos pivot = ws.front(); ws.pop();
        //printf("current: %d %d %d\n",pivot.x, pivot.y, pivot.z);
        if(visited[pivot.z][pivot.y][pivot.x])continue;
        if(mmp[pivot.z][pivot.y][pivot.x] == 'E'){
            if(res > pivot.step){
                res = pivot.step;
            }
            continue;
        }
        for(int i=0;i<6;i++){
            int newx = pivot.x+vv[i][0],
                newy = pivot.y+vv[i][1],
                newz = pivot.z+vv[i][2];
            if(newx>=0&&newx<C&&newy>=0&&newy<R&&newz>=0&&newz<L
            && (mmp[newz][newy][newx] == '.' || mmp[newz][newy][newx] == 'E')){
                ws.push(pos(newx,newy,newz,pivot.step+1));
            }
        }
        visited[pivot.z][pivot.y][pivot.x] = true;
    }
}

int main() {
    while(~scanf("%d%d%d",&L,&R,&C)&&L&&R&&C) {
        memset(visited,0,sizeof(visited));
        res = 0x3f3f3f3f;
        for(int z=0;z<L;z++){
            for(int y=0;y<R;y++)scanf("%s",&mmp[z][y]);
        }
        for(int z=0;z<L;z++){
            for(int y=0;y<R;y++){
                for(int x=0;x<C;x++){
                    if(mmp[z][y][x] == 'S'){
                        stx = x, sty = y, stz = z;
                        goto next;
                    }
                }
            }
        }
        next:;
        search();
        if(res == 0x3f3f3f3f){
            printf("Trapped!\n");
        } else {
            printf("Escaped in %d minute(s).\n", res);
        }
    }
    return 0;
}