POJ T2251 Dungeon Master

                           POJ T2251 Dungeon Master

---

题解：

    这题跟HDU T1253 胜利大逃亡 这道题一个意思，写法几乎一样，只需要记录下起点和终点就OK了......

    还是附上坐标图吧

 

代码：

    

#include<cstdio>
#include<iostream>
#include<queue>
#define maxn 35
using namespace std;
int l,r,c,ans;
char maps[maxn][maxn][maxn];
int mov[6][3] = {0,-1,0, 0,1,0, 0,0,-1, 0,0,1, 1,0,0, -1,0,0};

struct Node{
	int x,y,z,st;
}s,e,now,nex;

bool charge(int x,int y,int z){
	if(x < 0 || x >= l|| y < 0|| y >= r|| z < 0|| z >= c || maps[x][y][z] == '#')
	    return false;
	return true;
}

int Bfs(int st){
	now.x = s.x;
	now.y = s.y;
	now.z = s.z;
	now.st = st;
	queue<Node> Q;
	Q.push(now);
	while(!Q.empty()){
		now = Q.front();
		Q.pop();
		
		if(now.x == e.x && now.y == e.y && now.z == e.z)
		    return now.st;
        
		for(int i = 0; i < 6; ++i){	
			nex.x = now.x + mov[i][0];
			nex.y = now.y + mov[i][1];
			nex.z = now.z + mov[i][2];
			if(charge(nex.x,nex.y,nex.z)){
				nex.st = now.st + 1;
				maps[nex.x][nex.y][nex.z] = '#';
				Q.push(nex);
			}
		}
	}
	return -1;
}

int main(){
	while(scanf("%d%d%d",&l,&r,&c),l+r+c){
		for(int i = 0; i < l; ++i)
		    for(int j = 0; j < r; ++j){
		        scanf("%s",&maps[i][j]);
		        for(int k = 0; k < c; ++k){
					if(maps[i][j][k] == 'S'){
						s.x = i;s.y = j;s.z = k;
					}
					if(maps[i][j][k] == 'E'){
					    e.x = i;e.y = j;e.z = k;
					}
			    }
		    }
		ans = Bfs(0);
		if(ans != -1)
		    printf("Escaped in %d minute(s).\n",ans);
		else
		    puts("Trapped!");
		
	}
}