鏈接：

http://poj.org/problem?id=2251

?

Time Limit:?1000MS	?	Memory Limit:?65536K
Total Submissions:?21370	?	Accepted:?8299

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.... .###. .##.. ###.###### ##### ##.## ##...##### ##### #.### ####E1 3 3 S## #E# ###0 0 0

Sample Output

Escaped in 11 minute(s). Trapped!

?

代碼：

#include <iostream> #include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm> #include <queue>using namespace std;#define N 35struct node {int x, y, z, step; };char Map[N][N][N]; node e; int L, R, C; int dir[6][3]={{0,0,-1},{0,0,1},{0,-1,0},{0,1,0},{-1,0,0},{1,0,0}};bool Judge(node s) {return s.x>=0 && s.x<L && s.y>=0 && s.y<R && s.z>=0 && s.z<C && Map[s.x][s.y][s.z]!='#'; }int BFS(node s) {node p;queue<node>Q;Q.push(s);while(Q.size()){s = Q.front(), Q.pop();if(s.x==e.x && s.y==e.y && s.z==e.z) return s.step;for(int i=0; i<6; i++){p.x = s.x + dir[i][0];p.y = s.y + dir[i][1];p.z = s.z + dir[i][2];p.step = s.step + 1;if(Judge(p)){Q.push(p);Map[p.x][p.y][p.z] = '#';}}}return -1; }int main() {while(scanf("%d%d%d", &L, &R, &C), L+R+C){node s;memset(Map, 0, sizeof(Map));for(int i=0; i<L; i++)for(int j=0; j<R; j++){scanf("%s", Map[i][j]);for(int k=0; k<C; k++){if(Map[i][j][k]=='S')s.x=i, s.y=j, s.z=k, s.step=0;if(Map[i][j][k]=='E')e.x=i, e.y = j, e.z=k;}}int ans = BFS(s);if(ans==-1)printf("Trapped!\n");elseprintf("Escaped in %d minute(s).\n", ans);}return 0; }

?

轉載于:https://www.cnblogs.com/YY56/p/4782854.html

總結

以上是生活随笔為你收集整理的（广搜）Dungeon Master -- poj -- 2251的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。