题意:给你一个4*4的棋盘,'w'表示白子,'b'表示黑子。每次可以将一颗棋子及他的上下左右变为相反的颜色,通过这种操作,我们要把所有的子全变成一个颜色,问最小步数。如果不能将所有的子变成一个颜色输出"Impossible"。
思路:该题和 POJ ~ 3279 ~ Fliptile(二进制枚举+模拟递推)基本一样。只不过本题全部变为黑色或者白色均可以。我们可以用0和1来表示黑白,方便后面翻转操作。
//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
const int MAXN = 10;
const int INF = 0x3f3f3f3f;
int n;
int MAP[MAXN][MAXN], a[MAXN][MAXN];
void Flip(int x, int y)//翻转操作
{
a[x][y] = !a[x][y];
a[x-1][y] = !a[x-1][y];
a[x+1][y] = !a[x+1][y];
a[x][y-1] = !a[x][y-1];
a[x][y+1] = !a[x][y+1];
}
bool judge(int op)//最后一行是否全为op
{
for (int j = 1; j <= n; j++)
{
if (a[n][j] != op) return false;
}
return true;
}
int work(int op)//全变为op
{
int cnt = 0, ans = INF;
for (int state = 0; state < (1<<n); state++)
{
cnt = 0;
memcpy(a, MAP, sizeof(MAP));
for (int j = 0; j < n; j++)
{
if (state&(1<<j)) cnt++, Flip(1, j + 1);
}
for (int i = 2; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (a[i-1][j] != op) cnt++, Flip(i, j);
}
}
if (judge(op)) ans = min(ans, cnt);
}
return ans;
}
int main()
{
n = 4;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
char c; cin >> c;
if (c == 'w') MAP[i][j] = 0;
if (c == 'b') MAP[i][j] = 1;
}
}
int ans = min(work(0), work(1));
if (ans != INF) cout << ans << endl;
else cout << "Impossible" << endl;
return 0;
}
/*
bwwb
bbwb
bwwb
bwww
*/