poj2965 The Pilots Brothers' refrigerator（直接计算或枚举Enum+dfs）

转载请注明出处：http://blog.csdn.net/u012860063?

viewmode=contents

题目链接：http://poj.org/problem?

id=2965

----------------------------------------------------------------------------------------------------------------------------------------------------------

欢迎光临天资小屋：http://user.qzone.qq.com/593830943/main

----------------------------------------------------------------------------------------------------------------------------------------------------------

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

转载（）：

证明:要使一个为'+'的符号变为'-',必须其对应的行和列的操作数为奇数;

能够证明,假设'+'位置相应的行和列上每个位置都进行一次操作,则整个图仅仅有这一'+'位置的符号改变,其余都不会改变.

> 设置一个4*4的整型数组,初值为零,用于记录每一个点的操作数,那么在每一个'+'上的行和列的的位置都加1,得到结果模2

(由于一个点进行偶数次操作的效果和没进行操作一样,这就是楼上说的取反的原理),

然后计算整型数组中一的

> 个数即为操作数,一的位置为要操作的位置(其它原来操作数为偶数的由于操作并不发生效果,因此不进行操作)

代码一例如以下：（直接计算结果）

#include <iostream>
#include <cstring>
using namespace std;
int map[5][5];
int ans;
char a[8];
void count(int i,int j)
{
	int k;
	for(k=0;k<4;k++)
	{
		map[i][k]++;
		map[k][j]++;
	}
	map[i][j]--;//由于上面的for进行了两次map[i][j]++操作。此处减掉一次
}
void result()
{
	ans=0;
	int i,j;
	for(i=0;i<4;i++)
		for(j=0;j<4;j++)
			ans+=map[i][j]%2;
}
void output()
{
	cout<<ans<<endl;
	int i,j;
	for(i=0;i<4;i++)
		for(j=0;j<4;j++)
			if(map[i][j]%2==1)
				cout<<i+1<<' '<<j+1<<endl;
}
int main()
{
	memset(map,0,sizeof(map));
	int i;
	int j;
	for(i=0;i<4;i++)
	{
		cin>>a;
		for(j=0;j<4;j++)
			if(a[j]=='+')
				count(i,j);
	}
	result();
	output();
	return 0;
}

代码二（Enum+dfs）例如以下：

#include <cstring>
#include <iostream>
using namespace std;
//本题因为要输出每次翻转的棋子，因此不适宜用BFS，应该使用DFS输出完整路径
bool lock[10][10];
//实际仅仅用了当中的row3：→row6。col3:→col6。
bool flag;
int step;
int ri[17],cj[17];
bool isopen()
{
	for(int i = 3; i < 7; i++)
	{
		for(int j = 3; j < 7; j++)
		{
			if(lock[i][j]!=true)
				return false;
		}
	}
	return true;
}
void flip(int row, int col)//改变状态
{
	lock[row][col] = !lock[row][col];
	for(int i = 3; i < 7; i++)
	{
		lock[i][col] = !lock[i][col];
	}
	for(int j = 3; j < 7; j++)
	{
		lock[row][j] = !lock[row][j];
	}
	return ;
}
void dfs(int row, int col, int deep)
{
	if(step == deep)
	{
		flag = isopen();
		return;
	}
	if(flag || row == 7)
		return;
	flip(row,col);
	ri[deep] = row;//记录路径
	cj[deep] = col;
	if(col < 6)
		dfs(row,col+1,deep+1);
	else
		dfs(row+1,3,deep+1);//从3開始的
	flip(row,col);//假设不符合状态就改回来
	if(col < 6)
		dfs(row,col+1,deep);
	else
		dfs(row+1,3,deep);
	return;
}
int main()
{
	char temp;
	int i, j;
	memset(lock,false,sizeof(lock));
	for(i = 3; i < 7; i++)
	{
		for(j = 3; j < 7; j++)
		{
			cin>>temp;
			if(temp == '-')
			{
				lock[i][j] = true;
			}
		}
	}
	for(step = 0; step <= 16; step++)//枚举步数
	{
		dfs(3,3,0);
		if(flag)
			break;
	}
	cout<<step<<endl;
	for(i = 0; i < step; i++)
	{
		cout<<ri[i]-2<<' '<<cj[i]-2<<endl;
	}
	return 0;
}