POJ2251 Dungeon Master

最新推荐文章于 2024-01-18 16:54:48 发布

原创最新推荐文章于 2024-01-18 16:54:48 发布 · 251 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个使用BFS（宽度优先搜索）算法解决三维迷宫问题的C++实现。通过定义节点结构体来存储位置及时间信息，并利用优先队列进行节点遍历，实现了从起点到终点的最短路径查找。

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;

struct node{
    int l,r,c;
    int t;

    bool operator < (const node &a)const{
        return t > a.t;
    }
};

const int dl[] = {0,0,0,0,-1,1},dr[] = {-1,0,1,0,0,0},dc[] = {0,-1,0,1,0,0};
char maze[35][35][35];
int vis[35][35][35];
int l,r,c;

int bfs(int i,int j,int k){
    memset(vis,0,sizeof(vis));
    priority_queue<node> q;
    vis[i][j][k] = 1;
    node cur;
    cur.l = i;cur.r = j;cur.c = k;cur.t = 0;
    q.push(cur);
    while(!q.empty()){
        cur = q.top();
        q.pop();
        if(maze[cur.l][cur.r][cur.c] == 'E'){
            return cur.t;
        }
        for(int i = 0; i < 6; i++){
            int ll = cur.l+dl[i],rr = cur.r+dr[i],cc = cur.c+dc[i];
            if(ll < 0 || ll >= l || rr < 0 || rr >= r || cc < 0 || cc >= c)
                continue;
            if(maze[ll][rr][cc] != '#' && !vis[ll][rr][cc]){
                vis[ll][rr][cc] = 1;
                q.push(node{ll,rr,cc,cur.t+1});
            }
        }
    }
    return -1;
}

int main(){
    while(scanf("%d%d%d",&l,&r,&c),l+r+c){
        for(int i = 0; i < l; i++){
            for(int j = 0; j < r; j++){
                scanf("%s",maze[i][j]);
            }
        }
        int ans;
        for(int i = 0; i < l; i++){
            for(int j = 0; j < r; j++){
                for(int k = 0; k < c; k++){
                    if(maze[i][j][k] == 'S'){
                        ans = bfs(i,j,k);
                    }
                }
            }
        }
        if(ans < 0)
            printf("Trapped!\n");
        else
            printf("Escaped in %d minute(s).\n",ans);
    }
    return 0;
}