Dungeon Master poj 2251
来源:互联网 发布:matlab转c语言工具 编辑:程序博客网 时间:2024/06/07 09:51
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?
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).
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<cstdio>#include<cstring>#include<cmath>#include<queue>#include<iostream>using namespace std; int dx[6] = {0,0,-1,1,0,0};int dy[6] = {0,0,0,0,1,-1};int dz[6] = {1,-1,0,0,0,0}; char Map[40][40][40];int vis[40][40][40], L, R, C; struct node{ int x, y, z; int time;}st, ed;queue<node> q; bool check(int x, int y, int z) { if(x >= 1 && x <= L && y >= 1 && y <= R && z >= 1 && z <= C) return true; return false;} int BFS(){ int x, y, z, t, i; while(!q.empty()) { node tmp = q.front(); q.pop(); x = tmp.x; y = tmp.y; z = tmp.z; t = tmp.time; for(i = 0; i < 6; i++) { int nx = x + dx[i]; int ny = y + dy[i]; int nz = z + dz[i]; if(!vis[nx][ny][nz] && Map[nx][ny][nz] != '#' && check(nx,ny,nz)) { if(nx == ed.x && ny == ed.y && nz == ed.z) return t+1; vis[nx][ny][nz] = 1; node temp; temp.x = nx; temp.y = ny; temp.z = nz; temp.time = t + 1; q.push(temp); } } } return -1;} int main(){ while(~scanf("%d%d%d",&L, &R, &C) && (L + R + C)) { memset(vis,0,sizeof(vis)); int i, j, k; for(i = 1; i <= L; i++) { for(j = 1; j <= R; j++) { for(k = 1; k <= C; k++) { cin>>Map[i][j][k]; if(Map[i][j][k] == 'S') { st.x = i, st.y = j, st.z = k;st.time = 0; q.push(st); vis[i][j][k] = 1; } else if(Map[i][j][k] == 'E') ed.x = i, ed.y = j, ed.z = k; } } } int ans = BFS(); if(ans == -1) printf("Trapped!\n"); else printf("Escaped in %d minute(s).\n",ans); while(!q.empty()) q.pop(); } return 0;}
0 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 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
- POJ-2251-Dungeon Master
- poj 2251 Dungeon Master
- js获取上传控件选中的文件扩展名
- Git简介
- Mike and Feet(单调栈)
- 98.Which two statements are true regarding the usage of the SQL*Loader utility? (Choose two.)
- ccnu_2016_summer_week1(2)_贪心
- Dungeon Master poj 2251
- Java的方法
- # mysql CREATE TABLE IF NOT EXISTS metadata lock坑
- 【Java】Servlet调用流程
- RecyclerView技术栈
- 反编译 jadx进行安卓反编译
- Git的诞生
- tcp连接的建立(三次握手)和释放(四次握手)
- listview的item内部有Button问题