Dungeon Master(BFS)

最新推荐文章于 2024-09-15 11:05:32 发布

[xixi]

最新推荐文章于 2024-09-15 11:05:32 发布

阅读量140

点赞数 1

分类专栏： c

本文链接：https://blog.csdn.net/fang_kuai/article/details/86563290

版权

c 专栏收录该内容

44 篇文章 0 订阅

订阅专栏

Description
You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south, east, west, up or down. You cannot move diagonally and the maze is surrounded by solid rock on all sides.

Is an escape possible? If yes, how long will it take?

Input

The input consists of a number of dungeons. Each dungeon description starts with a line containing three integers L, R and C (all limited to 30 in size).
L is the number of levels making up the dungeon.
R and C are the number of rows and columns making up the plan of each level.
Then there will follow L blocks of R lines each containing C characters. Each character describes one cell of the dungeon. A cell full of rock is indicated by a ‘#’ and empty cells are represented by a ‘.’. Your starting position is indicated by ‘S’ and the exit by the letter ‘E’. There’s a single blank line after each level. Input is terminated by three zeroes for L, R and C.

Output
Each maze generates one line of output. If it is possible to reach the exit, print a line of the form
Escaped in x minute(s).

where x is replaced by the shortest time it takes to escape.
If it is not possible to escape, print the line
Trapped!

Sample Input

3 4 5
S…
.###.
.##…
###.#

##.##
##…

#.###
####E

1 3 3
S##
#E#

0 0 0

Sample Output
Escaped in 11 minute(s).
Trapped!

#include <stdio.h>
#include <queue>
#include <algorithm>
#include <string.h>
using namespace std;
char map[35][35][35];
int vis[35][35][35];
int dir[6][3] = {{0, 0, 1},{0, 0, -1},{0, 1, 0},{0, -1, 0},{1, 0, 0},{-1, 0, 0}};
int l, r, c;
int sx, sy, sz, ex, ey, ez;
struct node{
    int x, y, z;
    int step;
};
node now, next;
int check(){
    if(next.x >= c || next.y >= r || next.z >= l || next.x < 0 || next.y < 0 || next.z < 0) return 0;
    if(vis[next.z][next.y][next.x]) return 0;
    if(map[next.z][next.y][next.x] == '#') return 0;
    return 1;
}
void bfs(){
    queue<node>q;
    now.z = sz; now.y = sy; now.x = sx;
    now.step = 0;
    q.push(now);
    vis[sz][sy][sx] = 1;
    while(!q.empty()){
        now = q.front();
        q.pop();
        if(now.x == ex && now.y == ey && now.z == ez){
            printf("Escaped in %d minute(s).\n", now.step);
            return;
        }
        for(int i = 0; i < 6; i++){
            next.x = now.x + dir[i][0];
            next.y = now.y + dir[i][1];
            next.z = now.z + dir[i][2];
            if(!check()) continue;
            vis[next.z][next.y][next.x] = 1;
            next.step = now.step + 1;
            q.push(next);
        }
    }
    printf("Trapped!\n");
    return;
}
int main(){
    //freopen("data1.in","r",stdin);
    while(scanf("%d %d %d", &l, &r, &c), l){
        for(int i = 0; i < l; i++)
            for(int j = 0; j < r; j++){
                  scanf("%s", map[i][j]);
                  for(int k = 0; k < c; k++){
                     if(map[i][j][k] == 'S'){
                        sz = i;
                        sy = j;
                        sx = k;
                      }
                     else if(map[i][j][k] == 'E'){
                        ez = i;
                        ey = j;
                        ex = k;
                     }
                  }
              }
        memset(vis, 0, sizeof(vis));
        bfs();
    }
    return 0;
}