poj_1753

poj_1753

基础搜索题。一共就16颗棋子，共有2^16种情况，我们遍历从翻0颗棋子到翻16颗棋子，对于棋盘上的每一颗棋子，我们都有两种选择，翻或者不翻，做完该选择以后我们又面临两种可能，同一行的下一个棋子或者下一行的第一个棋子。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-10
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll __int64
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
int n,m,k;
#define N 8080
int mp[8][8];
int num;
int flag;
bool check(){
    int c = mp[0][0];
    for(int i=0;i<4;i++)
        for(int j=0;j<4;j++){
            if(mp[i][j]!=c)return false;
        }
    return true;
}
void operation(int x,int y){
    mp[x][y] = 1-mp[x][y];
    if(x-1>=0) mp[x-1][y] = 1-mp[x-1][y];
    if(x+1<4) mp[x+1][y] = 1-mp[x+1][y];
    if(y-1>=0) mp[x][y-1] = 1-mp[x][y-1];
    if(y+1<4) mp[x][y+1] = 1-mp[x][y+1];
}
void dfs(int x,int y,int d){
    if(d == num){
        if(check())
            flag = 1;
        return;
    }
    if(x>=4) return;
    operation(x,y);
    if(y+1<4)
        dfs(x,y+1,d+1);
    else
        dfs(x+1,0,d+1);
    if(flag) return;
    operation(x,y);
    if(y+1<4)
        dfs(x,y+1,d);
    else
        dfs(x+1,0,d);
    return;
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    char ch[8];
    while(scanf("%s",ch)!=EOF){
        for(int i=0;i<4;i++)
            mp[0][i] = (ch[i]=='b'?1:0);
        for(int i=1;i<4;i++){
            sfs(ch);
            for(int j=0;j<4;j++)
                mp[i][j] = (ch[j]=='b'?1:0);
        }
        for(num=0;num<=16;num++){
            flag = 0;
            dfs(0,0,0);
            if(flag){
                break;
            }
        }
        if(num>16) printf("Impossible\n");
        else
            printf("%d\n",num);
    }
return 0;
}