传送门
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:
- It does not matter what order the buttons are pressed.
- 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.
- 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
这个题意思就就是给你一个矩阵,翻其中一个元素就会使其自己和上下左右的都变一个状态,即0->1,1->0。然后让你求要如何翻才能把所有的1都变成0.
首先,我们考虑将一个灯翻转,那么他周围的也会一起翻转,对于每一个灯,我们得到一个方程,比如一个2*3的矩阵:
f
(
1
,
1
)
=
1
∗
x
1
+
1
∗
x
2
+
0
∗
x
3
+
1
∗
x
4
+
0
∗
x
5
+
0
∗
x
6
f
(
1
,
2
)
=
1
∗
x
1
+
1
∗
x
2
+
1
∗
x
3
+
0
∗
x
4
+
1
∗
x
5
+
0
∗
x
6
f
(
1
,
3
)
=
0
∗
x
1
+
1
∗
x
2
+
1
∗
x
3
+
0
∗
x
4
+
0
∗
x
5
+
1
∗
x
6
f
(
2
,
1
)
=
1
∗
x
1
+
0
∗
x
2
+
0
∗
x
3
+
1
∗
x
4
+
1
∗
x
5
+
0
∗
x
6
f
(
2
,
2
)
=
0
∗
x
1
+
1
∗
x
2
+
0
∗
x
3
+
1
∗
x
4
+
1
∗
x
5
+
1
∗
x
6
f
(
2
,
3
)
=
0
∗
x
1
+
0
∗
x
2
+
1
∗
x
3
+
0
∗
x
4
+
1
∗
x
5
+
1
∗
x
6
f(1,1)=1*x_1+1*x_2+0*x_3+1*x_4+0*x_5+0*x_6\\ f(1,2)=1*x_1+1*x_2+1*x_3+0*x_4+1*x_5+0*x_6\\ f(1,3)=0*x_1+1*x_2+1*x_3+0*x_4+0*x_5+1*x_6\\ f(2,1)=1*x_1+0*x_2+0*x_3+1*x_4+1*x_5+0*x_6\\ f(2,2)=0*x_1+1*x_2+0*x_3+1*x_4+1*x_5+1*x_6\\ f(2,3)=0*x_1+0*x_2+1*x_3+0*x_4+1*x_5+1*x_6
f(1,1)=1∗x1+1∗x2+0∗x3+1∗x4+0∗x5+0∗x6f(1,2)=1∗x1+1∗x2+1∗x3+0∗x4+1∗x5+0∗x6f(1,3)=0∗x1+1∗x2+1∗x3+0∗x4+0∗x5+1∗x6f(2,1)=1∗x1+0∗x2+0∗x3+1∗x4+1∗x5+0∗x6f(2,2)=0∗x1+1∗x2+0∗x3+1∗x4+1∗x5+1∗x6f(2,3)=0∗x1+0∗x2+1∗x3+0∗x4+1∗x5+1∗x6
[
x
1
x
2
x
3
x
4
x
5
x
6
]
\left[ \begin{matrix} x_1 & x_2 & x_3 \\ x_4 & x_5& x_6 \end{matrix} \right]
[x1x4x2x5x3x6]
要注意的是第i行系数为1的灯表示这个灯会影响第i个灯
用此种方法将翻转换成方程组即可使用高斯消元来计算每一个x的取值。
AC代码如下
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
typedef long long int LL;
const int MAXL(50);
int dir[4][2]= {{-1,0},{1,0},{0,1},{0,-1}};
int a[MAXL+50][MAXL+50];//增广矩阵
int x[MAXL+50];//解集
bool free_x[MAXL];//标记是否是不确定的变元
void Gauss(int equ,int var)
{
memset(x,0,sizeof x);
int maxr,col;
int k;
for(k=0,col=0; k<equ&&col<var; k++,col++)
{
maxr=k;
for(int i=k+1; i<equ; i++)
if(abs(a[i][col])>abs(a[maxr][col]))
maxr=i;
if(maxr!=k)
for(int j=k; j<var+1; j++) swap(a[k][j],a[maxr][j]);
if(!a[k][col])
{
k--;
continue;
}
for(int i=k+1; i<equ; i++)
{
if(a[i][col])
{
for(int j=col; j<var+1; j++)
a[i][j]^=a[k][j];
}
}
}
for(int i=var-1; i>=0; i--)
{
x[i]=a[i][var];
for(int j=i+1; j<var; j++)
x[i]^=(a[i][j]&&x[j]);
}
return;
}
int main()
{
int T,CASE=1;
cin>>T;
while(T--)
{
memset(a,0,sizeof a);
for(int i=0; i<30; i++)
cin>>a[i][30];
for(int i=0; i<5; i++)
{
for(int j=0; j<6; j++)
{
int k=i*6+j;
a[k][k]=1;
if(i>0)
a[(i-1)*6+j][k]=1;
if(i<4)
a[(i+1)*6+j][k]=1;
if(j>0)
a[i*6+j-1][k]=1;
if(j<5)
a[i*6+j+1][k]=1;
}
}
Gauss(30,30);
cout<<"PUZZLE #"<<CASE++<<endl;
for(int i=0; i<5; i++)
{
int temp=i*6;
cout<<x[temp];
for(int j=1; j<6; j++)
{
temp=i*6+j;
cout<<" "<<x[temp];
}
cout<<endl;
}
}
}