题意:给一个图,1表示灯亮,0表示灯灭,若转换某盏灯的状态,则其四周邻接的格子状态也会改变,求是否能将所有灯关掉,以及关掉所有灯的需要操作数最小的方案
思路:假设第一行的方案确定,则可以根据第一行的格子来枚举下面的格子,若某格子的上一个格子灯亮,则该格子必须翻转,枚举完之后可以保证最后一行以上的格子都为灯灭,故只需要判断最后一行的格子是否全灭即可,若非全灭,表示这个方案不成立。枚举第一行所有方案(2^n种),取成立的方案中操作数最小的方案即可。
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
const int maxn = 20;
const int inf = 0x3f3f3f3f;
const int dx[] = {0, 1, 0, -1, 0};
const int dy[] = {1, 0, -1, 0, 0};
int m, n, flip[maxn][maxn], ans[maxn][maxn], tile[maxn][maxn];
int getColor(int x, int y)
{
int c = tile[x][y];
for (int i = 0; i < 5; i++) {
int nx = x + dx[i], ny = y + dy[i];
if (nx >= 0 && nx < n && ny >= 0 && ny < m)
c += flip[nx][ny];
}
return c%2;
}
int solve()
{
for (int i = 1; i < n; i++)
for (int j = 0; j < m; j++) {
if (getColor(i-1, j)) {
flip[i][j] = 1;
}
}
for (int i = 0; i < m; i++) {
if (getColor(n-1, i))
return -1;
}
int res = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
res += flip[i][j];
}
return res;
}
int main()
{
while (cin >> n >> m) {
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> tile[i][j];
int res = -1;
for (int i = 0; i < 1 << m; i++) {
memset(flip, 0, sizeof(flip));
for (int j = 0; j < m; j++)
flip[0][j] = i >> j & 1;
int num = solve();
if (num >= 0 && (res == -1 || res > num)) {
res = num;
memcpy(ans, flip, sizeof(flip));
}
}
if (res == -1) {
cout << "IMPOSSIBLE" << endl;
} else {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
printf("%d ", ans[i][j]);
}
printf("\n");
}
}
}
return 0;
}