ACM刷题之POJ————Dungeon Master
来源:互联网 发布:下载99宿舍客服软件 编辑:程序博客网 时间:2024/06/02 06:09
Dungeon Master
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30841 Accepted: 11947
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!
y一道简单的3D的BFS题目
注意题目中的S和E的位置是不确定的
用三维数组记录地图,同时Vis跟上就好
下面是ac代码
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<algorithm>#include<map>#include<set>#include<queue>#include<string>#include<iostream>using namespace std;#define MID(x,y) ((x+y)>>1)#define CLR(arr,val) memset(arr,val,sizeof(arr))#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);const double PI = acos(-1.0);const int INF = 0x3f3f3f3f;const int N=2e5+7;struct bs{int x,y,l,bu;};int l,r,c;bs fir;char maps[100][100][100];int vis[100][100][100];void bfs(bs a){queue<bs>q;bs temp1,temp2;q.push(a);while(!q.empty()){temp1=q.front();//printf("%d %d %d\n",temp1.l,temp1.x,temp1.y);if(maps[temp1.l][temp1.x][temp1.y]=='E'){break;}q.pop();//++temp1.bu;temp2=temp1;++temp2.x;if(temp2.x<r&&vis[temp2.l][temp2.x][temp2.y]==0&&maps[temp2.l][temp2.x][temp2.y]!='#'){++temp2.bu;q.push(temp2);vis[temp2.l][temp2.x][temp2.y]=1;}temp2=temp1;++temp2.y;if(temp2.y<c&&vis[temp2.l][temp2.x][temp2.y]==0&&maps[temp2.l][temp2.x][temp2.y]!='#'){++temp2.bu;q.push(temp2);vis[temp2.l][temp2.x][temp2.y]=1;}temp2=temp1;++temp2.l;if(temp2.l<l&&vis[temp2.l][temp2.x][temp2.y]==0&&maps[temp2.l][temp2.x][temp2.y]!='#'){++temp2.bu;q.push(temp2);vis[temp2.l][temp2.x][temp2.y]=1;}temp2=temp1;--temp2.x;if(temp2.x>=0&&vis[temp2.l][temp2.x][temp2.y]==0&&maps[temp2.l][temp2.x][temp2.y]!='#'){++temp2.bu;q.push(temp2);vis[temp2.l][temp2.x][temp2.y]=1;}temp2=temp1;--temp2.y;if(temp2.y>=0&&vis[temp2.l][temp2.x][temp2.y]==0&&maps[temp2.l][temp2.x][temp2.y]!='#'){++temp2.bu;q.push(temp2);vis[temp2.l][temp2.x][temp2.y]=1;}temp2=temp1;--temp2.l;if(temp2.l>=0&&vis[temp2.l][temp2.x][temp2.y]==0&&maps[temp2.l][temp2.x][temp2.y]!='#'){++temp2.bu;q.push(temp2);vis[temp2.l][temp2.x][temp2.y]=1;}}if(temp1.bu==0){printf("Trapped!\n");}else{printf("Escaped in %d minute(s).\n",temp1.bu);}}int main(){//freopen("f:/input.txt", "r", stdin);int fx,fy,fl,f;while(scanf("%d%d%d",&l,&r,&c)!=EOF&&l&&r&&c){CLR(vis,0);f=0;for(int i=0;i<l;i++){getchar();for(int j=0;j<r;j++){scanf("%s",maps[i][j]);for(int x=0;x<c&&f==0;x++)if(maps[i][j][x]=='S'){fir.x=j;fir.y=x;fir.l=i;fir.bu=0;f=1;break;}}}getchar();vis[fir.l][fir.x][fir.y]=1;bfs(fir);}}
0 0
- ACM刷题之POJ————Dungeon Master
- POJ 2251 ——Dungeon Master
- POJ——2251 Dungeon Master
- POJ2251——Dungeon Master
- POJ2251——Dungeon Master
- poj2251——Dungeon Master
- POJ——2251Dungeon Master(三维BFS)
- poj 2251 — Dungeon Master (3D + BFS)
- 【hdu2251】Dungeon Master——bfs
- poj2251——Dungeon Master(BFS)
- POJ2251 Dungeon Master —— BFS
- uva 532 Dungeon Master —— BFS(求最短路)
- 【搜索】— 广搜队列 noi openjudge 2.5 Dungeon Master
- poj 2251 Dungeon Master 【bfs基础题】
- POJ 2251 Dungeon Master 搜索入门题
- poj 2251 Dungeon Master
- poj 2251 Dungeon Master
- poj 2251 Dungeon Master
- [BZOJ4173]数学(数论)
- [Aha]火柴棍等式
- Java程序员新手老手都离不开八大开发工具
- Mac 升级node
- 全选反选,查询时全选反选bug
- ACM刷题之POJ————Dungeon Master
- 下拉刷新异常闪动
- Mars.Miner.v1.2.0-OUTLAWS
- 基于Dragonbaord 410c的家庭智能环保卫士——(1)预研
- inline解析
- SuperMap iServer常见问题解答集锦(十四)
- tail -f 和 tail -F的区别
- ueditor1.4.3使用
- hibernate的一级缓存与二级缓存