2020ICPC上海 B Mine Sweeper II（思维）

链接

题目描述

A mine-sweeper map $X$ can be expressed as an $n\times m$ grid. Each cell of the grid is either a mine cell or a non-mine cell. A mine cell has no number on it. Each non-mine cell has a number representing the number of mine cells around it. (A cell is around another cell if they share at least one common point. Thus, every cell that is not on the boundary has $8$ cells around it.) The following is a $16\times 30$ mine-sweeper map where a flagged cell denotes a mine cell and a blank cell denotes a non-mine cell with number $0$.

Given two mine-sweeper maps $A,B$ of size $n\times m$, you should modify at most $\lfloor \frac{nm}{2}\rfloor$ (i.e. the largest nonnegative integer that is less than or equal to $\frac{nm}{2}$ ) cells in $B$ (from a non-mine cell to a mine cell or vice versa) such that the sum of numbers in the non-mine cells in $A$ and the sum of numbers in the non-mine cells in $B$ are the same. (If a map has no non-mine cell, the sum is considered as $0$.)

If multiple solutions exist, print any of them. If no solution exists, print ‘’-1’’ in one line.

输入描述:

The first line contains two integers $n,m,(1\le n,m\le 1000)$, denoting the size of given mine-sweeper maps.

The $i$-th line of the following $n$ lines contains a length-$m$ string consisting of “.” and “X” denoting the $i$-th row of the mine-sweeper map $A$. A “.” denotes for a non-mine cell and an “X” denotes for a mine cell.

The $i$-th line of the following $n$ lines contains a length-$m$ string consisting of “.” and “X” denoting the $i$-th row of the mine-sweeper map $B$. A “.” denotes for a non-mine cell and an “X” denotes for a mine cell.

输出描述:

If no solution exists, print “-1” in one line.

Otherwise, print $n$ lines denoting the modified mine-sweeper map $B$. The $i$-th line should contain a length-$m$ string consisting of “.” and “X” denoting the $i$-th row of the modified map $B$. A “.” denotes for a non-mine cell and an “X” denotes for a mine cell.

Please notice that you need not print the numbers on non-mine cells since these numbers can be determined by the output mine-sweeper map.

输入

2 4
X..X
X.X.
X.X.
.X..

输出

X.XX
.X..

说明

We modify one cell in $B$. Then the sums of the numbers on non-mine cells in $A$ and $B$ both equal $10$.

思路

发现以下两个结论：

1. 一张扫雷地图的数字之和等于与它 “互补” 的地图的数字之和（“互补” 就是把地雷全变成非地雷，把非地雷全变成地雷）。
2. 地图 B 在修改不超过 $\lfloor \frac{nm}{2}\rfloor$ 个单元格的情况下，可以变成地图 A 或者变成与 A “互补” 的地图。

所以，若 A 与 B 不同单元格的数量小于等于 $\lfloor \frac{nm}{2}\rfloor$ 时，将 B 变成 A 即满足题意；否则将 B 变成与 A “互补” 的地图。

#include<bits/stdc++.h>
using namespace std;
const int N=1010;
char a[N][N],b[N][N];
int n,m,ans,flag;

int main(){
	ios::sync_with_stdio(false);
	cin>>n>>m;
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>a[i][j];
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>b[i][j];
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++)
		if(a[i][j]!=b[i][j]) ans++;
	if(ans<=(m*n>>1)) flag=true;
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++)
		cout<<(char)(flag?a[i][j]:a[i][j]^118)<<(j==m?"\n":"");
}

代码中用到了 'X' ^ 118 = '.' ， '.' ^ 118 = 'X' 这个性质。