Dungeon Master
来源:互联网 发布:linux内核源代码在哪 编辑:程序博客网 时间:2024/06/16 14:08
poj2251
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?
Is an escape possible? If yes, how long will it take?
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.
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!
3 4 5S.....###..##..###.#############.####...###########.#######E1 3 3S###E####0 0 0
Escaped in 11 minute(s).Trapped!
简单的bfs
#include<iostream>#include<queue>#include<string.h>using namespace std;int v[33][33][33];char s[33][33][33];int k,n,m,sx,sy,sz,ex,ey,ez;int to[6][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;};int check(int x,int y,int z){ if(x<0||x>=k||y<0||y>=n||z<0||z>=m)return 1; else if(s[x][y][z]=='#')return 1; else if(v[x][y][z]==1)return 1; return 0;}int bfs(){ node a,next; queue<node>q; a.x=sx;a.y=sy,a.z=sz;a.step=0; v[sx][sy][sz]=1; q.push(a); while(!q.empty()){ a=q.front(); q.pop(); if(a.x==ex&&a.y==ey&&a.z==ez)return a.step; for(int i=0;i<6;i++){ next=a; next.x=a.x+to[i][0]; next.y=a.y+to[i][1]; next.z=a.z+to[i][2]; if(check(next.x,next.y,next.z))continue; v[next.x][next.y][next.z]=1; next.step=a.step+1; q.push(next); } } return 0;}int main(){ while(cin>>k>>n>>m&&k+n+m){ for(int i=0;i<k;i++){ for(int j=0;j<n;j++){ cin>>s[i][j]; for(int k=0;k<m;k++){//找出起点和终点 if(s[i][j][k]=='S'){ sx=i;sy=j;sz=k; } if(s[i][j][k]=='E'){ ex=i;ey=j;ez=k; } } } } memset(v,0,sizeof(v)); int ans; ans=bfs(); if(ans){ cout<<"Escaped in "<<ans<<" minute(s)."<<endl; } else cout<<"Trapped!"<<endl; } return 0;}
0 0
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Dungeon Master
- Minor GC、Major GC和Full GC之间的区别
- 学习《OpenCV 2 计算机视觉编程手册》第二章---使用指针遍历图像案例
- 【CNMP系列】PHP配置和调优
- R语言学习总结---数据操作
- could not execute query; SQL [select count(*) as col_0_0_ from order order0_]; nested exception is o
- Dungeon Master
- 【CNMP系列】CentOS7.0下安装PHP5.6.30服务
- KAFKA 编程
- 洛谷oj 1030 水水水
- C语言快速计算出一个无符号数一共有多少个“”1”位数的方法
- leetcode-33. Search in Rotated Sorted Array
- Cannot resolve com.mysq.jdbc.Connection.ping method. Will use 'SELECT 1' instead.
- CSS3的动画效果@keyframes
- map的用法