Dungeon Master<poj2251>
来源:互联网 发布:安卓软件推荐 编辑:程序博客网 时间:2024/06/03 04:46
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
#include<cstdio>#include<cstring>#include<queue>using namespace std;char map[40][40][40];int vis[40][40][40];struct node {int ceng,hang,lie;int step;};int main(){int l,n,m;while(scanf("%d%d%d",&l,&n,&m)!=EOF){if(l==0&&n==0&&m==0)break;memset(vis,0,sizeof(vis));struct node start;for(int i=0;i<l;i++){for(int j=0;j<n;j++){scanf("%s",&map[i][j]);for(int k=0;k<m;k++){if(map[i][j][k]=='S'){start.ceng =i;start.hang =j;start.lie =k;start.step =0;vis[i][j][k]=1;}}}} queue<node>bfs;bfs.push (start);int flog=0;while(!bfs.empty ()){ structnode tmp=bfs.front ();bfs.pop ();if(map[tmp.ceng ][tmp.hang ][tmp.lie ]=='E'){flog=1;printf("Escaped in %d minute(s).\n",tmp.step);break;}tmp.step ++; struct node tmp2; if(tmp.ceng +1<l) { tmp2=tmp; tmp2.ceng ++; if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0){vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;bfs.push (tmp2);} } if(tmp.ceng -1>=0) { tmp2=tmp; tmp2.ceng--; if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0){vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;bfs.push (tmp2);} } if(tmp.hang +1<n) { tmp2=tmp; tmp2.hang ++; if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0){vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;bfs.push (tmp2);} } if(tmp.hang -1>=0) { tmp2=tmp; tmp2.hang --; if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0){vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;bfs.push (tmp2);} } if(tmp.lie +1<m) { tmp2=tmp; tmp2.lie ++; if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0){vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;bfs.push(tmp2);} } if(tmp.lie -1>=0) { tmp2=tmp; tmp2.lie --; if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0){vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;bfs.push (tmp2);} }}if(flog==0)printf("Trapped!\n");}return 0;}
1 0
- POJ2251 Dungeon Master
- POJ2251 Dungeon Master
- poj2251 Dungeon Master (BFS)
- poj2251 - Dungeon Master
- poj2251 Dungeon Master
- POJ2251:Dungeon Master
- Dungeon Master(poj2251,bfs)
- Dungeon Master(poj2251)
- poj2251 Dungeon Master
- POJ2251:Dungeon Master(BFS)
- poj2251 Dungeon Master bfs
- POJ2251:Dungeon Master(BFS)
- poj2251 Dungeon Master(BFS)
- POJ2251 Dungeon Master BFS
- poj2251 Dungeon Master
- POJ2251---Dungeon Master
- [bfs]poj2251 Dungeon Master
- POJ2251----Dungeon Master
- Redis 客户端连接
- Markdown 语法指南
- 文字十六进制转换
- [Ruby]Struct 结构体的使用
- webworker 探秘
- Dungeon Master<poj2251>
- Shiro简单使用
- 华为OJ 初级:整形数组合并
- PHP中获取当前页面的完整URL
- Redis 性能测试
- 矢量表示及其计算
- 7/28 CodeForces Div2
- jetty启动java.lang.Class.isAssignableFrom(Native Method)错误
- 如何将一个新函数加到MATLAB函数库中