3D dungeon

時間限制：1000?ms ?|? 內存限制：65535?KB 難度：2 輸入

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.

輸出

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!

樣例輸入

3 4 5 S.... .###. .##.. ###.###### ##### ##.## ##...##### ##### #.### ####E1 3 3 S## #E# ###0 0 0

樣例輸出

Escaped in 11 minute(s). Trapped!

題目大意是：以S為起點，問你能否逃出三維牢房（到達E即為逃出），能則輸出最短時間，每次只能上下前后左右移動一個位置，移動一個次用時1.

BFS即可AC

AC代碼:

#include <stdio.h> char map[31][31][31], mark[31][31][31]; int i, j, k, L, R, C, Z, Y, X, b[30000][4]; int next[6][3]= {{0,0,-1},{0,1,0},{0,0,1},{0,-1,0},{-1,0,0},{1,0,0}}; int bfs() {k = 0, j = 1, b[0][3] = 0;int z,y,x;while(k < j) {z = b[k][0], y = b[k][1], x = b[k][2];for(int p = 0; p < 6; p++) {Z = z+next[p][0];Y = y+next[p][1];X = x+next[p][2];if(Z>=0&&Y>=0&&X>=0&&Z<L&&Y<R&&X<C) {if(map[Z][Y][X]=='.'&&mark[Z][Y][X]==0) {mark[Z][Y][X] = 1;b[j][0] = Z;b[j][1] = Y;b[j][2] = X;b[j++][3] = b[k][3]+1;} else if(map[Z][Y][X]=='E') return b[k][3]+1;}}k++;}return 0; } int main() {while(scanf("%d %d %d", &L, &R, &C) && (L||R||C)) {for(i = 0; i < L; i++) {for(j = 0; j < R; j++) {for(k = 0; k < C; k++) {scanf(" %c", &map[i][j][k]);mark[i][j][k] = 0;if(map[i][j][k] == 'S') {b[0][0] = i;b[0][1] = j;b[0][2] = k;mark[i][j][k] = 1;}}}}i = bfs();if(i) printf("Escaped in %d minute(s).\n", i);else printf("Trapped!\n");}return 0; }

總結

以上是生活随笔為你收集整理的nyoj3533D dungeon的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。