zoukankan      html  css  js  c++  java
  • [kuangbin带你飞]专题一 简单搜索 bfs B

    B - Dungeon Master

    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!

    bfs模版题,三维bfs
     1 #include<iostream>
     2 #include<string.h>
     3 #include<queue>
     4 
     5 using namespace std;
     6 
     7 int l,r,c,di,dj,dk,escape,ans,si,sj,sk;
     8 char mapp[35][35][35];
     9 int flag[35][35][35];
    10 int dir[6][3]={{0,0,1},{0,1,0},{0,0,-1},{0,-1,0},{1,0,0},{-1,0,0}};
    11 
    12 struct node
    13 {
    14     int x,y,z;
    15     int step;
    16 };
    17 node qi,zhong;
    18 bool judge(int x,int y,int z)
    19 {
    20     if(x>=0 && x<l && y>=0 && y<r && z>=0 && z<c && !flag[x][y][z] && mapp[x][y][z]!='#')
    21         return true;
    22     return false;
    23 }
    24 void bfs()
    25 {
    26     queue<node>que;
    27     que.push(qi);
    28     node a,b;
    29     while(!que.empty())
    30     {
    31         a = que.front();
    32         que.pop();
    33         
    34         if(a.x==zhong.x && a.y==zhong.y && a.z==zhong.z)
    35         {
    36             cout<<"Escaped in "<<a.step<<" minute(s)."<<endl;
    37             return ;
    38         }
    39         for(int i = 0; i < 6; i++)
    40         {
    41             b=a;
    42             b.x+=dir[i][0];
    43             b.y+=dir[i][1];
    44             b.z+=dir[i][2];
    45             if(judge(b.x,b.y,b.z))
    46             {
    47                 flag[b.x][b.y][b.z]=1;
    48                 b.step++;
    49                 que.push(b);
    50             }
    51         }
    52     }
    53     cout<<"Trapped!"<<endl;
    54 }
    55 int main()
    56 {
    57     while(cin>>l>>r>>c,l||r||c)
    58     {
    59         memset(flag,0,sizeof(flag));
    60         for(int i = 0; i < l; i++)
    61         {
    62             for(int j = 0; j < r; j++)
    63             {
    64                 cin>>mapp[i][j];
    65                 for(int k = 0; k < c; k++)
    66                 {
    67                     if(mapp[i][j][k]=='S')
    68                         qi.x=i,qi.y=j,qi.z=k,qi.step=0;
    69                     if(mapp[i][j][k]=='E')
    70                         zhong.x=i,zhong.y=j,zhong.z=k;
    71                 }
    72             }
    73         }
    74         bfs();
    75         
    76     }
    77     
    78     return 0;
    79 }


  • 相关阅读:
    asp.net 页面定时跳转的小技巧
    获得 Windows phone 设备的信息
    如何自定义ToggleSwitch控件样式(转)
    云推送注意(MSDN链接)
    回顾:线程和进程的区别
    WebGL
    13种提升基于MVVM模式的WP7程序性能的方法(转)
    sample_code
    网址收藏
    Net中de日期格式
  • 原文地址:https://www.cnblogs.com/Xycdada/p/6724510.html
Copyright © 2011-2022 走看看