题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2102
题意:中文题
解析:很简单的bfs,但是题目有个很奇葩的设定,那个时光机,你踩上去一定会传到另一层,那么如果你的另一边也是时光机的话,那你就拉闸了,这种情况确实很无语,注意下这个坑点,其他都跟普通的走迷宫没区别
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x7fffffff;
struct node
{
int x,y,z,step;
node() {}
node(int _x,int _y,int _z,int _step)
{
x = _x;
y = _y;
z = _z;
step = _step;
}
};
char a[10][20][20];
int vis[20][20][20];
int step[20][20][20];
int dy[] = {0,-1,1,0};
int dz[] = {1,0,0,-1};
int n,m;
int bfs(int x,int y,int z)
{
memset(vis,0,sizeof(vis));
queue<node>q;
q.push(node(x,y,z,0));
vis[x][y][z] = 1;
while(!q.empty())
{
node now = q.front();
q.pop();
if(a[now.x][now.y][now.z]=='P')
return now.step;
for(int i=0;i<4;i++)
{
int tx = now.x;
int ty = now.y+dy[i];
int tz = now.z+dz[i];
if(tz<0 || ty<0 || ty>=n || tz>=m)
continue;
if(a[tx][ty][tz]=='#')
{
tx ^= 1;
if(a[tx][ty][tz]=='#')
continue;
}
if(a[tx][ty][tz]=='*' || vis[tx][ty][tz])
continue;
vis[tx][ty][tz] = 1;
step[tx][ty][tz] = now.step+1;
q.push(node(tx,ty,tz,now.step+1));
}
}
return inf;
}
int main(void)
{
int t;
scanf("%d",&t);
while(t--)
{
int time;
scanf("%d %d %d",&n,&m,&time);
int x,y,z;
for(int i=0;i<2;i++)
{
for(int j=0;j<n;j++)
{
scanf("%s",a[i][j]);
for(int k=0;k<m;k++)
{
if(a[i][j][k]=='S')
x = i,y = j,z = k;
}
}
}
int ans = bfs(x,y,z);
if(ans<=time)
puts("YES");
else
puts("NO");
}
return 0;
}
/*
1
5 5 14
S*#*.
.#...
.....
****.
...#.
..*.P
#.*..
***..
...*.
*.##.
NO
*/