POJ2965 The Pilots Brothers' refrigerator(又是翻转问题)

翻转啊翻转

The Pilots Brothers' refrigerator

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 24476		Accepted: 9441		Special Judge

Description

The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.

There are 16 handles on the refrigerator door. Every handle can be in one of two states: open or closed. The refrigerator is open only when all handles are open. The handles are represented as a matrix 4х4. You can change the state of a handle in any location [i, j] (1 ≤ i, j ≤ 4). However, this also changes states of all handles in row i and all handles in column j.

The task is to determine the minimum number of handle switching necessary to open the refrigerator.

Input

The input contains four lines. Each of the four lines contains four characters describing the initial state of appropriate handles. A symbol “+” means that the handle is in closed state, whereas the symbol “−” means “open”. At least one of the handles is initially closed.

Output

The first line of the input contains N – the minimum number of switching. The rest N lines describe switching sequence. Each of the lines contains a row number and a column number of the matrix separated by one or more spaces. If there are several solutions, you may give any one of them.

Sample Input

-+--
----
----
-+--

Sample Output

6
1 1
1 3
1 4
4 1
4 3
4 4

题意是：你要让这个图里面全部的 + 变成  - ，最终整个图都是 - ，但是每次你变动一个格子，它所在的横列和竖列都是翻转一次， + 变 - ， - 变 + 。

所以这道题到底该怎么写呢？我一开始写过类似的题目，是POJ1753，但是他只是相邻的格子会翻转而已，这个确实整个行列，所以运算量是变大，然后就会TLE。

后来，看到别人讨论中有重要的一条消息，就是，比如样例中第一行第二个是+，那个只要他所在的行和列的格子全都翻转一次，就会让当前的 + 变成 - ，但是其他格子全部都不会发生变化！第二个就是，一个格子，以自己为中心翻转，翻转偶数次，相当于没翻转。

这样我们看看样例，为什么是6步？因为第二列的+--+有两个+，让这一列每一个都以自己为中心翻转了两次，所以抵消掉了，就剩下其他六个了。

代码如下:

#include<cstdio>
using namespace std;
int bir[4][4];
char myget()
{
	char ch;
	while(ch=getchar(),ch != '-' && ch != '+');
	return ch;
}

void func(int x,int y)
{
	bir[x][y] = !bir[x][y];
	for(int i = 0; i < 4; i++) 
		bir[x][i] = !bir[x][i];
	for(int i = 0; i < 4; i++) 
		bir[i][y] = !bir[i][y];
}

int main()
{
	int G[4][4];
	char ch;
	int row[4] = {0}, column[4] = {0};
	for(int i = 0; i < 4; i++)
		for(int j = 0; j < 4; j++)
		{
			ch = myget();
			if(ch == '+')
				func(i, j);
		}
	int cout = 0;
	for(int i = 0; i < 4; i++)
		for(int j = 0; j < 4; j++)
			if(bir[i][j])
				cout++;
	printf("%d\n", cout);
	for(int i = 0; i < 4; i++)
		for(int j = 0; j < 4; j++)
			if(bir[i][j])
				printf("%d %d\n",i + 1, j + 1);
	return 0;
} 

79ms水过。。。到时候看看用状态压缩怎么写，但是感觉状态压缩好像还变复杂了。