poj_2251

源地址：http://poj.org/problem?id=2251

题目大意就是有个三维的地牢，L层，每层有R*C的地图，给出起点和终点，问是否能够从起点到达终点。

挺简单的，就是把二维换成三维，本来有四个方向，现在有六个方向而已。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
int L,R,C;
#define Mod 1000000007
#define N 110
#define M 1000100
int dirx[6] = {0,0,1,-1,0,0};
int diry[6] = {1,-1,0,0,0,0};
int dirz[6] = {0,0,0,0,1,-1};
char mp[35][35][35];
int vis[35][35][35];
struct Node{
	int x,y,z;
	int step;
};
Node st,ed;
bool check(int x,int y,int z){
	if(z<0 || z>=L || x<0 || x>=R || y<0 || y>=C || mp[z][x][y] == '#')
		return false;
	if(vis[z][x][y])
		return false;
	return true;
}
int bfs(){
	queue<Node> q;
	memset(vis,0,sizeof vis);
	Node cur,next;
	cur = st;
	cur.step = 0;
	vis[cur.z][cur.x][cur.y] = 1;
	q.push(cur);
	while(!q.empty()){
		cur = q.front();
		q.pop();
		for(int i=0;i<6;i++){
			next.x = cur.x + dirx[i];
			next.y = cur.y + diry[i];
			next.z = cur.z + dirz[i];
			if(!check(next.x,next.y,next.z))
				continue;
			vis[next.z][next.x][next.y] = 1;
			if(next.x == ed.x && next.y == ed.y && next.z == ed.z)
				return cur.step+1;
			next.step = cur.step+1;
			q.push(next);
		}
	}
	return 0;
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
//    int t;
    while(scanf("%d%d%d",&L,&R,&C)!=EOF && L+R+C){
    	char tmp[N];
    	for(int k=0;k<L;k++){
    		for(int i=0;i<R;i++)
    			sfs(mp[k][i]);
    		for(int i=0;i<R;i++){
    			for(int j=0;j<C;j++){
    				if(mp[k][i][j] == 'S'){
    					st.x = i;
    					st.y = j;
    					st.z = k;
    				}else if(mp[k][i][j] == 'E'){
    					ed.x = i;
    					ed.y = j;
    					ed.z = k;
    				}
    			}
    		}
    		gets(tmp);
    	}
//    	printf("%d %d %d\n",st.x,st.y,st.z);
//    	printf("%d %d %d\n",ed.x,ed.y,ed.z);
//    	for(int k=0;k<L;k++){
//    		for(int i=0;i<R;i++)
//    			printf("%s\n",mp[k][i]);
//    		printf("\n");
//    	}
    	int ans = bfs();
    	if(ans)
    		printf("Escaped in %d minute(s).\n",ans);
    	 else
    		 printf("Trapped!\n");
    }
return 0;
}