HDU 2612 - Find a way

题目大意：Y和M要到同一家KCF碰面，每一步要走11分钟，’#‘为障碍物，’@‘为KCF。问两人到同一家KCF总时长最短要多久。

解题思路：与迷宫问题类似，只是要两个人走，将所有KCF位置读入结构体。读取两个人的位置，两次bfs求出分别到能到的所有KCF的步数。最后找出最小的总步数。

ac代码：

#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
queue <int>qu;
int n, m, vis[205][205];
int dx[4] = {-1, 1, 0, 0}, pos1[2];
int dy[4] = {0, 0, -1, 1}, pos2[2];
int count, mi;
char a[205][205];
struct KCF{
	int x;
	int y;
	int a[2];
	int sum;
}k[5005];
void search()
{
	count = 0;
	memset(vis, -1, sizeof(vis));
	for (int i=0; i<n; i++)
		for (int j=0; j<m; j++)
			if (a[i][j] == 'Y')
				pos1[0] = i, pos1[1] = j;
			else if (a[i][j] == 'M')
				pos2[0] = i, pos2[1] = j;
			else if (a[i][j] == '#')
				vis[i][j] = 0;
			else if (a[i][j] == '@')
				k[count].x = i, k[count++].y = j;	
}

void bfs(int pos[], int N)
{
	while (!qu.empty())
		qu.pop();
	qu.push(pos[0]);
	qu.push(pos[1]);
	vis[pos[0]][pos[1]] = 0;
	while (!qu.empty()){
		int tt = qu.front();
		qu.pop();
		int kk = qu.front();
		qu.pop();
		for (int i=0; i<count; i++)
			if (tt == k[i].x && kk == k[i].y)
				k[i].a[N] = vis[tt][kk];
		for (int i=0; i<4; i++){
			int temp1, temp2;
			temp1 = tt + dx[i];
			temp2 = kk + dy[i];
			if (temp1 >= 0 && temp1 < n && temp2 >= 0 
			&& temp2 < m && vis[temp1][temp2] == -1){
				qu.push(temp1), qu.push(temp2);
				vis[temp1][temp2] = vis[tt][kk] + 1;		
			}
		}
	}
}
int main()
{
	while (scanf("%d%d", &n, &m)!=EOF){
		getchar();
		for (int i=0; i<n; i++)
			scanf("%s", a[i]);
		search();		
		bfs(pos1, 0);
		search();
		bfs(pos2, 1);
		for (int i=0; i<count; i++){
			k[i].sum = k[i].a[0] + k[i].a[1];
			if (!i)
				mi = k[0].sum;
			if (mi > k[i].sum)
				mi = k[i].sum;
		}
		printf("%d\n", mi*11);
	}
return 0;
}