POJ 2251(BFS)

看练习册上把这道题归到DFS，于是用了DFS，TLE，于是换用BFS，一次AC

#include <iostream>
#include <queue>
using namespace std;

const int MAX_LEN = 32;
const int INF = 0x3F3F3F3F;
char maze[MAX_LEN][MAX_LEN][MAX_LEN];
bool vis[MAX_LEN][MAX_LEN][MAX_LEN];
int direct[6][3] = {{0, 0, 1}, {0, 0, -1}, {0, 1, 0}, 
{0, -1, 0}, {1, 0, 0}, {-1, 0, 0}};
int L, R, C;
int min_step;

struct point
{
	int l, r, c;
	int step;
};

void init()  //初始化
{
	min_step = INF;
	for (int l = 0; l <= L+1; ++l){
		for (int r = 0; r <= R+1; ++r){
			for (int c = 0; c <= C+1; ++c){
				maze[l][r][c] = '#';
			}
		}
	}
}

void dfs(int l, int r, int c, int step)  //深度优先搜索(TLE)
{
	if (maze[l][r][c] == 'E'){
		min_step = step < min_step ? step : min_step;
		return;
	}
	vis[l][r][c] = true;
	int pl, pr, pc;
	for (int i = 0; i < 6; ++i){
		pl = l + direct[i][0];
		pr = r + direct[i][1];
		pc = c + direct[i][2];
		if (maze[pl][pr][pc] != '#' && vis[pl][pr][pc] == false){
			dfs(pl, pr, pc, step+1);
		}
	}
	vis[l][r][c] = false;
}

int bfs(int sl, int sr, int sc)  //宽度优先搜索(AC)
{
	memset(vis, 0, sizeof(vis));
	queue<point> Q;
	int pl, pr, pc, ps;
	point p;
	p.l = sl; p.r = sr; p.c = sc; p.step = 0;
	Q.push(p);
	vis[sl][sr][sc] = true;
	while (!Q.empty()){
		p = Q.front();
		Q.pop();
		if (maze[p.l][p.r][p.c] == 'E'){
			return p.step;
		}
		for (int i = 0; i < 6; ++i){
			pl = p.l + direct[i][0];
			pr = p.r + direct[i][1];
			pc = p.c + direct[i][2];
			ps = p.step + 1;
			if (maze[pl][pr][pc] != '#' && vis[pl][pr][pc] == false){
				point t;
				t.l = pl; t.r = pr; t.c = pc; t.step = ps;
				Q.push(t);
				vis[pl][pr][pc] = true;
			}
		}
	}
	return -1;
}

int main()
{
	int sl, sr, sc, l, r, c;
	while (scanf("%d%d%d", &L, &R, &C) && L != 0){
		init();
		for (l = 1; l <= L; ++l){
			for (r = 1; r <= R; ++r){
				for (c = 1; c <= C; ++c){
					cin>>maze[l][r][c];
					if (maze[l][r][c] == 'S'){
						sl = l; sr = r; sc = c;
					}
				}
			}
		}
// 		dfs(sl, sr, sc, 0);
// 		if (min_step == INF){
// 			printf("Trapped!\n");
// 		}
// 		else{
// 			printf("Escaped in %d minute(s).\n", min_step);
// 		}
		
		min_step = bfs(sl, sr, sc);
		if (min_step == -1){
			printf("Trapped!\n");
		}
		else{
			printf("Escaped in %d minute(s).\n", min_step);
		}
	}
}