牛客 1.16 Flip Game（暴力，dfs)

第16节 Flip Game
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.

输入描述:

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).
示例1
输入
bwwb
bbwb
bwwb
bwww
输出
4

---

要求把棋盘的棋子翻成同一颜色的，如果可以就输出最少步数，否则“Impossible”

思路：
数据范围很小，只需要考虑16个棋子的正反两种状态，最多为2^16

直接暴力dfs, 对每个棋子，每种状态扫一遍，如果期间出现目标状态，则记录翻动的最小次数，如果16个棋子都dfs一遍后都没有出现目标状态，说明impossible，这时，最小次数还是初始值，这个最小值初始化时只要大于16即可。

//#include <bits/stdc++.h>
#include <iostream>

using namespace std;
typedef long long ll;
int mp[5][5];
int minn=20;
bool check( )//判目标局面
{
	for(int i=0;i<=3;i++)
	{
		for(int j=0;j<=3;j++)
		{
			if(mp[i][j]!=mp[0][0])
			return false;
		}
	}
	return true;
}

void fan(int x,int y)//翻动
{
	mp[x][y]=!mp[x][y];
	if(y-1>=0) mp[x][y-1]=!mp[x][y-1];//下
	if(y+1<=3) mp[x][y+1]=!mp[x][y+1];//上
	if(x-1>=0) mp[x-1][y]=!mp[x-1][y];//左
	if(x+1<=3) mp[x+1][y]=!mp[x+1][y];//右 
}

void dfs(int x,int y,int cot)
{
	//if(cot>16) return ;//当x=4,但是cot<16时会继续执行
	if(check()) 
	{
		if(cot<minn) minn=cot;//维护一个翻动到目标状态的最小次数
		return ;		
	}
	if(x>=4) return ; //这个为跳出的必要条件
	
	fan(x,y);//反转这个棋子
	if(y<3) dfs(x,y+1,cot+1);//一路到底
	else dfs(x+1,0,cot+1);//到底
	
	fan(x,y);//再给翻回来
	if(y<3) dfs(x,y+1,cot);//这一列，x值不变，y++
	else dfs(x+1,0,cot);//到下一列

} 

int main() {
	string s[4];
	for(int i=0; i<=3; i++) {		
		for(int j=0; j<=3; j++) {
			cin>>s[i][j];
			if(s[i][j]=='b')
				mp[i][j]=0;
			else
				mp[i][j]=1;
		}
	}

	dfs(0,0,0);
	if(minn==20) cout<<"Impossible"<<endl;
	else cout<<minn<<endl;
	return 0; 

}

/*
bwwb
bbwb
bwwb
bwww
*/