POJ 2251--Dungeon Master

题目:


Dungeon Master
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 26827 Accepted: 10493

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!

题意:一个三维的地图,从S走到E点,求最短路,否则输出Trapped!。

思路:一个裸的最短路,只是要注意走的方向,走六个方向,前后左后以及上下,方向弄好的就不会出错了。


实现:

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <queue>
#include <math.h>
using namespace std;

const int MAX = 35;
const int INF = 100000000;
int l, r, c;

char _map[MAX][MAX][MAX];
int visit[MAX][MAX][MAX];//到某一点的最短路

int z[3] = {1, 0, -1};
int x[4] = {-1, 0, 1, 0};
int y[4] = {0, 1, 0, -1};

struct node {
    int z, x, y;
    int step;
    bool friend operator < (node n1, node n2) {
        return n1.step > n2.step;
    }
};

node s, e;
int ss;

bool bfs() {
    priority_queue <node>q;
    q.push(s);
    visit[s.z][s.x][s.y] = true;
    while(!q.empty()) {
        node head, tail;
        head = q.top();
        q.pop();
        //cout << "ok " << head.z << " " << head.x << " " << head.y << endl;
        if (head.z == e.z && head.x == e.x && head.y == e.y) {
            ss = head.step;
            return true;
        }
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 4; j++) {
                if (z[i] == 0) {
                    tail.z = head.z + z[i];
                    tail.x = head.x + x[j];
                    tail.y = head.y + y[j];
                }
                else {
                    tail.x = head.x;
                    tail.y = head.y;
                    tail.z = head.z + z[i];
                }
                if (tail.z >= 0 && tail.z < l && tail.x >= 0 && tail.x < r && tail.y >= 0
                    && tail.y < c && visit[tail.z][tail.x][tail.y] > head.step + 1) {
                    visit[tail.z][tail.x][tail.y] = head.step + 1;
                    tail.step = head.step + 1;
                    q.push(tail);
                }
            }
        }
    }
    return false;
}

int main() {
    while(scanf("%d%d%d", &l, &r, &c) != EOF) {
        if (l == 0 && r == 0 && c == 0)
            break;
        for (int i = 0; i < l; i++) {
            for (int j = 0; j < r; j++) {
                scanf("%s", _map[i][j]);
            }
        }
        for (int i = 0; i < l; i++) {
            for (int j = 0; j < r; j++) {
                for (int k = 0; k < c; k++) {
                    visit[i][j][k] = INF;
                    if (_map[i][j][k] == 'S') {
                        s.z = i;
                        s.x = j;
                        s.y = k;
                    }
                    else if (_map[i][j][k] == 'E') {
                        e.z = i;
                        e.x = j;
                        e.y = k;
                    }
                    else if (_map[i][j][k] == '#') {
                        visit[i][j][k] = true;
                    }
               }
            }
        }
        if (bfs()) {
            printf("Escaped in %d minute(s).\n", ss);
        }
        else
            printf("Trapped!\n");
    }
    return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值