zoukankan      html  css  js  c++  java
  • Poj2251--Dungeon Master(BFS)

    Dungeon Master
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 21008   Accepted: 8159

    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!
    

    Source

     
    re: 三维数组, 理解题意就好, 做法和二维一样;
     1 #include <queue>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <iostream>
     5 using namespace std;
     6 int ac[6][3] = {-1, 0, 0, 1, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, -1, 0, 0, 1};          //上, 下, 左, 右, 前, 后;
     7 char map[35][35][35]; int vis[35][35][35];
     8 int l, m, n; 
     9 
    10 struct small
    11 {
    12     int x, y, z, step;
    13 } s, r, p, g;
    14 
    15 
    16 int Bfs(int a, int b, int c)
    17 {
    18     memset(vis, 0, sizeof(vis));
    19     queue<small> q;
    20     s.x = a; s.y = b; s.z = c; s.step = 0;
    21     vis[s.x][s.y][s.z] = 1;
    22     q.push(s);
    23     while(!q.empty())
    24     {
    25         r = q.front();
    26         q.pop();
    27         for(int i = 0; i < 6; i++)
    28         {
    29             p.x = r.x + ac[i][0];
    30             p.y = r.y + ac[i][1];
    31             p.z = r.z + ac[i][2];
    32             if(p.x >= 0 && p.x < l && p.y >= 0 && p.y < m && p.z >= 0 && p.z < n && !vis[p.x][p.y][p.z] && map[p.x][p.y][p.z] != '#')
    33             {
    34                 vis[p.x][p.y][p.z] = 1;
    35                 if(map[p.x][p.y][p.z] == 'E')
    36                     return r.step + 1;    
    37                 else 
    38                     p.step = r.step + 1;
    39                 q.push(p);
    40             } 
    41         } 
    42     }
    43     return -1;
    44 } 
    45 
    46 int main()
    47 {
    48     while(~scanf("%d %d %d", &l, &m, &n))
    49     {
    50         if(l == 0 && n == 0 && m == 0)
    51             break;
    52         int i, j, k, x, y, z; 
    53         for(i = 0; i < l; i++)
    54         {
    55             for(j = 0; j < m; j++)
    56             {
    57                 //getchar();
    58                 for(k = 0; k < n; k++)
    59                 {
    60                     cin >> map[i][j][k];
    61                     //scanf("%c", &map[i][j][k]);
    62                     if(map[i][j][k] == 'S')
    63                     {
    64                         x = i; y = j; z = k;
    65                     }
    66                 }    
    67             }
    68         }
    69         int temp = Bfs(x, y, z);
    70         if(temp == -1)
    71             printf("Trapped!
    ");
    72         else
    73             printf("Escaped in %d minute(s).
    ", temp);
    74     }
    75 } 
  • 相关阅读:
    step_by_step_ABP规约模式
    阅读书单
    关于我
    友情链接
    数据夜话之大数据OLAP数据库概览
    Spark实战
    StormDRPC流程解读
    Curator源码阅读
    Storm使用总结
    JNI相关使用记录
  • 原文地址:https://www.cnblogs.com/soTired/p/4717288.html
Copyright © 2011-2022 走看看