poj 1753 BFS+位运算（set优化）

Flip Game
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 35828 Accepted: 15638
Description

Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it’s black or white side up. Each round you flip 3 to 5 pieces, thus changing the color of their upper side from black to white and vice versa. The pieces to be flipped are chosen every round according to the following rules:
Choose any one of the 16 pieces.
Flip the chosen piece and also all adjacent pieces to the left, to the right, to the top, and to the bottom of the chosen piece (if there are any).

Consider the following position as an example:

bwbw
wwww
bbwb
bwwb
Here “b” denotes pieces lying their black side up and “w” denotes pieces lying their white side up. If we choose to flip the 1st piece from the 3rd row (this choice is shown at the picture), then the field will become:

bwbw
bwww
wwwb
wwwb
The goal of the game is to flip either all pieces white side up or all pieces black side up. You are to write a program that will search for the minimum number of rounds needed to achieve this goal.
Input

The input consists of 4 lines with 4 characters “w” or “b” each that denote game field position.
Output

Write to the output file a single integer number - the minimum number of rounds needed to achieve the goal of the game from the given position. If the goal is initially achieved, then write 0. If it’s impossible to achieve the goal, then write the word “Impossible” (without quotes).
Sample Input

bwwb
bbwb
bwwb
bwww
Sample Output

4

大概思路就是用0，1表示那个位置是w还是b，然后BFS搜索，每次对16个格子操作为一层，同时把出现过的状态放在set容器里，后续如果状态A在已经在set容器里出现过A，会有两种可能（1，因为是bfs，所以在set里的A的层数小于等于后续出现的A，2，如果等于后续出现的A，则set里的A已经把A的下一层bfs放到了队列里，因而无需再计算后续出现的A的后续BFS状态。3，如果小于后续出现的A，则后续出现的A比之要大，不满足最小操作数，故后续出现的A应当舍弃）且这两种可能都要被舍弃。可知，最终的目标状态是0或者（ (1<<16)-1 ）一旦出现这两种状态，结束BFS，输出结果，反之，若队列为空仍未找到，这输出不可能。

#include <iostream>
#include <cstdio>
#include <bitset>
#include <queue>
#include <set>

using namespace std;

typedef struct{
    int sig;
    int hign;
}St;

int b[] = {0,-4,4,-1,1};

int bfs(St a){
    queue<St> Q;
    set<int> FF;
    FF.insert(a.sig);
    int i,j;
    Q.push(a);
    while(!Q.empty()){
        St tem = Q.front();
        Q.pop();
        if(tem.sig == 0|| tem.sig == 65535) return tem.hign;

        for(i = 0;i<16;i++){
            St Tem = tem;
            for(j = 0;j<5;j++){
                int x,y;
                x = i/4;
                y = i%4;
                Tem.sig ^= 1<<i;
                if(x-1>=0&&x-1<4) Tem.sig ^= 1<<(i+b[1]);
                if(x+1>=0&&x+1<4) Tem.sig ^= 1<<(i+b[2]);
                if(y-1>=0&&y-1<4) Tem.sig ^= 1<<(i+b[3]);
                if(y+1>=0&&y+1<4)Tem.sig ^=1<<(i+b[4]);
            }
            int T;
            T = Tem.sig;
            set<int>::iterator it;
            it = FF.find(T);
            if(it == FF.end()){
                FF.insert(T);
                Tem.hign++;
                Q.push(Tem);
            }

        }
    }
    return -1;
}

int main()
{
//    freopen("data.in","r",stdin);
//    freopen("data.out","w",stdout);
    char c;
    int i,j;
    St a;
    a.sig = 0;
    a.hign = 0;
    for(i = 0;i<16;i++){
        c = getchar();
        if(c == 'b') a.sig ^= 1<<i;
        if((i+1)%4 == 0) getchar();
    }
    int k = bfs(a);
    if(-1 == k) printf("Impossible\n");
    else printf("%d\n",k);

    return 0;
}