【POJ 3279 Fliptile】 + 反转 开关问题

Fliptile
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 8221 Accepted: 3072

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

每一次反之当前位置总会连到相邻边～换个角度思考～其实只要第一行的反转方案确定～实际上就已经决定了本次的反转翻案～枚举第一行的所有可能方案～依次推出剩下的反转翻案（这里面也是有技巧的具体看代码～实现）～然后判断本方案是否可解～输出最少反转次数～反之返回 -1～最后每次更新保存最优解即可～～

AC代码：

#include<cstdio>
#include<cstring>
using namespace std;
int fx[5] = {0,0,0,-1,1},fy[5] = {1,-1,0,0,0};
int N,M,ma[20][20],pa[20][20],vis[20][20];
int get(int x,int y){
    int sum = ma[x][y];
    for(int i = 0 ; i < 5 ; i++){
        int ex = x + fx[i],ey = y + fy[i];
        if(ex >= 0 && ey >=0 && ex < M && ey < N)
            sum += vis[ex][ey];
    }
    return sum % 2; // 改点是否仍需要反转
}
int CA(){
   for(int i = 1 ; i < M ; i++)
       for(int j = 0 ; j < N ; j++)
           if(get(i - 1 , j) != 0) // 改点上面的那个是黑色的话，这是最后的机会反转它
               vis[i][j] = 1;
   for(int i = 0 ; i < N ; i++) // 判断最后一行是否为全白
        if(get(M - 1 , i) != 0)
            return -1;
   int cut = 0;
   for(int i = 0 ; i < M ; i++)
       for(int j = 0 ; j < N ;j++)
          cut += vis[i][j];
   return cut;
}
void solve(){
    int ans = -1;
    for(int i = 0 ; i < 1 << N ; i++){ // 按字典序尝试第一行所有的可能
        memset(vis,0,sizeof(vis));
        for(int j = 0 ; j < N; j++)
            vis[0][N - j - 1] = i >> j & 1; // 判断 j 元素是否在 i ”集合“中
        int num = CA();
        if(num >=0 && (ans < 0 || ans > num)){
            ans = num;
            memcpy(pa,vis,sizeof(vis)); // 保存最优解
        }
    }
    if(ans < 0) printf("IMPOSSIBLE\n");
    else{
        for(int i = 0 ; i < M; i++)
            for(int j = 0 ; j < N ; j++)
                printf("%d%c",pa[i][j],j + 1 == N ? '\n' : ' ');
    }
}
int main()
{
    while(scanf("%d %d",&M,&N) != EOF){
        for(int i = 0 ; i < M ; i++)
            for(int j = 0 ; j < N ;j++)
                scanf("%d",&ma[i][j]);
        solve();
    }
}