Dungeon Master 三维搜索(bfs)
来源:互联网 发布:王菲现场知乎 编辑:程序博客网 时间:2024/05/21 06:20
点击打开链接
Problem 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). < br>L is the number of levels making up the dungeon. < br>R and C are the number of rows and columns making up the plan of each level. < br>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 < br><blockquote>Escaped in x minute(s). </blockquote>< br>where x is replaced by the shortest time it takes to escape. < br>If it is not possible to escape, print the line < br><blockquote>Trapped! </blockquote>
Sample Input
3 4 5S.....###..##..###.#############.####...###########.#######E1 3 3S###E####0 0 0
Sample Output
Escaped in 11 minute(s).Trapped!
#if 0#include<iostream>#include<cstring>#include<queue>using namespace std;int l,c,r,step[50][50][50],ei,ej,ek,si,sj,sk;char a[50][50][50];bool flag[50][50][50],flag1;int f[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};int ok(int k,int i, int j){if(k>=0&&k<l&&i>=0&&i<r&&k>=0&& k<c) return 1;elsereturn 0;}void bfs(int z,int x,int y){queue<int> q;q.push(z);q.push(x);q.push(y); while(!q.empty()) {int ai,aj,ak;ak=q.front();q.pop();ai=q.front();q.pop();aj=q.front();q.pop();if(ak==ek && ai==ei && aj==ej){cout<<step[ak][ai][aj]<<endl;flag1=1;return;}for(int i=0; i<6; i++) {intki=ak+f[i][0];int ii=ai+f[i][1];int ji=aj+f[i][2];if(ki==ek && ii==ei && ji==ej){cout<<"Escaped in "<<step[ak][ai][aj]+1<<" minute(s)."<<endl;flag1=1;return;} if(a[ki][ii][ji]=='.' && ok(ki,ii,ji) && flag[ki][ii][ji]==0){flag[ki][ii][ji]=1;q.push(ki);q.push(ii);q.push(ji);step[ki][ii][ji]=step[ak][ai][aj]+1;}}}}int main(){while(cin>>l>>r>>c && l+r+c){memset(step,0,sizeof(step));memset(a,0,sizeof(a));memset(flag,0,sizeof(flag));flag1=0,ek=0,ei=0,ej=0,si=sj=sk=0;for(int k=0; k<l; k++)for(int i=0; i<r; i++)for(int j=0; j<c; j++){cin>>a[k][i][j];if(a[k][i][j]=='S'){sk=k;si=i;sj=j;}if(a[k][i][j]=='E'){ek=k;ei=i;ej=j;} } flag[sk][si][sj]=1; bfs(sk,si,sj);if(flag1==0)cout<<"Trapped!"<<endl;}}#endif
阅读全文
0 0
- Dungeon Master 三维搜索(bfs)
- 三维搜索(bfs)Dungeon Master
- <三维BFS搜索> POJ 2251 Dungeon Master
- Dungeon Master 三维+BFS
- Dungeon Master 【三维BFS】
- poj2251--Dungeon Master(搜索练习3-三维bfs)
- POJ2251 Dungeon Master 三维BFS
- 三维BFS poj2251 Dungeon Master
- POJ2251-Dungeon Master (三维BFS)
- Dungeon Master 三维广度搜索
- POJ2251 Dungeon Master(搜索BFS)
- zju 1940 Dungeon Master(三维BFS暴搜题)
- POJ 2251 Dungeon Master (三维BFS)
- POJ 2251:Dungeon Master(三维BFS)
- POJ 2251 Dungeon Master (三维迷宫 BFS)
- POJ 2251 Dungeon Master(三维BFS)
- UVA Dungeon Master (三维BFS)
- UVA 532- Dungeon Master(三维bfs)
- [BZOJ 1059] 矩阵游戏 Hungary算法
- MySQL存储引擎MyISAM与InnoDB的优劣
- 蚂蚁变大象:浅谈常规网站是如何从小变大的
- SPOJ VLATTICE Visible Lattice Points(莫比乌斯反演入门)
- (2017多校训练第二场)HDU
- Dungeon Master 三维搜索(bfs)
- dbus windows上的使用
- oracle客户端安装与配置(包含windows和linux)
- 网页爬虫常用user-agent数组(适合各种语言使用)
- 开通博客,希望同各位大佬一起学习
- linux gpio子系统级联中断解析
- POJ2528 Mayor's posters(线段树区间更新,离散化)
- 堆排序
- PHP学习笔记