hdu2579 Dating with girls(2)--BFS

原题链接： http://acm.hdu.edu.cn/showproblem.php?pid=2579

一：题意

一个r*c的迷宫，男孩找到女孩，石块每隔k消失，求最小步数。

二：分析

开一个三维的标记数组vis，第三维表示余数的状态，男孩走的步数取余k的余数来标记。

三：AC代码

#define _CRT_SECURE_NO_DEPRECATE 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;

int vis[105][105][15];
char ch[105][105];
int dir[4][2] = { { 1,0 },{ -1,0 },{ 0,1 },{ 0,-1 } };
int sx, sy;
int dx, dy;
int r, c, k;

struct Node
{
	int x, y;
	int step;
	Node(){}
	Node(int xx,int yy,int stepp):x(xx),y(yy),step(stepp){}
};

int bfs()
{
	queue<Node> Q;
	Node node1(sx, sy, 0);
	Node node2;
	vis[sx][sy][0] = 1;
	Q.push(node1);

	while (!Q.empty())
	{
		node1 = Q.front();
		Q.pop();

		if (node1.x == dx&&node1.y == dy)
			return node1.step;

		for (int i = 0; i < 4; i++)
		{
			node2 = node1;
			node2.x += dir[i][0];
			node2.y += dir[i][1];
			node2.step++;

			if (node2.x >= 0 && node2.x < r&&node2.y >= 0 && node2.y < c && !vis[node2.x][node2.y][node2.step%k])
			{
				vis[node2.x][node2.y][node2.step%k] = 1;

				if (ch[node2.x][node2.y] == '.'||(ch[node2.x][node2.y] == '#'&&node2.step%k == 0))
					Q.push(node2);
			}
		}
	}

	return 0;
}

int main()
{
	int T;
	scanf("%d", &T);

	while (T--)
	{
		scanf("%d%d%d", &r, &c, &k);
		for (int i = 0; i < r; i++)
		{
			getchar();
			for (int j = 0; j < c; j++)
			{
				scanf("%c", &ch[i][j]);
				if (ch[i][j] == 'Y')
				{
					sx = i;
					sy = j;
					ch[i][j] = '.';
				}
				else if (ch[i][j] == 'G')
				{
					dx = i;
					dy = j;
					ch[i][j] = '.';
				}
			}
		}

		memset(vis, 0, sizeof(vis));

		int ans = bfs();
		if (ans)
			printf("%d\n", ans);
		else
			printf("Please give me another chance!\n");
	}

	return 0;
}