{"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":"伊菲的家在乡下,而梅基的家在市中心。于是,伊菲和梅基安排在KFC见面。西安有很多KFC,他们想选择一个花费总时间最短的KFC见面。\n现在给你一张西安的地图,伊菲和梅基都可以上、下、左、右移动到相邻的地点,每移动一个位置花费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“@” KCF"}},{"title":"Output","value":{"format":"MD","content":"对于每个测试用例,输出伊菲和梅基花费的最短总时间。总有一家KFC可以让他们见面。"}},{"title":"Sample Input","value":{"format":"MD","content":"4 4\nY.#@\n....\n.#..\n@..M\n4 4\nY.#@\n....\n.#..\n@#.M\n5 5\nY..@.\n.#...\n.#...\n@..M.\n#...#"}},{"title":"Sample Output","value":{"format":"MD","content":"66\n88\n66"}}]}