POJ 2251 ——Dungeon Master
来源:互联网 发布:智慧树网络课 编辑:程序博客网 时间:2024/06/07 17:52
题目:http://poj.org/problem?id=2251
/**** 广度搜索 ******** 队列实现 **** 注意访问标记 **/
题目大意: 最短时间内逃出牢笼
Dungeon Master
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13024 Accepted: 5044
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!#include <iostream>#include <cstdio>#include <queue>#include <cstring>using namespace std;class point{public: int l , r , c ;};int l , r , c ;char dungeon[50][50][50];int visit[50][50][50];int b_l , b_r , b_c , e_l , e_r , e_c ;void bfs(){ int direct[6][3] = {{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}}; queue<point> Q ; point push , temp ; visit[b_l][b_r][b_c] = 0; push.l = b_l ; push.r = b_r ; push.c = b_c ; Q.push(push) ; while(!Q.empty()) { temp = Q.front(); if(temp.l == e_l && temp.r == e_r && temp.c == e_c) return ; for(int i = 0; i < 6; i ++) { push.l = temp.l + direct[i][0] ; push.r = temp.r + direct[i][1] ; push.c = temp.c + direct[i][2] ; if(dungeon[push.l][push.r][push.c] == '.' && visit[push.l][push.r][push.c] == -1) { visit[push.l][push.r][push.c] = visit[temp.l][temp.r][temp.c] + 1; Q.push(push) ; } } Q.pop(); }}int main(){ freopen("in.txt","r",stdin); int i , j , k ; while(1) { cin>>l>>r>>c; if(!l && !r && !c) break ; memset(dungeon,'#',sizeof(dungeon)); memset(visit,-1,sizeof(visit)); for(i = 1; i <= l; i++) for(j = 1; j <= r; j++) for(k = 1; k <= c; k++) { cin>>dungeon[i][j][k]; if(dungeon[i][j][k] == 'S') { b_l = i ; b_r = j ; b_c = k ; } if(dungeon[i][j][k] == 'E') { e_l = i ; e_r = j ; e_c = k ; dungeon[i][j][k] = '.' ; } } bfs(); if(visit[e_l][e_r][e_c] != -1) cout<<"Escaped in "<<visit[e_l][e_r][e_c]<<" minute(s)."<<endl; else cout<<"Trapped!"<<endl; } return 0;}
- 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 2251 Dungeon Master
- POJ-2251-Dungeon Master
- POJ 2251Dungeon 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
- bigendian to littleendian
- WINCE6.0 下的应用程序开机启动
- c/c++内存释放知识总结
- 我的第一个网站
- 详解大端模式和小端模式
- POJ 2251 ——Dungeon Master
- SQLite 创建与打开
- Setting up Mercurial on Mac
- 指针自身的地址、指针保存的地址和指针保存地址处的内容,为什么使用指针
- 3.跟我一起学建站之hibernate Helloworld xml版
- MVFM框架----模块间最大化解耦之广播监听模式
- UIPageControl 分页控件-IOS开发
- 敏捷开发实践初体验
- Fragment 实例(1234)