题意:
给出起点和终点、不能走的点,求出是否可以从起点到终点,按条件输出。
思路:
三维BFS,和二维差不多,记录一下写法。
代码:
#include<iostream>
#include<algorithm>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
#include<string.h>
#include<queue>
#include<stack>
#include<cstdio>
using namespace std;
const int maxn=30+6;
#define mod 1000000007
#define INF 0x3f3f3f
struct node
{
int x,y,z;
int step;
};
char a[maxn][maxn][maxn];
bool vis[maxn][maxn][maxn];
int dx[]={-1,1,0,0,0,0};
int dy[]={0,0,-1,1,0,0};
int dz[]={0,0,0,0,-1,1};
int l,r,c;
int bfs(node s,node e)
{
vis[s.z][s.x][s.y]=1;
queue<node>q;
while(q.size())q.pop();
q.push(node{s.x,s.y,s.z,0});
while(q.size())
{
node now,nxt;
now=q.front();
q.pop();
if(now.x==e.x&&now.y==e.y&&now.z==e.z)
{
return now.step;
}
rep(i,0,5)
{
nxt.x=now.x+dx[i];
nxt.y=now.y+dy[i];
nxt.z=now.z+dz[i];
nxt.step=now.step+1;
if(nxt.x>0&&nxt.y>0&&nxt.z>0&&nxt.x<=r&&nxt.y<=c&&nxt.z<=l)
{
if(a[nxt.z][nxt.x][nxt.y]!='#'&&!vis[nxt.z][nxt.x][nxt.y])
{
vis[nxt.z][nxt.x][nxt.y]=1;
q.push(nxt);
}
}
}
}
return -1;
}
int main()
{
while(cin>>l>>r>>c&&l)
{
node a1,b;
for(int i=1;i<=l;i++)
{
rep(j,1,r)
{
rep(k,1,c)
{
vis[i][j][k]=0;
cin>>a[i][j][k];
if(a[i][j][k]=='S')
{
a1.x=j;
a1.y=k;
a1.z=i;
}else if(a[i][j][k]=='E')
{
b.x=j;
b.y=k;
b.z=i;
}
}
}
}
int ans= bfs(a1,b);
if(ans!=-1)
{
printf("Escaped in %d minute(s).\n",ans);
}else
{
printf("Trapped!\n");
}
}
return 0;
}