B - Dungeon Master POJ - 2251

B - Dungeon Master POJ - 2251

题目： 逃离3D迷宫，n <=30

首先是dfs，算一下最坏情况共30层，每层有30*30的循环， 复杂度 30^30*30 显然严重爆炸，因为dfs会搜遍所有可能的路径才能找到最短路径
但是为了锻炼一下代码能力也写一下dfs

交了一发，一点意外也没有，TLE的一塌糊涂

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int L, R, C;
int ans, ex, ey, ez;
char mp[35][35][35]; // L, R, C, 
int vis[35][35][35];
int dx[] = {0,0,0,0,-1,1}; // 右下左上前后 
int dy[] = {1,0,-1,0,0,0};
int dz[] = {0,1,0,-1,0,0};

bool check(int x, int y, int z) {
	if(x < 0 || y < 0 || z < 0 || x >= R || y >= C || z >= L) return 0;
	if(vis[z][x][y]) return 0;
	if(mp[z][x][y] == '#') return 0;
	return 1;
}

void dfs(int sx, int sy, int sz, int step) {
	if(sx == ex && sy == ey && sz == ez) {
		ans = min(ans, step);
		return ;
	}
	int x, y, z;
	for(int k = 0; k < 6; k++) {
		x = sx+dx[k]; y = sy+dy[k]; z = sz+dz[k];
		if(check(x,y,z)) {
			vis[z][x][y] = 1;
			dfs(x,y,z,step+1);
			vis[z][x][y] = 0;
		}
	}
}

int main() {
	freopen("test.in", "r", stdin);
	while(~scanf("%d%d%d", &L, &R, &C) && L && R && C) {
		memset(vis, 0, sizeof(vis));
		int sx, sy, sz;
		ans = 1e5;
		for(int i = 0; i < L; i++) {
			for(int j = 0; j < R; j++) {
				scanf("%s", mp[i][j]);
				for(int k = 0; k < C; k++) {
					if(mp[i][j][k] == 'S') sx = j, sy = k, sz = i;
					if(mp[i][j][k] == 'E') ex = j, ey = k, ez = i;
				}
			}
		}
		dfs(sx, sy, sz, 0);
		if(ans != 1e5) printf("Escaped in %d minute(s).\n", ans);
		else printf("Trapped!\n");
	}
	return 0;
}  

bfs 只需要向外扩展，第一次找到终点即可停止，复杂度低了很多

AC代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int L, R, C;
int ans, ex, ey, ez;
char mp[35][35][35]; // L, R, C, 
int vis[35][35][35];
int dx[] = {0,0,0,0,-1,1}; // 右下左上前后 
int dy[] = {1,0,-1,0,0,0};
int dz[] = {0,1,0,-1,0,0};

struct P{ 
	int x, y, z;
	int step;
};

bool check(int x, int y, int z) {
	if(x < 0 || y < 0 || z < 0 || x >= R || y >= C || z >= L) return 0;
	if(vis[z][x][y]) return 0;
	if(mp[z][x][y] == '#') return 0;
	return 1;
}

int bfs(int sx, int sy, int sz) {
	P S;
	S.x = sx; S.y = sy; S.z = sz; S.step = 0;
	queue<P> Q;
	Q.push(S);
	P now;
	while(!Q.empty()) {
		now = Q.front(); Q.pop();
		
		if(now.x == ex && now.y == ey && now.z == ez) return now.step;
		
		int nx, ny, nz;
		for(int i = 0; i < 6; i++) {
			nx = now.x + dx[i];
			ny = now.y + dy[i];
			nz = now.z + dz[i];
			if(check(nx, ny, nz)) {
				vis[nz][nx][ny] = 1;
				P tmp;
				tmp.x = nx; tmp.y = ny; tmp.z = nz; tmp.step = now.step+1;
				Q.push(tmp);
			}
		}
	}
	return 0;
}

int main() {
//	freopen("test.in", "r", stdin);
	while(~scanf("%d%d%d", &L, &R, &C) && L && R && C) {
		memset(vis, 0, sizeof(vis));
		int sx, sy, sz;
		for(int i = 0; i < L; i++) {
			for(int j = 0; j < R; j++) {
				scanf("%s", mp[i][j]);
				for(int k = 0; k < C; k++) {
					if(mp[i][j][k] == 'S') sx = j, sy = k, sz = i;
					if(mp[i][j][k] == 'E') ex = j, ey = k, ez = i;
				}
			}
		}
		
		ans = bfs(sx, sy, sz);
		if(ans) printf("Escaped in %d minute(s).\n", ans);
		else printf("Trapped!\n");
	}
	return 0;
}