{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"MD","content":"凡凡找到了新的修音师,他可以唱更电的电音了!两人约在宽面店见面,他们想选择一个能够花费总时间最少的宽面店见面。\n现在你知道他们都在一个n*m的地图中,每次可以走到相邻的格子上,走一格要花费11分钟,问两人能够花费最短的时间。"}},{"title":"Input","value":{"format":"MD","content":"输入包含多个测试用例。\n每个测试用例包括前两个整数n,m.(2\u003c\u003dn,m\u003c\u003d200)。\n接下来的n行,每行包含m个字符。\n“Y”表示凡凡的初始位置。\n“M”表示修音师初始位置。\n“#”死路;\n\u0027.\u0027可走的路。\n“@” 宽面店"}},{"title":"Output","value":{"format":"MD","content":"对于每个测试用例,输出凡凡和修音师花费的最短总时间。总有一家宽面店可以让他们见面。"}},{"title":"Sample Input","value":{"format":"MD","content":"\u003cpre\u003e4 4\nY.#@\n....\n.#..\n@..M\n4 4\nY.#@\n....\n.#..\n@#.M\n5 5\nY..@.\n.#...\n.#...\n@..M.\n#...#\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"MD","content":"66\n88\n66"}}]}