B - Dungeon Master (POJ 2251) (简单bfs+三维空间)

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!
#include<bits/stdc++.h>
using namespace std;
struct node
{
    int x,y,z;
    int cnt;
};
char Map[35][35][35];
int visit[35][35][35];
int dir[6][3]={{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}};
int l,r,c;
int x1,y1,z1;
void bfs()
{
    queue<node>Q;
    node t;
    t.x=x1,t.y=y1,t.z=z1,t.cnt=0;
    visit[x1][y1][z1]=1;
    Q.push(t);
    while(!Q.empty())
    {
        node res=Q.front();
        Q.pop();
        int xx=res.x;
        int yy=res.y;
        int zz=res.z;
        int cnt=res.cnt;
        if(Map[xx][yy][zz]=='E')
        {
            cout<<"Escaped in "<<cnt<<" minute(s)."<<endl;
            return ;
        }
        for(int i=0;i<6;i++)
        {
            node temp;
            int newx=temp.x=xx+dir[i][0];
            int newy=temp.y=yy+dir[i][1];
            int newz=temp.z=zz+dir[i][2];
            temp.cnt=cnt+1;
            if(newx<1||newx>l||newy<1||newy>r||newz<1||newz>c)
                continue;//边界判断
            if(Map[newx][newy][newz]!='#'&&!visit[newx][newy][newz])
            {
                visit[newx][newy][newz]=1;
                Q.push(temp);
            }
        }
    }
    cout<<"Trapped!"<<endl;
}
int main()
{
    while(cin>>l>>r>>c&&(l||r||c))
    {
        for(int i=1; i<=l; i++)
            for(int j=1; j<=r; j++)
                for(int k=1; k<=c; k++)
                {
                    cin>>Map[i][j][k];//用cin方便处理
                    if(Map[i][j][k]=='S')
                        x1=i,y1=j,z1=k;
                }
        memset(visit,0,sizeof(visit));
        bfs();
    }
    return 0;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_41061455/article/details/80344735
文章标签: bfs
个人分类: ACM之BFS专题
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭