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

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 using namespace std;
 int x, y;
 bool g[][];
 bool k[][];
 bool ans[][];
 bool flag;
 int d[][] = {{,-},{,},{-,},{,},{,}};
 bool judge(int cur)
 {
     for(int i = ; i <= x; i++)
         for(int j = ; j <= y; j++)
         {
             k[i][j] = g[i][j];
         }
     for(int j = ; j < y; j++)
     {
         k[][j+] = (cur>>j)%;
     }

     for(int i = ; i <= x; i++)
         for(int j = ; j <= y; j++)
         {
             if(k[i-][j] == false)    continue;
             ans[i][j] = true;
             for(int z = ; z <= ; z++)
             {
                 k[i+d[z][]][j+d[z][]] = !k[i+d[z][]][j+d[z][]];
             }
         }

     for(int j = ; j <= y; j++)
     {
         if(k[x][j])    return false;
     }
     return true;
 }
 int main()
 {
 //    freopen("in.in","r",stdin);
     while(scanf("%d%d",&x,&y)!=EOF)
     {
         flag = false;
         for(int i = ; i <= x; i++)
             for(int j = ; j <= y; j++)
             {
                 scanf("%d",&g[i][j]);
             }
         for(int i = ; i < (<<y); i++)
         {
             memset(ans,,sizeof(ans)); 

             if(judge(i))
             {
                 flag = true;
                 break;
             }    

         }
         if(flag)
         {
             for(int i = ; i <= x; i++)
             {
                 cout<<ans[i][];
                 for(int j = ; j <= y; j++)
                 {
                     cout<<" "<<ans[i][j];
                 }
                 printf("\n");
             }
         }
         else    printf("IMPOSSIBLE\n");
     }

     return ;
 }