{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"description","value":{"format":"MD","content":"有两个$n$行$m$列的地雷阵$A,B$。一个非雷点上的数字为它周围八个点中的地雷数量。定义一个地雷阵的$sum$值为所有非雷点上的数字之和。要求改动$B$中不超过$\\lfloor {\\frac {nm}{2}} \\rfloor$个点(有雷该为无雷,无雷该为有雷),使得改动后$sum(A) \u003d sum(B)$,并输出改动后的$B$。"}},{"title":"Input","value":{"format":"MD","content":"第一行两个整数$n$,$m$。\n随后$n$行$m$列的字符矩阵表示$A$。\n随后$n$行$m$列的字符矩阵表示$B$。\n$A$,$B$中仅有\u0027X\u0027(表示地雷)和\u0027.\u0027(表示无雷)两种字符。"}},{"title":"Output","value":{"format":"MD","content":"输出$n$行$m$列的字符矩阵表示改动后的$B$。"}},{"title":"Sample 1","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2 4\nX..X\nX.X.\nX.X.\n.X..\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eX.XX\n.X..\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\n不难发现只改动了一位,且改动后$sum(A) \u003d sum(B) \u003d 10$\n"}},{"title":"data domain","value":{"format":"MD","content":"$1 \\le n,m \\le 1000$"}}]}