POJ 2251 Dungeon Master

最新推荐文章于 2025-06-14 00:21:17 发布

原创最新推荐文章于 2025-06-14 00:21:17 发布 · 3.5k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

搜索(DFS/BFS)

蓝桥杯

POJ

本文深入解析了POJ2251 Dungeon Master问题的解决方案，通过三维广度优先搜索（BFS）算法，在限定时间内找到从迷宫起点到终点的最短路径。介绍了算法的具体实现过程，包括数据结构设计、状态转移和边界条件处理。

POJ 2251 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!

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
char mp[50][50][50];
int f[50][50][50];
int l,r,c;
int dz[6] = {0,1,0,-1,0,0};
int dx[6] = {1,0,-1,0,0,0};
int dy[6] = {0,0,0,0,1,-1};
int x1,x2,y1,y2,z1,z2;
typedef struct node {
	int z;
	int x;
	int y;
}Node;
int bfs(int zz,int xx,int yy){
	memset(f,-1,sizeof(f));
	queue<Node> q;
	Node frist;
	frist.z = zz;
	frist.x = xx;
	frist.y = yy;
	q.push(frist);
	f[zz][xx][yy] = 0;
	while(!q.empty()){
		Node temp = q.front();
		q.pop();
		for(int i=0;i<6;i++){
			int nz = temp.z + dz[i];
			int nx = temp.x + dx[i];
			int ny = temp.y + dy[i];
			if(nz>=0&&nz<l&&nx>=0&&nx<r&&ny>=0&&ny<c&&f[nz][nx][ny]==-1&&(mp[nz][nx][ny]=='.'||mp[nz][nx][ny]=='E')){
				Node newNode;
				newNode.z = nz;
				newNode.x = nx;
				newNode.y = ny;
				q.push(newNode);
				f[nz][nx][ny] = f[temp.z][temp.x][temp.y] + 1;
			}
		}
	}
	return f[z2][x2][y2];
}
int main()
{
	while(true){
		cin>>l>>r>>c;
		if(l==0&&r==0&&c==0){
			break;
		}
		memset(mp,-1,sizeof(mp));
		for(int i=0;i<l;i++){
			for(int j=0;j<r;j++){
				for(int k=0;k<c;k++){
					cin>>mp[i][j][k];
					if(mp[i][j][k] == 'S'){
						z1 = i;
						x1 = j;
						y1 = k;
					}
					else if(mp[i][j][k] == 'E'){
						z2 = i;
						x2 = j;
						y2 = k;
					}
				}
			}
		}
		int ans = bfs(z1,x1,y1);
		if(ans==-1){
			cout<<"Trapped!"<<endl;
		}
		else {
			printf("Escaped in %d minute(s).\n",ans);
		}
	}

	return 0;
}

bfs三维板子题