poj2251 Dungeon Master &&肿瘤诊断（三维bfs）

Description

You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south, east, west, up or down. You cannot move diagonally and the maze is surrounded by solid rock on all sides.

Is an escape possible? If yes, how long will it take?
Input

The input consists of a number of dungeons. Each dungeon description starts with a line containing three integers L, R and C (all limited to 30 in size).
L is the number of levels making up the dungeon.
R and C are the number of rows and columns making up the plan of each level.
Then there will follow L blocks of R lines each containing C characters. Each character describes one cell of the dungeon. A cell full of rock is indicated by a ‘#’ and empty cells are represented by a ‘.’. Your starting position is indicated by ‘S’ and the exit by the letter ‘E’. There’s a single blank line after each level. Input is terminated by three zeroes for L, R and C.
Output

Each maze generates one line of output. If it is possible to reach the exit, print a line of the form
Escaped in x minute(s).

where x is replaced by the shortest time it takes to escape.
If it is not possible to escape, print the line
Trapped!
Sample Input

3 4 5
S....
.###.
.##..
###.#

#####
#####
##.##
##...

#####
#####
#.###
####E

1 3 3
S##
#E#
###

0 0 0

Sample Output

Escaped in 11 minute(s).
Trapped!

第一次写三维的搜索，写完一点问题改了半天，现在犯的错以后就会少犯点。
pta上肿瘤诊断也是三维的，以前没写出来，马上写写。

• 开始改的时候把标记改掉了，一直内存超限。。
• 改了半天改的bug是bfs里的判断条件应该在pop的时候判断，不应该在后面循环里判断，虽然cont我也加一了，不知道怎么还是错的，以后就不这样写吧。

#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
char a[35][35][35]; 
int l,m,n,v[35][35][35],x,y,z,fz,fx,fy;
int hy[6][3]={{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}};
struct node{
	int x,y,z,cont;
}s,t;
void bfs(){
	queue<node>q;
	s.x=x;
	s.y=y;
	s.z=z;
	s.cont=0;
	q.push(s);
	v[x][y][z]=1;
	int i,j,k,a1,b,c;
	while(!q.empty()){
		t=q.front();
		q.pop();
		if(t.x==fx&&t.y==fy&&t.z==fz){				
			printf("Escaped in %d minute(s).\n",t.cont);return;
		}
		for(i=0;i<6;i++){
			s.x=t.x+hy[i][0];
			s.y=t.y+hy[i][1];
			s.z=t.z+hy[i][2];
			if(s.x>=0&&s.y>=0&&s.z>=0&&s.x<l&&s.y<m&&s.z<n&&a[s.x][s.y][s.z]!='#'&&v[s.x][s.y][s.z]==0){				
				v[s.x][s.y][s.z]=1;
				s.cont=t.cont+1;							
				q.push(s);		
			}						
		}
	}
	printf("Trapped!\n");
}
int main()
{
	int j,k,i;
    while(~scanf("%d %d %d",&l,&m,&n)){
    	if(l==0&&m==0&&n==0) break;
    	memset(v,0,sizeof(v));
    	for(i=0;i<l;i++){		
    		for(j=0;j<m;j++){
    			scanf("%s",&a[i][j]);
    			for(k=0;k<n;k++){  				
    				if(a[i][j][k]=='S') {
    					x=i;y=j;z=k;
					}
					else if(a[i][j][k]=='E') {
    					fx=i;fy=j;fz=k;
					}
				}				
			}			
		}	
    	bfs();		
	}
    return 0;
}  

L3-004 肿瘤诊断 (30 分)
开始不习惯bfs，dfs一直爆栈，现在觉得很容易。

#include<stdio.h>
#include<cstring>
#include<queue>
using namespace std;
int a[1287][1290][129]={0},l,m,c,n;
int hy[6][3]={0,0,1,
			0,0,-1,
			0,1,0,
			0,-1,0,
			1,0,0,
			-1,0,0,
				};
struct node{
	int x,y,z;
}s,t;
void bfs(int x,int y,int z){
	a[x][y][z]=0;
	queue<node>q;
	s.x=x;s.y=y;s.z=z;
	q.push(s);
	c++;
	while(!q.empty()){
		t=q.front();
		q.pop();
		for(int i=0;i<6;i++){
			s.x=t.x+hy[i][0];
			s.y=t.y+hy[i][1];
			s.z=t.z+hy[i][2];
			if(a[s.x][s.y][s.z]){
				q.push(s);
				c++;
				a[s.x][s.y][s.z]=0;
			}
		}
	}
}
int main()
{
	int x,y,i,j,t,k;
	long long s=0;
	scanf("%d %d %d %d",&m,&n,&l,&t);
	
	for(k=1;k<=l;k++)		
	for(i=1;i<=m;i++)
		for(j=1;j<=n;j++)		
			scanf("%d",&a[k][i][j]);
			
	for(k=1;k<=l;k++)
	for(i=1;i<=m;i++)
		for(j=1;j<=n;j++){
			if(a[k][i][j]){
				c=0;
				bfs(k,i,j);
				if(c>=t)
					s+=c;
			}
		}
	printf("%lld",s);
	return 0;
}