Fliptile

  　　　　　　　　　　　　　开关题   尺度法

　　　　　 Fliptile

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 3394		Accepted: 1299

Description

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

 #include"iostream"
 #include"cstdio"
 #include"cstring"
 #include"algorithm"
 using namespace std;
 const int ms=;
 int dx[]={-,,,,};
 int dy[]={,-,,,};
 int M,N;
 int tile[ms][ms];
 int opt[ms][ms];//保存最优解
 int flip[ms][ms];
 int get(int x,int y)
 {
     int c=tile[x][y];
     for(int d=;d<;d++)
     {
         int x2=x+dx[d];
         int y2=y+dy[d];
         if(x2>=&&x2<M&&y2>=&&y2<N)
             c+=flip[x2][y2];
     }
     return c%;
 }
 //  求出第一行确定的情况下，最小的操作次数
 //  第一行确定了所有行都确定了。
 int calc()
 {
     for(int i=;i<M;i++)
     {
         for(int j=;j<N;j++)
         {
             if(get(i-,j))
                 flip[i][j]=;
         }
     }
     for(int j=;j<N;j++)
         if(get(M-,j))
             return -;
     int res=;
     for(int i=;i<M;i++)
         for(int j=;j<N;j++)
             res+=flip[i][j];
     return res;
 }
 void solve()
 {
     int res=-;
     //按照字典序尝试第一行的所有可能性
     for(int i=;i<<<N;i++)
     {
         memset(flip,,sizeof(flip));
         for(int j=;j<N;j++)
             flip[][N-j-]=i>>j&;
         int num=calc();
         if(num>=&&(res<||res>num))
         {
             res=num;
             memcpy(opt,flip,sizeof(flip));
         }
     }
     if(res<)
         printf("IMPOSSIBLE\n");
     else
         for(int i=;i<M;i++)
             for(int j=;j<N;j++)
                 printf("%d%c",opt[i][j],j+==N?'\n':' ');
     return ;
 }
 int main()
 {
     scanf("%d%d",&M,&N);
     for(int i=;i<M;i++)
         for(int j=;j<N;j++)
         {
             scanf("%d",&tile[i][j]);
         }
     solve();
     return ;
 }