Dungeon Master
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
Sample Output
|
题意:3D地牢,S是起点,E是终点,能不能达到,达到的最短时间。
思路:对比二维,三维加了个上下方向,对六个方向bfs,同时记录地图的数组也要变成三维的。
#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
char ch[100][100][100];
int vist[100][100][100];
int dx[6] = {1, 0, -1, 0, 0, 0};
int dy[6] = {0, 1, 0, -1, 0, 0};
int dz[6] = {0, 0, 0, 0, 1, -1};
int sl, sr, sc, el, er, ec, R, C, L;
struct node {
int l, r, c, step; // l, r, c分别表示x,y,x轴坐标
};
bool Judge(int x, int y, int z) {
if(x>=0 && x<L && y>=0 && y<R && z>=0 && z<C) return true;
return false;
}
int bfs() {
node a, p;
a.l = sl, a.r = sr, a.c = sc, a.step = 0;
queue<node> que;
que.push(a);
while(!que.empty()) {
a = que.front();
if(a.l==el && a.r==er && a.c==ec)
return a.step;
que.pop();
for(int i = 0; i < 6; i++) { // 对六个方向搜索
p.l = a.l + dx[i];
p.r = a.r + dy[i];
p.c = a.c + dz[i];
if(Judge(p.l, p.r, p.c) && ch[p.l][p.r][p.c] != '#' && vist[p.l][p.r][p.c] == 0) {
vist[p.l][p.r][p.c] = 1;
p.step = a.step + 1;
que.push(p);
}
}
}
return 0;
}
int main()
{
while(~scanf("%d%d%d", &L, &R, &C) && (L+R+C) ) {
getchar();
for(int i = 0; i< L; i++) {
for(int j = 0; j < R; j++) {
for(int k =0; k < C; k++) {
scanf("%c", &ch[i][j][k]);
if(ch[i][j][k] == 'S') {
sl = i;
sr = j;
sc = k;
}else if(ch[i][j][k] == 'E') {
el = i;
er = j;
ec = k;
}
}
getchar();
}
if(i != L-1) getchar();
}
memset(vist, 0, sizeof(vist));
vist[sl][sr][sc] = 1;
int ans = bfs();
if(ans)
printf("Escaped in %d minute(s).\n", ans);
else
printf("Trapped!\n");
}
return 0;
}