三维简单BFS...只是多了俩方向而已,加上就行了,按照正常BFS的敲就好,注意数组貌似要开大一点...题目30的范围如果开30的话可能会RE...
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stdlib.h>
using namespace std;
struct node
{
int x,y,z;
int time;
};
char map[33][33][33];
int used[33][33][33];
int d[6][3]={1,0,0,-1,0,0,0,1,0,0,-1,0,0,0,1,0,0,-1};
int l,c,r;
int ok(int x,int y,int z)
{
if(x<0||y<0||z<0||x>=l||y>=c||z>=r)
return 0;
if(map[x][y][z]=='#')
return 0;
if(used[x][y][z]==1)
return 0;
return 1;
}
int bfs(int x,int y,int z)
{
queue<node> q;
node now,next;
now.x=x,now.y=y,now.z=z;
now.time=0;
q.push(now);
while(!q.empty())
{
now=q.front();
q.pop();
if(map[now.x][now.y][now.z]=='E')
return now.time;
for(int i=0;i<6;i++)
{
next.x=now.x+d[i][0];
next.y=now.y+d[i][1];
next.z=now.z+d[i][2];
if(ok(next.x,next.y,next.z))
{
next.time=now.time+1;
used[next.x][next.y][next.z]=1;
q.push(next);
}
}
}
return -1;
}
int main()
{
while(scanf("%d %d %d",&l,&c,&r),l+c+r)
{
memset(map,0,sizeof(map));
memset(used,0,sizeof(used));
for(int i=0;i<l;i++)
{
for(int j=0;j<c;j++)
{
scanf("%s",map[i][j]);
}
}
int ans;
for(int i=0;i<l;i++)
{
for(int j=0;j<c;j++)
{
for(int k=0;k<r;k++)
if(map[i][j][k]=='S')
ans=bfs(i,j,k);
}
}
if(ans==-1)
printf("Trapped!\n");
else
printf("Escaped in %d minute(s).\n",ans);
}
return 0;
}