POJ 2251 Dungeon Master
来源:互联网 发布:2016年流行网络歌曲 编辑:程序博客网 时间:2024/06/07 03:54
Dungeon Master
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 32421 Accepted: 12431
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<queue>#include<algorithm>using namespace std;char map[35][35][35];int vis[35][35][35];int k,n,m,sx,sy,sz,ex,ey,ez;int dx[6]={-1,1,0,0,0,0};int dy[6]={0,0,-1,1,0,0};int dz[6]={0,0,0,0,1,-1};struct node{ int x,y,z,step;};int check(int x,int y,int z){ if(x<0||y<0||z<0||x>=k||y>=n||z>=m||map[x][y][z]=='#'||vis[x][y][z]) return 1; return 0;}int bfs(){ node a,next; queue<node> Q; a.x=sx; a.y=sy; a.z=sz; a.step=0; vis[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+dx[i]; next.y=a.y+dy[i]; next.z = a.z+dz[i]; if(check(next.x,next.y,next.z)) continue; vis[next.x][next.y][next.z]=1; next.step=a.step+1; Q.push(next); } } return 0;}int main(){ while(scanf("%d%d%d",&k,&n,&m),n+m+k) { for(int i=0;i<k;++i) { for(int j=0;j<n;++j) { scanf("%s",map[i][j]); for(int r=0;r<m;++r) { if(map[i][j][r]=='S') { sx=i; sy=j; sz=r; } else if(map[i][j][r]=='E') { ex=i; ey=j; ez=r; } } } } memset(vis,0,sizeof(vis)); int ans; ans=bfs(); if(ans) printf("Escaped in %d minute(s).\n",ans); else printf("Trapped!\n"); } 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
- 蓝桥杯数独(第五届蓝桥杯JavaB组第六题)
- SharedPreferences的工具类,调用setParam就能保存String, Integer, Boolean, Float, Long类型的参数 同样调用getParam就能获取相应的值
- 枚举可能的组合泛型实现
- 【动态规划】【贪心】动态规划与贪心的联系
- JAVA基础知识整理(六) ---JVM
- POJ 2251 Dungeon Master
- memcached在centos安装步骤
- HashMap 详解
- ./和../以及/之间的区别
- RESTful 手册
- malloc
- 图—定义与表示
- Vim基础配置
- Memcached的特点