POJ2251（BFS求最短路）

最新推荐文章于 2020-09-14 20:36:18 发布

Emma1997

最新推荐文章于 2020-09-14 20:36:18 发布

阅读量801

点赞数

分类专栏： acm水题

本文链接：https://blog.csdn.net/Ema1997/article/details/51863763

版权

本文介绍了一种使用BFS算法求解3D迷宫中从'S'到'E'最短路径的问题。当无法逃脱迷宫时输出'Trapped!'，否则输出以分钟计的最短逃脱时间。

摘要由CSDN通过智能技术生成

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!

题意：给你一个三维迷宫，让你算出从‘S’到‘E’的最短路径，如果没有通路，则输出”Trapped!”，否则输出”Escaped in x minute(s).”，x为最短路经过的路径数。

题解：从终点开始BFS，搜索出每一个能到达的点到终点的最短路径，当全部搜索完时，如果起点没有被搜索到，说明不通，否则起点到终点的最短路就是所要求得的结果。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <queue>
#include <cmath>
#include <vector>

using namespace std;

struct POINT {
    int l, r, c;
    POINT (int l = 0, int r = 0, int c = 0) : l(l), r(r), c(c) {}
};

const int maxn = 35;
int d[maxn][maxn][maxn], vis[maxn][maxn][maxn], l, r, c;
char maze[maxn][maxn][maxn];
POINT s, e;

void BFS()
{
    POINT cur;
    queue<POINT> q;
    q.push(e);
    vis[e.l][e.r][e.c] = 1;
    d[e.l][e.r][e.c] = 0;
    while (!q.empty()) {
        cur = q.front(); q.pop();
        //printf ("%d %d %d ", cur<