poj2251 Dungeon Master (BFS)

题　意：给定一三维迷宫的起始位置和终止位置，如果能走出，求出所用最少时间（可以理解为迷宫中的最短路径），否则输　　　　　　出Trapped！

思　路：BFS，六个方向

学习点：BFS

注意点：1、输入(由于输入有空格，所以要特殊处理，一开始没考虑到，结果怎么都出不来)；

　　　　2、六个方向怎么对应要搞清楚；

　　　　3、输出的时候“Trapped！”（一开始竟然因为少一个“！”，wa）。

源代码：#include <stdio.h>#include <string.h>#define MAXN 31typedef struct {int x, y, z;}nDate;nDate nArr[MAXN * MAXN * MAXN];int dx[6]={0, 0, 0, 0, 1, -1};int dy[6]={1, -1, 0, 0, 0, 0};int dz[6]={0, 0, 1, -1, 0, 0};int nLevel, nRow, nCol;int nMap[MAXN][MAXN][MAXN];int vis[MAXN][MAXN][MAXN];int nCost[MAXN][MAXN][MAXN];int nQ[MAXN * MAXN * MAXN];int nFlag, fL, fR, fC, tL, tR, tC;void funcInput();void funcSolve();void funcOutput();int main(){while (3 == scanf("%d %d %d", &nLevel, &nRow, &nCol)){if (!nLevel && !nRow && !nCol) break;funcInput();funcSolve();funcOutput();}return 0;}void funcInput(){char ch;int i, j, k;for (i = 0; i != nLevel; ++i){for (j = 0; j != nRow; ++j){for (k = 0; k != nCol; ++k){vis[i][j][k] = 0;nCost[i][j][k] = 0;scanf(" %c", &ch);if (ch == '.') nMap[i][j][k] = 1;else if (ch == '#') nMap[i][j][k] = 0;else if (ch == 'S'){fL = i; fR = j; fC = k;nMap[i][j][k] = 1;}else {nMap[i][j][k] = 1;tL = i; tR = j; tC = k;}}}getchar();}}void funcSolve(){int i;int _l, _r, _c, l, r, c;int nIndex = 0;int rear = 0, front = 0;vis[fL][fR][fC] = 1;nArr[0].x = fL; nArr[0].y = fR; nArr[0].z = fC;nQ[rear++] = nIndex;nIndex++;nFlag = 0;while (front != rear){int u = nQ[front++];_l = nArr[u].x; _r = nArr[u].y; _c = nArr[u].z;for (i = 0; i != 6; ++i){l = _l + dz[i], r = _r + dx[i]; c = _c + dy[i];if (l >= 0 && l < nLevel && c >= 0 && c < nCol && r >= 0 && r < nRow&& !vis[l][r][c] && nMap[l][r][c]){vis[l][r][c] = 1;nCost[l][r][c] = nCost[_l][_r][_c] + 1;if (l == tL && r == tR && c == tC){nFlag = 1;goto nEnd;}nQ[rear++] = nIndex;nArr[nIndex].x = l; nArr[nIndex].y = r; nArr[nIndex].z = c;nIndex ++;}}}nEnd:; }void funcOutput(){if (nFlag) printf("Escaped in %d minute(s)./n", nCost[tL][tR][tC]);else printf("Trapped!/n");}