原题链接:https://ac.nowcoder.com/acm/problem/235250
感谢yq大佬的点拨!
虽然现在还是不完全懂,以后再细品吧QAQ此文只是加了注释,便于理解。
解析也可以参考:NC235250 牛可乐的翻转游戏 - 空白菌 - 博客园
#include<iostream>
#include<string>
#define ll long long
#define maxn 105
#define inf 0x3f3f3f3f
using namespace std;
//加快速度
void init()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
}
ll a, b, c, js, n, m, arr[maxn][maxn], sc[maxn][maxn];
string t, s;
//以x,y为中心将这枚棋子上下左右相邻的四枚棋子的颜色翻转(如果对应位置有棋子的话)
void tran(ll x, ll y) {
int dx[6] = { 0,0,0,0,1,-1 };
int dy[6] = { 0,0,1,-1,0,0 };
for (int i = 1; i <= 5; i++) {
a = x + dx[i];
b = y + dy[i];
if (a >= 0 && a < n && b >= 0 && b < m) {
arr[a][b] = ((arr[a][b] == 0) ? 1 : 0);
}
}
}
//type代表是要将当前棋盘全部转成 1->0 0->1
ll add(ll a,int type) {
ll ans=0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
arr[i][j] = sc[i][j];
}
}
//对应的位为1要反转
for (int i = 0; i < m; i++) {
if (a & (1 << i)) {
ans++;
tran(0, i);
}
}
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < m; j++) {
//下一行翻转顺带把这一行的这个棋子翻转了
if (arr[i][j] == type) {
tran(i + 1, j);
ans++;
}
}
}
//检验
for (int j = 0; j < m; j++) {
if (arr[n - 1][j] == type)ans = inf;
}
return ans;
}
void solve() {
cin >> n >> m;
char ch;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
//字符读入更快
cin >> ch;
sc[i][j] = ch - '0';
}
}
js = inf;
//第一行有2^m个组合
//二进制位代表第一行对应的棋子要不要翻转
//0不反转,1反转
for (int i = 0; i < 1 << m; i++) {
//将所有棋子都变成黑色(1)或者白色(0)
js = min(js, add(i,0));
js = min(js, add(i,1));
}
if (js == inf)cout << "Impossible" << endl;
else cout << js << endl;
}
int main() {
init();
solve();
}