【POJ1753】Flip Game(位压缩+bfs)

记录一个菜逼的成长。。

PS:对于位压缩接触不是很多，继续学习~

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
#include <cctype>
#include <bitset>
#include <cmath>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define cl(a,b) memset(a,b,sizeof(a))
#define bp __builtin_popcount
#define pb push_back
#define mp make_pair
#define fin freopen("D://in.txt","r",stdin)
#define fout freopen("D://out.txt","w",stdout)
#define lson t<<1,l,mid
#define rson t<<1|1,mid+1,r
#define seglen (node[t].r-node[t].l+1)
#define pi 3.1415926
#define exp  2.718281828459
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef vector<PII> VPII;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
template <typename T>
inline void read(T &x){
    T ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    x = ans;
}
inline bool DBread(double &num)
{
    char in;double Dec=0.1;
    bool IsN=false,IsD=false;
    in=getchar();
    if(in==EOF) return false;
    while(in!='-'&&in!='.'&&(in<'0'||in>'9'))
        in=getchar();
    if(in=='-'){IsN=true;num=0;}
    else if(in=='.'){IsD=true;num=0;}
    else num=in-'0';
    if(!IsD){
        while(in=getchar(),in>='0'&&in<='9'){
            num*=10;num+=in-'0';}
    }
    if(in!='.'){
        if(IsN) num=-num;
            return true;
    }else{
        while(in=getchar(),in>='0'&&in<='9'){
                num+=Dec*(in-'0');Dec*=0.1;
        }
    }
    if(IsN) num=-num;
    return true;
}
template <typename T>
inline void write(T a) {
    if(a < 0) { putchar('-'); a = -a; }
    if(a >= 10) write(a / 10);
    putchar(a % 10 + '0');
}
/******************head***********************/
int vis[70000];
struct Node{
    int statu,step;
    Node(){}
    Node(int a,int b):statu(a),step(b){}
}cur;
char g[10];
//有16位的二进制，代表棋盘的对应位置，初始全部为0，每一次翻子，将相应的上下左右设为1，得到16种状态转换数
int change[16] =   //16种状态转换，对应4*4的翻子位置
{
     51200,58368,29184,12544,
     35968,20032,10016,4880,
     2248,1252,626,305,
     140,78,39,19
};
int bfs(int st)
{
    queue<Node>q;
    cl(vis,0);
    cur.statu = st;
    cur.step = 0;
    q.push(cur);
    vis[st] = 1;
    while(!q.empty()){
        Node f = q.front();q.pop();
        //cout<<f.statu<<' ';
        //65535位全黑， 0为全白
        if(f.statu == 65535 || f.statu == 0)return f.step;
        for( int i = 0; i < 16; i++ ){
            int tstatu = f.statu ^ change[i];//翻子后的状态
            int tstep = f.step + 1;//相应的步数加1
            if(vis[tstatu])continue;
            if(tstatu == 65535 || tstatu == 0)return tstep;
            vis[tstatu] = 1;
            q.push(Node(tstatu,tstep));
        }
    }
    return -1;
}
int main()
{
    while(~scanf("%s",g)){
        int status = 0;
        for( int i = 0; i < 4; i++ ){
            status <<= 1;
            if(g[i] == 'b'){
                status += 1;
            }
        }
        for( int i = 0; i < 3; i++ ){
            scanf("%s",g);
            for( int j = 0; j < 4; j++ ){
                status <<= 1;
                if(g[j] == 'b')status += 1;
            }
        }
        //获得初始状态。
        //cout<<status<<endl;
        int ans = bfs(status);
        if(ans == -1)printf("Impossible\n");
        else printf("%d\n",ans);
    }
    return 0;
}