POJ1753 搜索

Flip Game

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

思路：用数字来记录棋盘的状态，1代表黑子，0代表白子，可用16位的二进制数表示棋盘状态。则对每个位置的翻子操作结果可以用翻子周围数字之和去异或原数字来表示。

eg：原数字为32如下：翻子（3，1）即32^(2^3+2^6+2^7+2^11）结果：

wwww　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　wwww
wwww　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　bwww

wwbw　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　bbbw

wwww　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　bwww
目标数字为0或65535.

#include "cstdio"

#include "algorithm"

#include "queue"

#include "cmath"

#include "cstring"

#define  inf 0x3f3f3f

using namespace std;

int g[];

char s[][];

bool use[];

typedef  struct {

    int st,s;

}N;

int bfs(int s){

    queue<N>q;

    N no,ne;

    memset(use, false, sizeof(use));

    no.st=s,no.s=;

    q.push(no);

    use[s]=true;

    while (q.size()){

        no=q.front();

        q.pop();

        if(no.st==||no.st==){

            return no.s;

        }

        for(int i=;i<;i++){

            ne.st=no.st^g[i];

            ne.s=no.s+;

            if(use[ne.st]){

                continue;

            }

            if(ne.st==||ne.st==){

                return  ne.s;

            }

            use[ne.st]= true;

            q.push(ne);

        }

    }

    return -;

}

int main()

{

    memset(g,, sizeof(g));

    for(int i=;i<;i++){／／存储16个翻子操作

        int n=-i;

        g[i]=pow(,n);

        if(n+<=n/*+){

            g[i]+=pow(,n+);

        }

        if(n->=n/*){

            g[i]+=pow(,n-);

        }

        if(n+<=){

            g[i]+=pow(,n+);

        }

        if(n->=){

            g[i]+=pow(,n-);

        }

    }

    while (scanf("%s",s[])!=EOF){

        for(int i=;i<;i++){

            scanf("%s",s[i]);

        }

        int st=;

        for(int i=;i<;i++){／／将初始状态转为数字

            for(int j=;j<;j++){

                st<<=;

                if(s[i][j]=='b'){

                    st++;

                }

            }

        }

        int x=bfs(st);

        if(x==-){

            printf("Impossible\n");

        }else{

            printf("%d\n",x);

        }

    }

    return ;

}

巴特西

POJ1753 搜索

最新文章

热门文章