Dungeon Master poj 2251 dfs
来源:互联网 发布:幻刃网络 编辑:程序博客网 时间:2024/05/16 18:39
Language:
Dungeon Master
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16855 Accepted: 6564
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?
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.
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
where x is replaced by the shortest time it takes to escape.
If it is not possible to escape, print the line
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 5S.....###..##..###.#############.####...###########.#######E1 3 3S###E####0 0 0
Sample Output
Escaped in 11 minute(s).Trapped!
Source
Ulm Local 1997
题意:给你一个三维迷宫,从起点到终点求最短步数。
思路:和二维的迷宫问题差不多,稍微改成三维的就行了。
代码:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <string>#include <queue>using namespace std;struct Node{ int x,y,z; int step;};char mp[35][35][35];int visit[35][35][35];int dir[6][3]={-1,0,0,1,0,0,0,-1,0,0,1,0,0,0,1,0,0,-1};//x,y,zint N,M,P,sx,sy,sz,ex,ey,ez;bool ISok(int x,int y,int z){ if (z>=0&&z<P&&x>=0&&x<N&&y>=0&&y<M&&mp[z][x][y]!='#'&&!visit[z][x][y]) return true; return false;}void bfs(){ Node st,now; memset(visit,0,sizeof(visit)); queue<Node>Q; visit[sz][sx][sy]=1; st.x=sx;st.y=sy;st.z=sz; st.step=0; Q.push(st); while (!Q.empty()) { st=Q.front(); Q.pop(); if (st.x==ex&&st.y==ey&&st.z==ez) { printf("Escaped in %d minute(s).\n",st.step); return ; } for (int i=0;i<6;i++) { now.x=st.x+dir[i][0]; now.y=st.y+dir[i][1]; now.z=st.z+dir[i][2]; if (ISok(now.x,now.y,now.z)) { now.step=st.step+1; visit[now.z][now.x][now.y]=1; Q.push(now); } } } printf("Trapped!\n"); return ;}int main(){ while (scanf("%d%d%d",&P,&N,&M)&&P) { for (int i=0;i<P;i++) { for (int j=0;j<N;j++) { scanf("%s",mp[i][j]);//z,x,y for (int t=0;t<M;t++) { if (mp[i][j][t]=='S') { sx=j;sy=t;sz=i; } if (mp[i][j][t]=='E') { ex=j;ey=t;ez=i; } } } } bfs(); } return 0;}
39 0
- POJ 2251 Dungeon Master DFS
- Dungeon Master poj 2251 dfs
- Poj 2251 Dungeon Master(三维Dfs)
- POJ 2251 Dungeon Master BFS&DFS
- 【POJ】2251 - Dungeon Master(dfs + 队列)
- poj 2251 Dungeon Master
- poj 2251 Dungeon Master
- poj 2251 Dungeon Master
- poj 2251 Dungeon Master
- Poj 2251 Dungeon Master
- poj 2251 Dungeon Master
- poj 2251 Dungeon Master
- POJ 2251 Dungeon Master
- POJ-2251-Dungeon Master
- POJ 2251Dungeon Master
- poj 2251 Dungeon Master
- poj 2251 Dungeon Master
- poj 2251 Dungeon Master
- 师徒制,多么好的工具
- linux之vpn服务器配置
- Shell数值、字符串比较
- C++中int型与string型互相转换
- java 动态代理
- Dungeon Master poj 2251 dfs
- leetcode 二分查找 Sqrt(x)
- 百度推送 - 低版本无法启动推送服务的解决方法
- PHP 载入图像 imagecreatefrom_gif_jpeg_png 系列函数
- cocosBuilder创建过程 以小倩快跑为例
- ubuntu安装LAMP环境
- 关于内层DIV设置margin-top不起作用的解决方案
- Tomcat6.0数据源配置详解
- JMeter——运用BeanShell给自定义的变量动态赋值