Find a way
Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 7 Accepted Submission(s) : 6
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.
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
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加起来的总距离最小
用一个三维数组v2[2][x][y] 分别记录Y和M到达终点的距离
#include <iostream>
#include <queue>
#include <cstring>
#include <algorithm>
#define INF 0x3f3f3f
using namespace std;
char map[205][205];
int v2[2][205][205],vis[205][205];
int m,n;
struct node{
int x,y,t;
}pre,now,p;
int dir[4][2]={{1,0},{0,1},{0,-1},{-1,0}};
void bfs(int x,int y,int k)// 如果k==0 表示Y到终点的距离 k==1表示M到终点的距离
{
queue<node>q;
while (!q.empty())
q.pop();
pre.x=x;
pre.y=y;
pre.t=0;
q.push(pre);
vis[pre.x][pre.y]=1;
while (!q.empty())
{
now=q.front();
q.pop();
pre.t=now.t+1;
for (int i=0;i<4;i++)
{
int xx=now.x+dir[i][0];
int yy=now.y+dir[i][1];
if(!vis[xx][yy]&&map[xx][yy]!='#'&&xx>=0&&xx<n&&yy>=0&&yy<m)
{
if(map[xx][yy]=='@')
v2[k][xx][yy]=pre.t;//关键
vis[xx][yy]=1;
pre.x=xx;
pre.y=yy;
q.push(pre);
}
}
}
}
int main()
{
int x1,x2,y1,y2;
while (cin>>n>>m)
{
for (int i=0;i<n;i++)
{
cin>>map[i];
for (int j=0;j<m;j++)
{
if(map[i][j]=='Y') x1=i,y1=j;
if(map[i][j]=='M') x2=i,y2=j;
}
}
memset(vis,0,sizeof(vis));
memset(v2,0,sizeof(v2));
bfs(x1,y1,0);
memset(vis,0,sizeof(vis));
bfs(x2,y2,1);
int res=INF;
for (int i=0;i<n;i++)
for (int j=0;j<m;j++)
{
if(v2[0][i][j]&&v2[1][i][j])
res=min(res,v2[0][i][j]+v2[1][i][j]);
}
cout<<res*11<<endl;
}
return 0;
}