POJ-----2251BFS

最新推荐文章于 2024-01-23 17:11:13 发布

pupil_blue

最新推荐文章于 2024-01-23 17:11:13 发布

阅读量171

点赞数

分类专栏： DFS/BFS

本文链接：https://blog.csdn.net/blue_hpu/article/details/52061133

版权

DFS/BFS 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

Dungeon Master

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 26433		Accepted: 10292

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!

就记得同学在我旁边跟我说，快做这个，这个简单，BFS入门级水题-----

没什么技巧，就是模板

#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<algorithm>
using namespace std;
char s[40][40][40];
int ss[40][40][40], L, R, C, X, Y, Z;
int sss[10][3] = {0, 0, 1, 0, 0, -1, 0, -1, 0, 0, 1, 0, 1, 0, 0, -1, 0, 0};
struct node{
	int x, y, z, step;
}v, n, t, r;
bool judge(node v){
	if(v.x < 0 || v.y < 0 || v.z < 0){
		return false;
	}
	if(v.x >= L || v.y >= R || v.z >= C){
		return false;
	}
	if(s[v.x][v.y][v.z] == '#' || ss[v.x][v.y][v.z]){
		return false;
	}
	return true;
}
void dfs(){
	queue<node > q;
	n.x = X;
	n.y = Y;
	n.z = Z;
	n.step = 0;
	q.push(n);
	s[X][Y][Z] = 1;
	while(!q.empty()){
		t = q.front();
		r = t;
		q.pop();
		for(int i = 0; i < 6; i++){
			r.x = t.x + sss[i][0];
			r.y = t.y + sss[i][1];
			r.z = t.z + sss[i][2];
			r.step = t.step+1;
			if(judge(r)){
				if(s[r.x][r.y][r.z] == 'E'){
					printf("Escaped in %d minute(s).\n", r.step);
					return ;
				}
				ss[r.x][r.y][r.z] = 1;
				q.push(r);
			}
		}
	}
	printf("Trapped!\n");
}
int main(){
	while(~scanf("%d%d%d", &L, &R, &C), R || L || C){
		int o = 0;
		for(int i = 0; i < L; i++){
			for(int j = 0; j < R; j++){
				scanf(" %s", s[i][j]);
				if(!o){
					for(int k = 0; k < C; k++){
						if(s[i][j][k] == 'S'){
							X = i;
							Y = j;
							Z = k;
							o++;
						}
					}
				}
			}
		}
		memset(ss, 0, sizeof(ss));
		dfs();
	}
	return 0;
}