poj 1753 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

4

题目描述:一个4*4的棋盘,有一种黑白两面的棋子,翻一个棋子的时候他周边的棋子也会被影响到,输入初始情况,问翻到全黑或全白的时候最少需要翻几次.

思路:和熄灯差不多,枚举第一行的情况,然后推算剩下行的情况.

代码

#include <cstring>
#include <cstdio>
using namespace std;
int Min(int a[][6],int m){
    int success,steps,minstep=9999,b[6][6];
    memset(b,0,sizeof(b));
    while(b[1][5]!=1){
        steps=0,success=1;
        for(int i=1;i<4;i++)
            for(int j=1;j<5;j++){
                b[i+1][j]=(a[i][j]+b[i][j]+b[i-1][j]+b[i][j+1]+b[i][j-1]+m)%2;
                if(b[i+1][j]==1)
                    steps++;
            }

        for(int j=1;j<5;j++){
                if((a[4][j]+b[3][j]+b[4][j]+b[4][j-1]+b[4][j+1])%2!=m){
                    success=0;
                    break;
                }
            }
        if(success){
            for(int j=1;j<5;j++)
                if(b[1][j]==1)
                steps++;

        if(steps<minstep)
            minstep=steps;
        }
        b[1][1]++;
        for(int i=1;i<5;i++){
            if(b[1][i]>1){
                b[1][i]=0;
                b[1][i+1]++;
            }
        }
    }
    return minstep;
}
int main()
{
    char ch;
    int minw,minb,a[6][6];
    memset(a,0,sizeof(a));
    for(int i=1;i<5;i++){
        for(int j=1;j<5;j++){
            if((ch=getchar())=='w')
                a[i][j]=0;
            else a[i][j]=1;
        }
        getchar();
    }
    minw=Min(a,0);
    minb=Min(a,1);

    if(minw==9999&&minb==9999)
        printf("Impossible\n");
    else{
        if(minw<minb)
            minb=minw;
        printf("%d\n",minb);
    }

    return 0;
}

定义了一个min函数用来返回最少步数,m为0或1,分别算翻到全白的步数和全黑的步数.第一行的情况用二进制来模拟.

这题一遍过,太高兴了!! XD