poj1222 EXTENDED LIGHTS OUT 高斯消元

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.

Solution

---

本蒟蒻的高斯消元第一题，纪念一下
所谓高斯消元就是一般意义上的加减消元，当然也能套用异或。把每个灯的操作看成未知数，当前状态为常数，给能够影响当前灯的未知数前系数设为1，那么就有有了5*6=30个异或方程，套用高斯消元法求解即可

Code

---

#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define drp(i,st,ed) for (int i=st;i>=ed;--i)
#define fill(x,t) memset(x,t,sizeof(x))
const int N=8;
using std:: swap;
int a[N*N][N*N];
void writeln() {
    rep(i,1,5) {
        rep(j,1,6) printf("%d ",a[(i-1)*6+j][31]);
        puts("");
    }
}
int gauss(int n,int m) {
    rep(i,1,n) {
        int rec=i;
        rep(j,rec+1,n) if (a[j][i]) rec=j;
        if (rec!=i) rep(j,1,m) swap(a[i][j],a[rec][j]);
        rep(j,1,n) if (j!=i&&a[j][i]) {
            rep(k,1,m) a[j][k]^=a[i][k];
        }
    }
    writeln();
}
int main(void) {
    int T; scanf("%d",&T);
    int puzzle=0;
    while (T--) {
        printf("PUZZLE #%d\n",++puzzle);
        fill(a,0);
        rep(i,1,5) rep(j,1,6) scanf("%d",&a[(i-1)*6+j][31]);
        rep(i,1,5) rep(j,1,6) {
            int now=(i-1)*6+j;
            a[now][now]=1;
            if (i>1) a[now][(i-2)*6+j]=1;
            if (i<5) a[now][(i)*6+j]=1;
            if (j>1) a[now][(i-1)*6+j-1]=1;
            if (j<6) a[now][(i-1)*6+j+1]=1;
        }
        gauss(30,31);
    }
    return 0;
}