POJ1753(枚举)题解

POJ1753(枚举)

题目

Flip Game
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 65856 Accepted: 26995
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).

题意

棋盘上4*4的区域上每个格子分别有一个双面棋子，可以为白色或黑色，从初始状态开始，每一轮可以翻转选定棋子及其上下左右的棋子。问最终能否翻转为全白或全黑，若能则输出最小轮数。

分析

由于只有一种翻转的方式，对于每个棋子而言，翻转奇数次的效果是变换颜色，偶数次的效果是不变。所以我们可以认为每个棋子只能翻转一次，且每个棋子的翻转顺序并不影响最后的结果，所以棋盘总共只有2^16，即65536种翻转方法。枚举每一种方法即可得出答案。

代码

#include <iostream>
#include <algorithm>

using namespace std;

int g[7][7];
int res = 20;
bool flag = false;

int fan(int n, int m)  //翻转函数 
{
	g[n][m] = (g[n][m] + 1) % 2;
	g[n - 1][m] = (g[n - 1][m] + 1) % 2;
	g[n][m + 1] = (g[n][m + 1] + 1) % 2;
	g[n + 1][m] = (g[n + 1][m] + 1) % 2;
	g[n][m - 1] = (g[n][m - 1] + 1) % 2;
}
bool pan()  //判断函数 
{
	int k = 0;
	for (int i = 1; i <= 4; i ++ )
	{
		for (int j = 1; j <= 4; j ++ )
		{
			k += g[i][j];
		}
	}
	if (k == 16 || !k) return true;
	else return false;
}
void meiju(int n, int m, int freq)  //枚举 
{
	for (int i = 1; i <= 4; i ++ )
	{
		for (int j = 1; j <= 4; j ++ )
		{
			if (i < n || i == n && j <= m)
				continue;
			fan(i,j);
			if (pan())
			{
				res = min(freq, res);
				flag = true;
			}
			else meiju(i,j,freq + 1);
			fan(i,j);
		}
	}
}

int main()
{
	for (int i = 1; i <= 4; i ++ )
	{
		for (int j = 1; j <= 4; j ++ )
		{
			char c;
			cin >> c;
			if (c == 'b') g[i][j] = 1;
		}
	}
	if (pan()) flag = true, res = 0;
	else meiju(0,0,1);
	if (flag) cout << res << endl;
	else cout << "Impossible" << endl;
	return 0;
}