hdu 2579 Dating with girls(2)【bfs】

最新推荐文章于 2020-04-04 19:05:42 发布

原创最新推荐文章于 2020-04-04 19:05:42 发布 · 401 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

hdu oj

bfs

本文介绍了一种在特殊迷宫中寻找目标的经典最短路径问题。迷宫中的障碍物会随时间周期性消失，利用广度优先搜索(BFS)算法，并结合时间状态标记，解决在限定条件下快速找到目标的问题。

Dating with girls(2)

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2657 Accepted Submission(s): 741

Problem Description

If you have solved the problem Dating with girls(1).I think you can solve this problem too.This problem is also about dating with girls. Now you are in a maze and the girl you want to date with is also in the maze.If you can find the girl, then you can date with the girl.Else the girl will date with other boys. What a pity!
The Maze is very strange. There are many stones in the maze. The stone will disappear at time t if t is a multiple of k(2<= k <= 10), on the other time , stones will be still there.
There are only ‘.’ or ‘#’, ’Y’, ’G’ on the map of the maze. ’.’ indicates the blank which you can move on, ‘#’ indicates stones. ’Y’ indicates the your location. ‘G’ indicates the girl's location . There is only one ‘Y’ and one ‘G’. Every seconds you can move left, right, up or down.

Input

The first line contain an integer T. Then T cases followed. Each case begins with three integers r and c (1 <= r , c <= 100), and k(2 <=k <= 10).
The next r line is the map’s description.

Output

For each cases, if you can find the girl, output the least time in seconds, else output "Please give me another chance!".

Sample Input

1
6 6 2
...Y..
...#..
.#....
...#..
...#..
..#G#.

Sample Output

经典的bfs 求最短路，不过因为石头会时隐时现，需要另外一维变量来标记时间这个状态（其实只需要标记取余的结果就可以了），注意这种特殊情况，其他就没什么了...

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
char map[105][105];
bool vis[105][105][105];
int n,m,k,bx,by,ex,ey;
int dx[4]={-1,0,0,1},dy[4]={0,1,-1,0};
struct zb
{
	int x,y,time;
}x;

void slove()
{
	memset(vis,0,sizeof(vis));
	queue< zb > q;
	zb bg={bx,by,0};
	q.push(bg);
	vis[bx][by][0]=1;
	while(!q.empty())
	{
		x=q.front();q.pop();
		if(x.x==ex&&x.y==ey)
		{
			printf("%d\n",x.time);
			return;
		}
		for(int i=0;i<4;++i)
		{
			zb tp={x.x+dx[i],x.y+dy[i],x.time+1};
			if(tp.x<0||tp.x>n-1||tp.y<0||tp.y>m-1||map[tp.x][tp.y]=='#'&&tp.time%k!=0)
			{
				continue;
			}
			if(!vis[tp.x][tp.y][tp.time%k])
			{
				q.push(tp);
				vis[tp.x][tp.y][tp.time%k]=1;
			}
		}
	}
	printf("Please give me another chance!\n");
}
int main()
{
	int t;
	//freopen("shuju.txt","r",stdin);
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d%d",&n,&m,&k);
		for(int i=0;i<n;++i)
		{
			scanf("%s",map[i]);
		}
		for(int i=0;i<n;++i)
		{
			for(int j=0;j<m;++j)
			{
				 if(map[i][j]=='Y')
				 {
				 	bx=i;by=j;
				 }
				 else if(map[i][j]=='G')
				 {
				 	ex=i;ey=j;
				 } 
			}
		}
		slove();
	}
	return 0;
}