zoukankan      html  css  js  c++  java
  • POJ 2251, Dungeon Master

    Time Limit: 1000MS  Memory Limit: 65536K
    Total Submissions: 5685  Accepted: 2256


    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
    Ulm Local 1997


    // POJ2251.cpp : Defines the entry point for the console application.
    //

    #include 
    <iostream>
    #include 
    <queue>
    using namespace std;
    struct Point
    {
        
    int x,y,z;
    };
    int main(int argc, char* argv[])
    {
        
    char c[31][31][31];
        
    int cube[31][31][31];
        
    int L,R,C;
        
    int step[6][3= {-1,0,01,0,00,-1,00,1,00,0,-10,0,1};

        
    while(scanf("%d %d %d\n",&L, &R, &C) && L!= 0 && R!= 0 && C!= 0)
        {
            Point pt;
            
    for (int i = 0; i < L; ++i)
                
    for (int j = 0; j <= R; ++j)
                    gets(c[i][j]);

            
    for (int i = 0; i < L; ++i)
                
    for (int j = 0; j < R; ++j)
                    
    for (int k = 0; k < C; ++k)
                    {
                        
    if (c[i][j][k] == 'S')
                        {
                            pt.x 
    = k;
                            pt.y 
    = j;
                            pt.z 
    = i;
                            cube[i][j][k] 
    = 0;
                        }
                        
    else if (c[i][j][k] == '.') cube[i][j][k] = 0;
                        
    else if (c[i][j][k] == '#') cube[i][j][k] = -1;
                        
    else if (c[i][j][k] == 'E') cube[i][j][k] = -2;
                    };

            queue
    <Point> q;
            q.push(pt);

            
    int cnt = -1;
            
    while (!q.empty())
            {
                Point p 
    = q.front();
                q.pop();
                
    for (int i = 0; i < 6++i)
                {
                    Point next;
                    next.x 
    = p.x + step[i][0];
                    next.y 
    = p.y + step[i][1];
                    next.z 
    = p.z + step[i][2];
                    
    if (next.x >= 0 && next.x < C && next.y >= 0 && next.y < R && next.z >= 0 && next.z < L)
                    {
                        
    if (cube[next.z][next.y][next.x] == 0)
                        {
                            cube[next.z][next.y][next.x] 
    = cube[p.z][p.y][p.x] + 1;
                            q.push(next);
                        }
                        
    else if (cube[next.z][next.y][next.x] == -2)
                        {
                            cnt 
    = cube[p.z][p.y][p.x] + 1;
                            
    break;
                        }
                    }
                }

                
    if (cnt != -1break;
            };

            
    if (cnt == -1) cout <<"Trapped!\n";
            
    else cout << "Escaped in "<<cnt<<" minute(s).\n";
        };
        
    return 0;
    }
  • 相关阅读:
    PHP 创建二叉树镜像(交换左右子树)
    PHP 使用二叉树的先序和中序遍历结果构造二叉树
    PHP 不用求1+2+…+n,要求不能使用乘除法、for、while、if、else、switch、case等关键字以及条件判断语句(A?B:C)
    PHP 不用加减乘除做加法
    PHP 跳台阶问题
    PHP 输入一个整数,求该整数的二进制表达中有多少个1
    PHP 输入两个整数n 和m,从数列1,2,3.......n 中随意取几个数, 使其和等于m ,要求将其中所有的可能组合列出来
    PHP 查找链表倒数第i个节点
    .Net/C# 实现: FlashFXP 地址簿中站点密码的加解密算法
    johnsuna 的收藏精品
  • 原文地址:https://www.cnblogs.com/asuran/p/1580199.html
Copyright © 2011-2022 走看看