755:Flip Game

总时间限制: 

1000ms

内存限制: 

65536kB

描述

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).

1. 从 16 件作品中选择任何一件。
2. 将所选棋子以及所选棋子的左侧、右侧、顶部和底部（如果有）翻转所有相邻的棋子。

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.

输入

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

输出

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).

样例输入

bwwb
bbwb
bwwb
bwww

样例输出

4

题目翻译

总时间限制: 

1000ms

内存限制： 

65536kB

描述

翻转游戏在一个矩形的 4x4 场地上进行，在其 16 个方格中的每一个上放置双面棋子。每块的一侧是白色的，另一侧是黑色的，每块都是黑色或白色的一面朝上。每回合你翻转 3 到 5 个棋子，从而将它们上面的颜色从黑色变为白色，反之亦然。每轮根据以下规则选择要翻转的棋子：

1. 从 16 件作品中选择任何一件。
2. 将所选棋子以及所选棋子的左侧、右侧、顶部和底部（如果有）翻转所有相邻的棋子。

以以下位置为例：

bwbw wwww

bbwb bwwb

这里“b”表示黑色面朝上的棋子，“w”表示白色面朝上的棋子。如果我们选择从第 3 行翻转第 1 个棋子（这个选择如图所示），那么字段将变为：

bwbw
bwww wwwb
wwwb

游戏的目标是将所有棋子的白色面朝上翻转或所有棋子的黑色面朝上。您将编写一个程序，该程序将搜索实现此目标所需的最小轮数。

输入

输入由 4 行组成，每行有 4 个字符“w”或“b”，表示游戏场地位置。

输出

在输出文件中写入一个整数 - 从给定位置实现游戏目标所需的最小回合数。如果最初实现了目标，则写 0。如果无法实现目标，则写下“不可能”一词（不带引号）。

样例输入

bwwb
bbwb
bwwb
bwww

样例输出

4

来源

东北欧 2000

解题代码

#include<bits/stdc++.h>
using namespace std;
bool abl[5][5];
int ansit = 2147483647;
void changevd(int xit,int yit)
{
	abl[xit][yit] = !abl[xit][yit];
	abl[xit + 1][yit] = !abl[xit + 1][yit];
	abl[xit - 1][yit] = !abl[xit - 1][yit];
	abl[xit][yit + 1] = !abl[xit][yit + 1];
	abl[xit][yit - 1] = !abl[xit][yit - 1];
	return;
}

bool allbl()
{
	bool tbl = abl[1][1];
	for(int it = 1;it <= 4;it++)
	{
		for(int jit = 1;jit <= 4;jit++)
		{
			if(tbl != abl[it][jit])
			{	
				return false;
			}
		}
	}
	return true;
}

void fvd(int xit,int yit,int resultit)
{
	if(xit == 4 && yit == 5)
	{
		if(allbl())
		{
			ansit = min(resultit,ansit);
		}
		return;
	}else if(xit != 4 && yit == 5)
	{
		yit = 1;
		xit++;
	}
	changevd(xit,yit);
	fvd(xit,yit+1,resultit+1);
	changevd(xit,yit);
	fvd(xit,yit+1,resultit);
}
int main()
{
	for(int it = 1;it<=4;it++)
	{
		for(int jit = 1;jit<=4;jit++)
		{
			char kcr = getchar();
			if(kcr == 'w')
			{
				abl[it][jit] = true;
			}else
			{
				abl[it][jit] = false;
			}
		}
		getchar();
	}
	fvd(1,1,0);
	if(ansit == 2147483647)
	{
		cout<<"Impossible";
	}else
	{
		cout<<ansit;
	}
	
	return 0;
}