POJ 2251 Dungeon Master(BFS 广度优先搜索)

Dungeon Master

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!

题意: 有个人被关进了一个3D的牢里,每个牢房都可以东南西北上下移动(每移动一次需要一分钟,但是有些牢房被石头堵住了不能走,如果能逃出去,计算总共用了多少分钟。输入第一行有三个数字分别代表牢房有多少层,多少行和多少列(如果为3个0则结束输入),’#‘代表不能走这里,‘.’ 表示通路,可以走出去,’S’代表起始位置,‘E’代表出口。计算走出去所需最短的时间。如果不行,则输出
Trapped!。
这是一个典型的广度优先搜索,每一层都遍历,直到找到出口为止。

#include <stdio.h>


struct Node {
	int x, y, z,step;
} inq[30000];
int ex, ey, ez, sx, sy, sz;
char s[35][35][35];
int dx[6] = {0, 0, -1, 1, 0, 0};
int dy[6] = {0, 0, 0, 0, -1, 1};
int dz[6] = {1, -1, 0, 0, 0, 0};
void bfs() {
	int cnt = 0, ll = 0, vis[35][35][35] = {0};
	inq[cnt].x = sx, inq[cnt].y = sy, inq[cnt].z = sz, inq[cnt++].step = 0;
	while(ll < cnt) {
		for(int i = 0; i < 6; i++) {
			int x = dx[i] + inq[ll].x, y = dy[i] + inq[ll].y, z = dz[i] + inq[ll].z;
			if(x == ex && y == ey && z == ez) {
				printf("Escaped in %d minute(s).\n", inq[ll].step + 1);
				return ;
			}
			if(s[z][y][x] == '.' && !vis[z][y][x]) {
				inq[cnt].x = x, inq[cnt].y = y, inq[cnt].z = z;
				inq[cnt].step = inq[ll].step + 1;
				vis[z][y][x] = 1;
				cnt++;
			}
		}
		ll++;
	}
	printf("Trapped!\n");
}
int main() {
	int n, r, c;
	while(scanf("%d %d %d", &n, &r, &c) && (n || r || c)) {
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= r; j++)
				for(int k = 1; k <= c; k++) {
					scanf(" %c", &s[i][j][k]);
					if(s[i][j][k] == 'S') {
						sz = i;
						sx = k;
						sy = j;
					} else if(s[i][j][k] == 'E') {
						ez = i;
						ex = k;
						ey = j;
					}
				}
		bfs();
	}
	return 0;
}

End

©️2020 CSDN 皮肤主题: 游动-白 设计师:上身试试 返回首页