[kuangbin带你飞]专题一 简单搜索 D - Fliptile poj 3279

D - Fliptile

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  POJ 3279

Appoint description:  System Crawler  (2015-11-08)

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

题意：黑白的板，每次选择一个十字形翻转（十字板内黑白互换，若是边界则不管），

求最小将原图变为全白的策略。

题解：枚举第一行翻转情况，2^c，然后验证，由于第一行确定了，

后面就可以跟着确定了。

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
using namespace std;
int a[20][20];
int b[20][20];
int map[20][20],f[20][20];
int n,m,flag,mixn,maxn;
int sum=0;
void fz(int i,int j)    ///翻转
{
    a[i][j]^=1;
    a[i-1][j]^=1;
    a[i+1][j]^=1;
    a[i][j+1]^=1;
    a[i][j-1]^=1;
    map[i][j]=1;
}


int pan()  ///判断
{
    int i,j;

    for(i=2; i<=m; i++)
    {
        for(j=1; j<=n; j++)
        {
            if(a[i-1][j])
            {
                fz(i,j);
            }
        }
    }

    int ans=0,cnt=0;
    for(i=1; i<=m; i++)
    {
        for(j=1; j<=n; j++)
        {
            cnt+=map[i][j];
            ans=ans*2+map[i][j];
            if(a[i][j]) return 0;
        }
    }
    flag=1;
    if(cnt<=maxn)
    {
        if(cnt
      
      
       
       
         j) { memset(map,0,sizeof(map)); h[i]=1; for(k=1; k<=n; k++) { if(h[k]) { fz(1,k); } } pan(); for(r=1; r<=m; r++) { for(k=1; k<=n; k++) { a[r][k]=b[r][k]; } } dfs(i,h); h[i]=0; } } return ; } int main() { int i,j,k; while(~scanf("%d%d",&m,&n)) { flag=0; mixn=1<<17; maxn=400; memset(map,0,sizeof(map)); for(i=1; i<=m; i++) { for(j=1; j<=n; j++) { scanf("%d",&b[i][j]); a[i][j]=b[i][j]; } } pan(); /// 直接判断 for(i=1; i<=m; i++) { for(j=1; j<=n; j++) { a[i][j]=b[i][j]; } } int h[20]= {0}; dfs(0,h); ///枚举 if(flag) { for(i=1; i<=m; i++) { for(j=1; j<=n-1; j++) { printf("%d ",f[i][j]); } printf("%d\n",f[i][j]); } } else { printf("IMPOSSIBLE\n"); } } return 0; }