[kuangbin带你飞]专题1 简单搜索 N - Find a way HDU - 2612

题目：

Find a way

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 18744    Accepted Submission(s): 6072

Problem Description

Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki.
Yifenfei’s home is at the countryside, but Merceki’s home is in the center of city. So yifenfei made arrangements with Merceki to meet at a KFC. There are many KFC in Ningbo, they want to choose one that let the total time to it be most smallest.
Now give you a Ningbo map, Both yifenfei and Merceki can move up, down ,left, right to the adjacent road by cost 11 minutes.

 

Input

The input contains multiple test cases.
Each test case include, first two integers n, m. (2<=n,m<=200).
Next n lines, each line included m character.
‘Y’ express yifenfei initial position.
‘M’    express Merceki initial position.
‘#’ forbid road;
‘.’ Road.
‘@’ KCF

 

Output

For each test case output the minimum total time that both yifenfei and Merceki to arrival one of KFC.You may sure there is always have a KFC that can let them meet.

 

Sample Input

  
  

   
   4 4
Y.#@
....
.#..
@..M
4 4
Y.#@
....
.#..
@#.M
5 5
Y..@.
.#...
.#...
@..M.
#...#
  
  

 

Sample Output

  
  

   
   66
88
66
  
  

题意：Y和M两个人从当前位置出发，找一个@相遇，使Y和M到达@的时间之和最小，并求最小的到达时间。每一步耗时11min。

思路：BFS两次，第一次求Y到达所有可以到达的地方的最小时间。第二次求M到达所有可以到达地方的最小时间。最后遍历整个地图找一个两者都能到达的@，使Y和M到达此地的时间之和最小（*11）.

#include<bits/stdc++.h>

typedef long long ll;

using namespace std;

const int MAXN = 210;

int n,m;
int Yx,Yy;
int Mx,My;
int dir[4][2] = {{0,1},{0,-1},{-1,0},{1,0}};
char mapp[MAXN][MAXN];
int ytime[MAXN][MAXN];   //记录y到达（i，j）的最小时间 
int mtime[MAXN][MAXN];   //记录m到达（i，j）的最小时间 

void bfs1(){
	queue< pair<int,int> > q;
	memset(ytime,-1,sizeof(ytime));
	
	q.push(make_pair(Yx,Yy));
	ytime[Yx][Yy] = 0;
	
	while (!q.empty()){
		pair<int,int> temp = q.front();
		q.pop();
		int x = temp.first;
		int y = temp.second; 
		
		for(int i = 0 ; i<4 ; i++){
		 	int nxtx = x + dir[i][0];
		 	int nxty = y + dir[i][1];
		 	
		 	if(nxtx<0 || nxty<0 || nxtx>=n || nxty>=m)
		 		continue;
		 	if(mapp[nxtx][nxty] == '#')
		 		continue;
		 	if(ytime[nxtx][nxty] != -1)
		 		continue;
		 	
		 	ytime[nxtx][nxty] = ytime[x][y] + 1;
		 	q.push(make_pair(nxtx,nxty));
		}
	}
}

void bfs2(){
	queue< pair<int,int> > q;
	memset(mtime,-1,sizeof(mtime));
	
	q.push(make_pair(Mx,My));
	mtime[Mx][My] = 0;
	
	while (!q.empty()){
		pair<int,int> temp = q.front();
		q.pop();
		int x = temp.first;
		int y = temp.second; 
		
		for(int i = 0 ; i<4 ; i++){
		 	int nxtx = x + dir[i][0];
		 	int nxty = y + dir[i][1];
		 	
		 	if(nxtx<0 || nxty<0 || nxtx>=n || nxty>=m)
		 		continue;
		 	if(mapp[nxtx][nxty] == '#')
		 		continue;
		 	if(mtime[nxtx][nxty] != -1)
		 		continue;
		 	
		 	mtime[nxtx][nxty] = mtime[x][y] + 1;
		 	q.push(make_pair(nxtx,nxty));
		}
	}
}

int main(){
	ios::sync_with_stdio(false);
	while (cin>>n>>m){
		for(int i = 0 ; i<n ; i++){
			cin>>mapp[i];
		}
		for(int i = 0 ; i<n ; i++){
			for(int j = 0 ; j<m ; j++){
				if(mapp[i][j] == 'Y'){
					Yx = i,Yy = j;
				}
				else if(mapp[i][j] == 'M'){
					Mx = i,My = j;
				}
			}
		}
		bfs1();
		bfs2();

		int ans = 1<<30;      
		for(int i = 0 ; i<n ; i++){
			for(int j = 0 ; j<m ; j++){
				if(mapp[i][j] == '@'){
					if(ytime[i][j]>=0 && mtime[i][j]>=0){     //y和m均可以到达 
						ans = min(ans,(ytime[i][j]+mtime[i][j])*11);  //更新最小值 
					}
				} 
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}