poj 1222 EXTENDED LIGHTS OUT （高斯消元）

最新推荐文章于 2019-03-29 16:53:39 发布

clover_hxy

最新推荐文章于 2019-03-29 16:53:39 发布

阅读量305

点赞数

分类专栏：高斯消元

本文链接：https://blog.csdn.net/clover_hxy/article/details/54134938

版权

高斯消元专栏收录该内容

23 篇文章 0 订阅

订阅专栏

EXTENDED LIGHTS OUT

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 9822		Accepted: 6369

Description

In an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the actual puzzle has 5 rows of 5 buttons each). Each button has a light. When a button is pressed, that button and each of its (up to four) neighbors above, below, right and left, has the state of its light reversed. (If on, the light is turned off; if off, the light is turned on.) Buttons in the corners change the state of 3 buttons; buttons on an edge change the state of 4 buttons and other buttons change the state of 5. For example, if the buttons marked X on the left below were to be pressed,the display would change to the image on the right.

The aim of the game is, starting from any initial set of lights on in the display, to press buttons to get the display to a state where all lights are off. When adjacent buttons are pressed, the action of one button can undo the effect of another. For instance, in the display below, pressing buttons marked X in the left display results in the right display.Note that the buttons in row 2 column 3 and row 2 column 5 both change the state of the button in row 2 column 4,so that, in the end, its state is unchanged.

Note:
1. It does not matter what order the buttons are pressed.
2. If a button is pressed a second time, it exactly cancels the effect of the first press, so no button ever need be pressed more than once.
3. As illustrated in the second diagram, all the lights in the first row may be turned off, by pressing the corresponding buttons in the second row. By repeating this process in each row, all the lights in the first
four rows may be turned out. Similarly, by pressing buttons in columns 2, 3 ?, all lights in the first 5 columns may be turned off.
Write a program to solve the puzzle.

Input

The first line of the input is a positive integer n which is the number of puzzles that follow. Each puzzle will be five lines, each of which has six 0 or 1 separated by one or more spaces. A 0 indicates that the light is off, while a 1 indicates that the light is on initially.

Output

For each puzzle, the output consists of a line with the string: "PUZZLE #m", where m is the index of the puzzle in the input file. Following that line, is a puzzle-like display (in the same format as the input) . In this case, 1's indicate buttons that must be pressed to solve the puzzle, while 0 indicate buttons, which are not pressed. There should be exactly one space between each 0 or 1 in the output puzzle-like display.

Sample Input

2
0 1 1 0 1 0
1 0 0 1 1 1
0 0 1 0 0 1
1 0 0 1 0 1
0 1 1 1 0 0
0 0 1 0 1 0
1 0 1 0 1 1
0 0 1 0 1 1
1 0 1 1 0 0
0 1 0 1 0 0

Sample Output

PUZZLE #1
1 0 1 0 0 1
1 1 0 1 0 1
0 0 1 0 1 1
1 0 0 1 0 0
0 1 0 0 0 0
PUZZLE #2
1 0 0 1 1 1
1 1 0 0 0 0
0 0 0 1 0 0
1 1 0 1 0 1
1 0 1 1 0 1

Source

Greater New York 2002

[Submit] [Go Back] [Status] [Discuss]

题目大意：给出每个位置灯的状态，1表示开着。然后按动每个位置的开关，会使上下左右和自己位置灯的状态发生改变。求一种可以让所有灯关闭的方案。1表示按动开关。

题解：高斯消元

分析得每个位置的状态由上下左右和自己决定，因为每个位置的数只能是1或者0，所以我们可以的一个异或方程

x(i,j)^x(i-1,j)^x(i+1,j)^x(i,j+1)^x(i,j-1) =灯的状态 x(i,j)表示是否按动开关。

那么我们对于每个位置编号，然后构造矩阵，对于第i个方程的第j个未知量，如果j位置的开关对i位置有影响，那么矩阵中的系数就是1，否则为0。

然后就可以用高斯消元求解异或方程组了。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<bitset>
#define N 103
using namespace std;
int n,m,num[N][N],mark[N][N],ans[N];
int dx[10]={0,1,0,-1},dy[10]={1,0,-1,0};
int a[N][N];
int b[N];
void gauss()
{
	int num;
	for (int i=1;i<=n;i++){
		num=i;
		for (int j=i;j<=n;j++)
		 if (a[j][i]) {
		 	num=j;
		 	break;
		 }
		//cout<<num<<endl;
		if (!a[i][num]) break;
		for (int j=1;j<=n;j++)
		 swap(a[i][j],a[num][j]);
		swap(b[i],b[num]);
		for (int j=1;j<=n;j++)
		 if (j!=i&&a[j][i]) {
		 	for (int k=1;k<=n;k++)
		 	 a[j][k]^=a[i][k];
		 	b[j]^=b[i];
		 }
    }
	for (int i=n;i>=1;i--){
		ans[i]=b[i];
		for (int j=i-1;j>=1;j--)
		 if (a[j][i])  b[j]^=ans[i];
	}
}
int main()
{
	freopen("a.in","r",stdin);
	int T;
	scanf("%d",&T);
	int cnt=0; n=30;
	for (int i=1;i<=5;i++)
	 for (int j=1;j<=6;j++) num[i][j]=++cnt;
	for (int t=1;t<=T;t++) {
		for (int i=1;i<=5;i++)
		 for (int j=1;j<=6;j++)
		  scanf("%d",&mark[i][j]);
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		for (int i=1;i<=5;i++)
		 for (int j=1;j<=6;j++){
		 	for (int k=0;k<4;k++){
		 		int nowx=i+dx[k];
		 		int nowy=j+dy[k];
		 		if (nowx<0||nowy<0||nowx>5||nowy>6) continue;
		 		a[num[i][j]][num[nowx][nowy]]=1;
			 }
			b[num[i][j]]=mark[i][j];
			a[num[i][j]][num[i][j]]=1;
		 }
		gauss();
		printf("PUZZLE #%d\n",t);
		for (int i=1;i<=n;i++){
			printf("%d ",ans[i]);
			if (i%6==0) printf("\n");
		}
	}
}