奥门永利误乐域poj2251 Dungeon Master

poj2251 Dungeon Master

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).
Trapped!

记得之前是看题解才做出来的,今天又做了一遍,1A,果然题目多做是有好处的。这道题是三维的,其实就是在二维的基础上加了z轴,所以用bfs的时候用6个方向。


#include
#include
int x2,y2,z2,x3,y3,z3;
char map[40][40][40];
int b[40][40][40];
int tab[8][3]={1,0,0, -1,0,0, 0,0,1, 0,-1,0, 0,0,-1, 0,1,0},num,flag,m,n,l;
int q[1111111][3];
void bfs()
{
 memset(q,0,sizeof(q));
 memset(b,0,sizeof(b));
 int front=1,rear=1,i,j,x,y,z,xx,yy,zz;
    q[front][0]=z2;q[front][1]=x2;q[front][2]=y2;
    b[z2][x2][y2]=0;
 while(front<=rear)
 {
  z=q[front][0];x=q[front][1];y=q[front][2];
  if(x==x3 && y==y3 && z==z3) return;
  front++;
  for(i=0;i<6;i++){
    xx=x+tab[i][1];yy=y+tab[i][2];zz=z+tab[i][0];
    if(xx>=0 && xx=0 && yy=0 && zz

http://www.bkjia.com/cjjc/993887.htmlwww.bkjia.comtruehttp://www.bkjia.com/cjjc/993887.htmlTechArticlepoj2251 Dungeon Master 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…

发表评论

电子邮件地址不会被公开。 必填项已用*标注