【ACM- OJ】《Find a way》C++

题目描述

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.

输入

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

输出

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.

样例输入

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

样例输出

66
88
66

AC代码

//
//  main.cpp
//  Find a way
//
//  Created by HISS on 2020/10/25.
//  Copyright © 2020 HISS. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <queue>
#include "string.h"     //memset
using namespace std;
 
char map[202][202];//地图
int a[202][202];    //保存第一个人Y到各个节点（坐标）的最小步数，有的节点不用访问，下面有说明
int b[202][202];    //保存第二个人M
int dx[4]={
   0, 0, -1,</