poj2251 Dungeon Master(三维bfs)

本文介绍了一个基于三维迷宫的逃逸算法实现。该算法利用广度优先搜索(BFS)策略来寻找从起点到终点的最短路径。在三维空间中,通过判断当前位置的可达性和状态标记,确保搜索的有效进行。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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 <queue>
#include <cstring>
using namespace std;
const int maxn=35; 
int k,n,m;
int sz,sx,sy,ez,ex,ey;
int vis[maxn][maxn][maxn];
char inf[maxn][maxn][maxn];//inf第一维表示层数,第二层表示行数,第三层表示列数 
int dir[6][3]={{0,1,0},{0,-1,0},{0,0,1},{0,0,-1},{1,0,0},{-1,0,0}};
struct node
{
	int z,x,y;
	int step;
};
bool check(int z,int x,int y)
{
	if(!vis[z][x][y]&&z>=1&&z<=k&&x>=1&&x<=n&&y>=1&&y<=m&&(inf[z][x][y]=='.'||inf[z][x][y]=='E'))return true;
	return false;
}
int bfs()
{
	queue<node>q;
	node pre,nxt;
	pre.z=sz,pre.x=sx,pre.y=sy,pre.step=0;
	q.push(pre);
	vis[sz][sx][sy]=1;
	while(!q.empty()){
		pre=q.front();
//		cout<<pre.z<<"  "<<pre.x<<" "<<pre.y<<"  "<<pre.step<<endl;
		q.pop();
		if(pre.z==ez&&pre.x==ex&&pre.y==ey){
			return pre.step;
		}
		int tempz,tempx,tempy;
		for(int i=0;i<6;i++){
			tempz=pre.z+dir[i][0];
			tempx=pre.x+dir[i][1];
			tempy=pre.y+dir[i][2];
			if(check(tempz,tempx,tempy)){
				nxt.z=tempz;
				nxt.x=tempx;
				nxt.y=tempy;
				nxt.step=pre.step+1;
				vis[tempz][tempx][tempy]=1;
				q.push(nxt);
			}
		}
	}
	return -1;
}
int main(){
	ios::sync_with_stdio(false);
	while(cin>>k>>n>>m){
		if(k==0&&n==0&&m==0)break;
		for(int le=1;le<=k;le++){
			for(int i=1;i<=n;i++){
				for(int j=1;j<=m;j++){
					cin>>inf[le][i][j];
					
					if(inf[le][i][j]=='S'){
						sz=le,sx=i,sy=j;
					} 
					if(inf[le][i][j]=='E'){
						ez=le,ex=i,ey=j;
					}
				}
			}
		}
		memset(vis,0,sizeof vis);
//		cout<<"haha"<<endl;
		int ans=bfs();	
//		cout<<"haha1"<<endl;
		if(ans<0)cout<<"Trapped!"<<endl;
		else
		cout<<"Escaped in "<<ans<<" minute(s)."<<endl;
	}
	return 0;
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

胖头鱼爱算法

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值