# 【POJ 1222】EXTENDED LIGHTS OUT

## EXTENDED LIGHTS OUT

Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 7333 Accepted: 4792
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

①我们用a[i][j]表示读入的方格；

f[i][j]表示第i个方格对第j个方格有影响，即你对第i个方格履行开关操作时，j方格也被操作了（ji的10字形区域内）；

③最后的答案数组为ans[i]ans[i]=1表示第i个方格被履行操作了；

tot=n?m

a[i][j]+f[k][1]?ans[1]+f[k][2]?ans[2]+...f[k][tot]?ans[tot]=0(mod2)

f[k][1]?ans[1]+f[k][2]?ans[2]+...f[k][tot]?ans[tot]=a[i][j](mod2)

#include <iostream> #include <algorithm> #include <cstring> #include <cmath> #include <cstdio> #include <cstdlib> #define N 5 #define M 6 using namespace std; int a[35][35],ans[35],id[10][10],d[15][3]; void Gauss(int n,int m) { for (int i=1;i<=n;i++) { int j; for (j=i;j<=n&&!a[i][j];j++); if (j==n+1) continue; if (i!=j) for (int k=i;k<=m;k++) swap(a[i][k],a[j][k]); for (int j=i+1;j<=n;j++) if (a[j][i]) for (int k=i;k<=m;k++) a[j][k]^=a[i][k]; } for (int i=n;i;i--) { for (int j=n;j>i;j--) a[i][m]^=(a[i][j]*a[j][m]); ans[i]=a[i][m]; } } int main() { int T; scanf("%d",&T); int cnt=0; for (int i=1;i<=N;i++) for (int j=1;j<=M;j++) id[i][j]=++cnt; d[0][1]=d[0][2]=0; d[1][1]=d[2][1]=0,d[1][2]=1,d[2][2]=-1; d[3][2]=d[4][2]=0,d[3][1]=1,d[4][1]=-1; for (int t=1;t<=T;t++) { memset(a,0,sizeof(a)); printf("PUZZLE #%d ",t); for (int i=1;i<=N;i++) for (int j=1;j<=M;j++) for (int k=0;k<=4;k++) { int p=id[i+d[k][1]][j+d[k][2]]; if (p) a[id[i][j]][p]=1; else a[id[i][j]][p]=0; } for (int i=1;i<=N;i++) for (int j=1;j<=M;j++) scanf("%d",&a[id[i][j]][31]); Gauss(cnt,cnt+1); int now=0; for (int i=1;i<=N;i++) { printf("%d",ans[++now]); for (int j=2;j<=M;j++) printf(" %d",ans[++now]); printf(" "); } } return 0; } 

### 感悟：

WA是由于没有清零a数组，致使1些本来是0的在以后变成1了。

1. 本站所有资源来源于用户上传和网络，如有侵权请邮件联系站长！
2. 分享目的仅供大家学习和交流，您必须在下载后24小时内删除！
3. 不得使用于非法商业用途，不得违反国家法律。否则后果自负！
4. 本站提供的源码、模板、插件等等其他资源，都不包含技术服务请大家谅解！
5. 如有链接无法下载、失效或广告，请联系管理员处理！
6. 本站资源售价只是赞助，收取费用仅维持本站的日常运营所需！
7. 本站源码并不保证全部能正常使用，仅供有技术基础的人学习研究，请谨慎下载
8. 如遇到加密压缩包，请使用WINRAR解压,如遇到无法解压的请联系管理员！