Appoint description:
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
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
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要在KFC约会,地图上有多个KFC,
求在哪个KFC两人所走总距离最短,(注意KFC可以当做路)
#include
#include
#include
#include
using namespace std;
const int N=202;
char a[N][N];
int b[N][N],map[N][N];
int n,m;
struct node
{
int x,y,tep;
};
queue
Q; node s,e; int x[]= {1,-1,0,0}; int y[]= {0,0,1,-1}; void bfs() { int i; node xx,yy; while(!Q.empty()) Q.pop(); Q.push(s); b[s.x][s.y]=-1; while(!Q.empty()) { xx=Q.front(); Q.pop(); for(i=0; i<4; i++) { yy.x=xx.x+x[i]; yy.y=xx.y+y[i]; yy.tep=xx.tep+1; if(yy.x>=0&&yy.x
=0&&yy.y
0&&map[i][j]>0) { mixn=min(mixn,b[i][j]+map[i][j]); } } } } printf("%d\n",mixn*11); } return 0; }