zoukankan      html  css  js  c++  java
  • EXTENDED LIGHTS OUT poj-1222

    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
    题解:枚举第一行的开关状态,然后递推出剩下的几行
     1 #include<cstdio>
     2 #include<string>
     3 #include<cstring>
     4 #include<iostream>
     5 #include<algorithm>
     6 using namespace std;
     7 
     8 const int dx[5]={1,0,0,-1,0};
     9 const int dy[5]={0,1,0,0,-1};
    10 
    11 int kase;
    12 int map[5][6];
    13 int a[5][6],b[5][6];
    14 
    15 int Get(int x,int y){
    16     int res=map[x][y];
    17     for(int i=0;i<5;i++){
    18         int mx=dx[i]+x,my=dy[i]+y;
    19         if(mx>=0&&mx<5&&my>=0&&my<6) res+=a[mx][my]; 
    20     }
    21     return res%2;
    22 }
    23 
    24 int calc(int n,int m){
    25     int res=0;
    26     for(int i=1;i<n;i++)
    27         for(int j=0;j<m;j++) if(Get(i-1,j)!=0) a[i][j]=1;     
    28     for(int i=0;i<m;i++) if(Get(n-1,i)!=0) return -1;    
    29     for(int i=0;i<n;i++) 
    30         for(int j=0;j<m;j++) res+=a[i][j]; 
    31     return res;
    32 }
    33 
    34 void Solve(int n,int m){
    35     int res=-1;
    36     for(int i=0;i<(1<<m);i++){
    37         memset(a,0,sizeof(a));
    38         for(int j=0;j<m;j++) a[0][m-j-1]=(i>>j)&1;
    39         int num=calc(5,6);    
    40         if(num>=0&&(res<0||res>num)){
    41             res=num;
    42             memcpy(b,a,sizeof(a));
    43         }
    44     }
    45 }
    46 
    47 int main()
    48 {   cin>>kase;
    49     for(int t=1;t<=kase;t++){ 
    50         memset(b,0,sizeof(b));
    51         for(int i=0;i<5;i++)
    52             for(int j=0;j<6;j++) cin>>map[i][j];
    53         Solve(5,6);
    54         
    55         printf("PUZZLE #%d
    ",t);
    56         for(int i=0;i<5;i++)
    57             for(int j=0;j<6;j++) printf("%d%c",b[i][j],j==5?'
    ':' '); 
    58     }
    59     return 0;
    60 }
  • 相关阅读:
    汇编Ring 3下实现 HOOK API
    软件调试之INT 3讲解
    Delphi逆向
    XoftSpy 4.13的注册算法分析
    反调试技术揭秘
    jmp && call && ret 特权级转移 & 进程调度
    PHP Warning: Module 'modulename' already loaded in Unknown on line 0
    PhpStorm和PHPstudy配置调试参数(Xdebug),问题描述Error. Interpreter is not specified or invalid. Press “Fix” to edit your project configuration.
    php 安装xdebug进行调试(phpstorm)
    Windows下PHP多线程扩展pthreads的安装
  • 原文地址:https://www.cnblogs.com/zgglj-com/p/7811924.html
Copyright © 2011-2022 走看看