PKU ACM 1753 第一道bsf算法

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

Sample Output

4

解题思路：

这是一道搜索题目，搜索题目设计各个状态的表示方法是比价重要的，将不同的状态按照一定的规则编码，然后在不同状态下切换就是在不

同编码下转换。

如果将16个格子，理解为一个十六进制的数，第一行是最高位，最末行最低位，w表示0，b表示1，那么所有状态就是0-65535 我们可以用数组保存从当前状态 到任意一个状态的最少步骤。当执行下一次搜索的时候，翻转上下左右的操作，可以使用对应位的异或来实现，然后进入下一个状态。

代码如下：

#include <iostream>
#include <queue>
using namespace std;
#define MAXSTATUS 65535
#define ALLSAME(X) X==0 || X == MAXSTATUS

unsigned int oxrMatrix[] = 
{
	0xC800,0xE400,0x7200,0x3100,
	0x8C80,0x4E40,0x2720,0x1310,
	0x08c8,0x04E4,0x0272,0x0131,
	0x008c,0x004E,0x0027,0x0013,

};

unsigned int allStatus[MAXSTATUS];

int bsf(unsigned int c)
{
	int i;
	unsigned int tmp;
	queue<unsigned int> statuses;
	statuses.push(c);
	while(!statuses.empty())
	{
		c = statuses.front();
		statuses.pop();
		for( i = 0; i < 16; i++)
		{
			tmp = c ^ oxrMatrix[i];
			if(ALLSAME(tmp))
			{
				return allStatus[c] + 1;
			}
			if(!allStatus[tmp]) // current status is not visited before
			{
				allStatus[tmp] = allStatus[c] + 1;
				statuses.push(tmp);
			}

		}
	}
	return 0;
}
int main()
{
	int i;

	unsigned int status = 0;
	char tmpC;
	int nStep;
	while(cin>>tmpC)
	{
		if(tmpC == 'b')
		{
			status = 1;
		}
		for( i = 1; i < 16; i++)
		{
			cin>>tmpC;
			status *= 2;
			if(tmpC == 'b')
			{
				status += 1;
			}
		}
		if(ALLSAME(status))
		{
			cout<<"0\n"<<endl;
		}
		else
		{
			memset(allStatus,0,sizeof(allStatus));
			nStep = bsf(status);
			if(!nStep)
			{
				cout<<"Impossible\n"<<endl;
			}
			else
			{
				cout<<nStep<<endl;
			}
		}
	}
	return 0;
}