【題目描述】

Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 15) of square tiles, each of which is colored black on one side and white on the other side.

As one would guess, when a single white tile is flipped, it changes to black; when a single black tile is flipped, it changes to white. The cows are rewarded when they flip the tiles so that each tile has the white side face up. However, the cows have rather large hooves and when they try to flip a certain tile, they also flip all the adjacent tiles (tiles that share a full edge with the flipped tile). Since the flips are tiring, the cows want to minimize the number of flips they have to make.Help the cows determine the minimum number of flips required, and the locations to flip to achieve that minimum. If there are multiple ways to achieve the task with the minimum amount of flips, return the one with the least lexicographical ordering in the output when considered as a string. If the task is impossible, print one line with the word "IMPOSSIBLE".

Input
Line 1: Two space-separated integers: M and N
Lines 2… M+1: Line i+1 describes the colors (left to right) of row i of the grid with N space-separated integers which are 1 for black and 0 for white
Output
Lines 1… M: Each line contains N space-separated integers, each specifying how many times to flip that particular location.
Sample Input

4 4
1 0 0 1
0 1 1 0
0 1 1 0
1 0 0 1

Sample Output

0 0 0 0
1 0 0 1
1 0 0 1
0 0 0 0

【題目分析】
看完題目后很明顯應該是一個暴力搜索，但是應該從哪里開始搜索呢？從頭開始的話會有2^15*15種可能，顯然是不允許的。我們應該優化一下搜索的順序，即哪些情況是顯然不可能成立的。
我們如果從上往下搜索，那么下面的對上面的影響只有四個方向中上面的那個，那么如果搜索在x行，那么x-1行中的1下面的那塊必須翻轉，0下面的那塊不能翻轉。這樣類推，我們發現除了第一行其他行的翻轉情況都已經被確定，因此我們只需要枚舉第一行的翻轉情況（2¹⁵種）就可以了。
看大佬的博客發現用到一種二進制的優化。如果沒有這種優化的話我們可能需要搜索，相對比較復雜。
我們可以將一行中翻轉的情況看做一個數，例如：110就是翻轉前兩個，那么總共的情況就是1<<m種
對于一個數字，我們如何快速判斷哪些位是1呢？
我們可以用110與100,010,001的與判斷，如果與的結果是0則該位是0，如果結果不是0則該位是1
有上面的方法后我們就可以寫出程序啦
【AC代碼】（借鑒大佬）

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<queue>
using namespace std;int n,m,num,cnt,ans;
const int MAXN=20;
int a[MAXN][MAXN];		//原數組
int b[MAXN][MAXN];		//用來修改的臨時數組
int c[MAXN][MAXN];		//保存答案
const int drc[5][2]={0,0,0,1,0,-1,1,0,-1,0};void rev(int i,int j)
{int u,v;++cnt;  c[i][j]=1;	//記錄答案for(int k=0;k<5;k++){u=i+drc[k][0]; v=j+drc[k][1];if(u<0 || u>=n || v<0 || v>=m) continue;b[u][v]^=1;	//翻轉}
}bool check(int x)
{cnt=0;memcpy(b,a,sizeof(b));	//直接將a拷貝給bfor(int i=0;i<m;i++){if(x&(1<<(m-1-i)))//1<<(m-1-i)是第i位為1其他位為0的數，用來判斷x在第i位是不是1rev(0,i);	//如果是1就翻轉}for(int i=1;i<n;i++){for(int j=0;j<m;j++){if(b[i-1][j]) rev(i,j);	//如果上一行是1就翻轉}}for(int i=0;i<m;i++){if(b[n-1][i]) return false;	//前面肯定都是0了，只需要判斷最后一行是不是0就可以了}return true;
}int main()
{scanf("%d%d",&n,&m);ans=INT_MAX; num=-1;memset(a,0,sizeof(a));for(int i=0;i<n;i++){for(int j=0;j<m;j++){scanf("%d",&a[i][j]);}}for(int i=0,j=1<<m;i<j;i++){if(check(i) && cnt<ans)	//這樣記錄的答案肯定是字典序，前面的能不翻就不翻，盡量翻后面的{ans=cnt; num=i;}}memset(c,0,sizeof(c));	//用來保存答案，之前都不用保存if(num!=-1){check(num);for(int i=0;i<n;i++){for(int j=0;j<m-1;j++){printf("%d ",c[i][j]);}printf("%d\n",c[i][m-1]);}}else{printf("IMPOSSIBLE");}return 0;
}