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: 

1. Choose any one of the 16 pieces. 
   
2. 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

解题思路：

题目大意是硬币用黑白两面，翻转一枚硬币，则周围四个硬币都要翻转，问至少翻转几次让所有硬币都为黑色或白色。由于只有两种状态，所以用0，1标记每种硬币的状态。一共16枚硬币，都枚举一遍也就2^16种，完全可以接受。所以用DFS 检索一遍即可，检索的时候每次记录用的最少次数。

AC代码：

#include<iostream>
#include<cstdio>
using namespace std;
const int maxn = 10, INF = 1000000;
char map[15][15];
int go[16][16];
int dir[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};  // 二维数组定义四个方向
int ans;
bool isok()  // 判断是否全为白色或全为黑色
{
	int i,j,sum=0;
	for (i = 1; i <= 4; i++)
		for (j = 1;j <= 4; j++)
			sum += go[i][j];

	return sum == 0 || sum == 16;
}

void flip(int x,int y)  // 进行翻转，对1进行异或即可
{
	for (int i = 0; i < 4; i++)
		go[x + dir[i][0]][y + dir[i][1]] ^= 1;
	go[x][y] ^= 1;
}

void Dfs(int x,int y,int s)
{
	if (isok())  // 记录最少次数
	{
		ans = min(ans,s);
              return;
	}
	int next_x = x, next_y = y + 1;
	if (next_y > 4)
	{
		next_y = 1;
		next_x++;
	}
	if (next_x > 4)
		return;
<span style="white-space:pre">	</span>flip(next_x,next_y);
<span style="white-space:pre">	</span>Dfs(next_x,next_y,s + 1); // DFS检索，翻一次，次数加1
	flip(next_x,next_y);
	Dfs(next_x,next_y,s);
}

int main()
{
	for (int i = 0; i < 4; i++)
		scanf("%s",map[i]);
	for (int i = 0; i < 4; i++)
		for (int j = 0; j < 4; j++)
			go[i + 1][j + 1] = map[i][j] == 'b' ? 1 : 0;  //状态转化为0，1
	ans = INF;
	Dfs(1,0,0);
	if (ans == INF)
		printf("Impossible\n");
	else
		printf("%d\n",ans);

	return 0;
}