Find a way
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 24190 Accepted Submission(s): 7911
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
Author
yifenfei
Source
Recommend
yifenfei | We have carefully selected several similar problems for you: 2717 1254 1728 2102 1072
Statistic |
Submit |
Discuss |
Note
我认为,M 能及经过 Y ,Y 也能到 M
用BFS寻找 Y or M
Y
o
r
M
到每一个 @
@
的最短距离
然后记录 Y Y 能到达每一个 @
@
的距离,用 cnt1[i][j]
c
n
t
1
[
i
]
[
j
]
来记录,其中,i,j
i
,
j
,是当前@
@
然后记录 M M 能到达每一个 @ @ 的距离,用 cnt2[i][j] c n t 2 [ i ] [ j ] 来记录,其中,i,j i , j ,是当前@ @ <script type="math/tex" id="MathJax-Element-455">@</script> 的坐标
找到之后遍历整张图
CODE: