链接：http://poj.org/problem?id=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的格子，可以用二进制的0、1表示每个格子的黑白，第i个格子为黑即第i位的二进制数为1。这样16个格子需要16位二进制，即一共有2^16-1个状态。从初始状态开始枚举每一种状态改变16个格子的颜色所能导致的状态。出现16位全1或者全0就输出Impossible。
代码：
#include <iostream>
#include <stdio.h>
#include <queue>
#include <string.h>
using namespace std;
#define MAXX (1<<16)
bool flag[MAXX];
int step[MAXX];
queue<int> que;
void input()
{
int state=;
char ch;
int i;
for(i=;i<MAXX;i<<=)
{
scanf("%c",&ch);
if(ch=='\n')
scanf("%c",&ch);
if(ch=='b')
state+=i;
}
que.push(state);
memset(flag,false,sizeof(flag));
memset(step,,sizeof(step));
flag[state]=true;
//printf("%d ",state);
}
void change(int n,int state)
{
int temp=state;
if(n->=)
state^=(<<(n-));
if(n+<)
state^=(<<(n+));
if(n!=&&n!=&&n!=&&n!=)
state^=(<<(n-));
if(n!=&&n!=&&n!=&&n!=)
state^=(<<(n+));
state^=(<<n);
if(!flag[state])
{
flag[state]=true;
que.push(state);
step[state]=step[temp]+;
}
}
void getall()
{
int state;
int i;
while(!que.empty())
{
state=que.front();
if(state==||state==MAXX-)
{
printf("%d\n",step[state]);
return;
}
que.pop();
for(i=;i<;i++)
{
change(i,state);
}
}
printf("Impossible\n");
}
int main()
{
input();
getall();
return ;
}