poj2965 The Pilots Brothers' refrigerator

最新推荐文章于 2021-12-30 13:22:39 发布

转载最新推荐文章于 2021-12-30 13:22:39 发布 · 128 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/herumw/p/9464826.html

本文讨论了使用深度搜索解决《飞行员兄弟：跟着条纹大象》游戏中打开冰箱的问题。通过改变矩阵中四个方向任意位置的状态来最小化操作次数。输入包含冰箱初始状态，输出为最小操作数和具体步骤。此题类似于黑白棋翻转问题，通过记录每次路径来求解。

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

这道题和翻黑白棋差不多，用深搜可以做，不同的是要记录每次的路径，可以设个数组b[][].

#include<stdio.h>
#include<string.h>
int step,flag;
char s[10][10];
int b[20][2];
int panduan(char s[10][10]){
	int i,j;
	for(i=0;i<4;i++){
		for(j=0;j<4;j++){
			if(s[i][j]=='+')return 0;
		}
	}
	return 1;
}


void flip(int row,int col)
{
	int i,j;
	for(i=0;i<=3;i++){
		if(s[i][col]=='+')s[i][col]='-';
		else s[i][col]='+';
	}
	for(i=0;i<=3;i++){
		if(s[row][i]=='+')s[row][i]='-';
		else s[row][i]='+';
	}
	if(s[row][col]=='+')s[row][col]='-';
		else s[row][col]='+';
	return;
}


void dfs(int row,int col,int dep)
{
	int i,j;
	if(flag)return;
	if(dep==step){
		flag=panduan(s);return;
	}
	if(flag || row==4)return;
	
	flip(row,col);
	if(col<3){
		b[dep+1][0]=row;
		b[dep+1][1]=col;
		dfs(row,col+1,dep+1);
	}
	else{
		b[dep+1][0]=row;
		b[dep+1][1]=col;
		dfs(row+1,0,dep+1);
	}
	if(flag)return;
	
	flip(row,col);
	if(col<3){
		dfs(row,col+1,dep);
	}
	else dfs(row+1,0,dep);
	return;
}


int main()
{
	int n,m,i,j;
	while(scanf("%s",s[0])!=EOF)
	{
		for(i=1;i<=3;i++){
			scanf("%s",s[i]);
		}
		for(step=1;step<=16;step++){
			memset(b,0,sizeof(b));
			flag=0;
			dfs(0,0,0);
			if(flag)break;
		}
		printf("%d\n",step);
		for(i=1;i<=step;i++){
			printf("%d %d\n",b[i][0]+1,b[i][1]+1);
		}
	}
	return 0;
}

转载于:https://www.cnblogs.com/herumw/p/9464826.html