POJ - 3279（枚举+暴力）

Fliptile

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 14297		Accepted: 5257

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

Source

USACO 2007 Open Silver

 

时隔一年，终于又开始A题了。。。

又要重新拾起来，好多东西都忘了。。。

 

题意：有一个m*n的棋盘，每一个棋子都是一面黑色（1表示），一面白色（0表示），每次翻一颗棋子时，他的上下左右四个也随着翻过来，目标是翻成全是白色的，问用最少的次数达到目标时，都是要翻哪些棋子。

题目归到了搜索里面，想了好久也没想出来。

 

因为棋子只有黑色和 白色，所以翻一次时会变成另一个颜色，翻两次就变回原来的颜色了，所以每个棋子都可以看作只有翻和不翻两种状态。

最暴力的想法是枚举m*n个棋子的状态，每一个棋子都是有两种状态，时间复杂度就是2^(m*n),这样太大了，肯定不行。

看了几个题解，都是写了思路，但是具体为什么这样做好像解释的不太清楚。

思路：因为翻每一个棋子，都会导致他的上下左右的棋子变化，如果想让1变成0，可以翻他的旁边的棋子来达到目的，（统一按照翻它下方的棋子），如果从第一行往下赶，赶到最后一行，上面的m-1行肯定都是0了，所以只需要解决最后一行就行了，而最后一行最多15位，枚举就行了，时间复杂度是2^15。

枚举是借助二进制，00001代表只翻最后一个，+1之后是00010,代表翻倒数第二个。。。

我写的代码是先枚举第一行，然后往下赶，再看最后一行是不是全是0.

 

 

 

 

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int m,n;

bool right(int i,int j){
    if(i>=0&&i<m&&j>=0&&j<n){
        return true;
    }else{
        return false;
    }
}

void flip(char grid[][16],int i,int j){
    int ii=i,jj=j;

    if(grid[ii][jj]=='1'){
        grid[ii][jj]='0';
    }else{
        grid[ii][jj]='1';
    }

    ii=i+1,jj=j;
    if(right(ii,jj)){
        if(grid[ii][jj]=='1'){
            grid[ii][jj]='0';
        }else{
            grid[ii][jj]='1';
        }
    }

    ii=i-1,jj=j;
    if(right(ii,jj)){
        if(grid[ii][jj]=='1'){
            grid[ii][jj]='0';
        }else{
            grid[ii][jj]='1';
        }
    }

    ii=i,jj=j+1;
    if(right(ii,jj)){
        if(grid[ii][jj]=='1'){
            grid[ii][jj]='0';
        }else{
            grid[ii][jj]='1';
        }
    }

    ii=i,jj=j-1;
    if(right(ii,jj)){
        if(grid[ii][jj]=='1'){
            grid[ii][jj]='0';
        }else{
            grid[ii][jj]='1';
        }
    }

}

int main()
{
    char reserve[16][16];
    char grid[16][16];
    char result[16][16];
    char output[16][16];
    int bin[16];
    scanf("%d %d",&m,&n);
    getchar();
    for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            scanf("%c",&reserve[i][j]);
            getchar();
        }
    }
    int coun=1<<n;

    int mincou=99999;
    for(int iii=0;iii<coun;iii++){

        memcpy(grid,reserve,sizeof(reserve));
        memset(result,'0',sizeof(result));

        int cou=0;
        int t=iii;
        int b_i=0;
        bin[0]=0;

        while(t){
            bin[b_i]=t%2;
            t/=2;
            result[0][b_i]='0'+bin[b_i];
            b_i++;
        }
        for(int i=0;i<n;i++){
            if(result[0][i]=='1'){
                cou++;
                flip(grid,0,i);
            }
        }

        for(int i=0;i<m-1;i++){
            for(int j=0;j<n;j++){
                if(grid[i][j]=='1'){
                    flip(grid,i+1,j);
                    result[i+1][j]='1';
                    cou++;
                }
            }
        }
        bool f=true;
        for(int i=0;i<n;i++){
            if(grid[m-1][i]=='1'){
                f=false;
                break;
            }
        }
        if(f==true){
            if(cou<mincou){
                mincou=cou;
                memcpy(output,result,sizeof(result));
            }else if(cou==mincou){
                bool flag=true;
                for(int i=0;i<m;i++){
                    for(int j=0;j<n;j++){
                        if(output[i][j]>result[i][j]){
                            break;
                        }else if(output[i][j]<result[i][j]){
                            flag=false;
                            break;
                        }
                    }
                }
                if(flag){
                    memcpy(output,result,sizeof(result));
                }
            }
        }
    }

    if(mincou==99999){
        printf("IMPOSSIBLE\n");
    }else{
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if((i==m-1) && (j==n-1)){
                    printf("%c",output[i][j]);
                }else{
                    printf("%c ",output[i][j]);
                }
            }
            if(i!=m-1){
                printf("\n");
            }

        }
    }


    return 0;
}