POJ 1222 EXTENDED LIGHTS OUT(熄灯问题——枚举)

最新推荐文章于 2021-02-17 00:02:52 发布

原创最新推荐文章于 2021-02-17 00:02:52 发布 · 356 阅读

0 ·

CC 4.0 BY-SA版权

ACM 专栏收录该内容

6 篇文章

订阅专栏

本文介绍了一个基于C++实现的灯谜游戏解题程序。该程序通过递归尝试不同的初始状态来解决一个5行6列的灯谜游戏，旨在找到能够使所有灯处于关闭状态的解决方案。文章详细展示了如何根据不同位置的灯泡改变周围灯泡的状态，并通过逐行迭代的方式寻找可能的答案。

#define LOCAL

#include<cstdio>
#include<iostream>
#include<string.h>
using namespace std;
int origin[5][6],state[5][6],change[5][6];
void trans(int i,int j)
{
    if(i==0&&j==0)
    {
        state[i][j]=1-state[i][j];
        state[i+1][j]=1-state[i+1][j];
        state[i][j+1]=1-state[i][j+1];
    }
    else if(i==0&&j==5)
    {
        state[i][j]=1-state[i][j];
        state[i+1][j]=1-state[i+1][j];
        state[i][j-1]=1-state[i][j-1];
    }
    else if(i==4&&j==0)
    {
        state[i][j]=1-state[i][j];
        state[i-1][j]=1-state[i-1][j];
        state[i][j+1]=1-state[i][j+1];
    }
    else if(i==4&&j==5)
    {
        state[i][j]=1-state[i][j];
        state[i-1][j]=1-state[i-1][j];
        state[i][j-1]=1-state[i][j-1];
    }
    else if(i==0)
    {
        state[i][j]=1-state[i][j];
        state[i+1][j]=1-state[i+1][j];
        state[i][j-1]=1-state[i][j-1];
        state[i][j+1]=1-state[i][j+1];
    }
    else if(i==4)
    {
        state[i][j]=1-state[i][j];
        state[i-1][j]=1-state[i-1][j];
        state[i][j-1]=1-state[i][j-1];
        state[i][j+1]=1-state[i][j+1];
    }
    else if(j==0)
    {
        state[i][j]=1-state[i][j];
        state[i+1][j]=1-state[i+1][j];
        state[i-1][j]=1-state[i-1][j];
        state[i][j+1]=1-state[i][j+1];
    }
    else if(j==5)
    {
        state[i][j]=1-state[i][j];
        state[i+1][j]=1-state[i+1][j];
        state[i-1][j]=1-state[i-1][j];
        state[i][j-1]=1-state[i][j-1];
    }
    else
    {
        state[i][j]=1-state[i][j];
        state[i+1][j]=1-state[i+1][j];
        state[i-1][j]=1-state[i-1][j];
        state[i][j-1]=1-state[i][j-1];
        state[i][j+1]=1-state[i][j+1];
    }
}
void write(int n)
{
    printf("PUZZLE #%d\n",n);
    for(int i=0;i<5;i++)
    {
        for(int j=0;j<6;j++)
        {
            printf("%d ",change[i][j]);
        }
        printf("\n");
    }
}
int main()
{
#ifdef LOCAL
    freopen("/Users/wangkeyuan/i.txt","r",stdin);
    freopen("/Users/wangkeyuan/o.txt","w",stdout);
#endif
    int t,m;
    cin>>t;m=t;
    while(m--)
    {
        for(int i=0;i<5;i++)
            for(int j=0;j<6;j++)
                scanf("%d",&origin[i][j]);
        memcpy(state,origin,sizeof(origin));
        memset(change,0,sizeof(change));
        for(change[0][0]=0;change[0][0]<=1;change[0][0]++)
            for(change[1][0]=0;change[1][0]<=1;change[1][0]++)
                for(change[2][0]=0;change[2][0]<=1;change[2][0]++)
                    for(change[3][0]=0;change[3][0]<=1;change[3][0]++)
                        for(change[4][0]=0;change[4][0]<=1;change[4][0]++)
                        {
                            memcpy(state,origin,sizeof(origin));
                            for(int j=1;j<6;j++)
                                for(int i=0;i<5;i++)
                                {
                                    change[i][j]=0;
                                }
                            for(int i=0;i<5;i++)
                            {
                                if(change[i][0]==1)
                                {
                                    trans(i,0);
                                }
                            }
                            for(int j=0;j<5;j++)
                                for(int i=0;i<5;i++)
                                {
                                    if(state[i][j]==1)
                                    {
                                        change[i][j+1]=1;
                                        trans(i,j+1);
                                    }
                                }
                            int sum=0;
                            for(int i=0;i<5;i++)
                                sum+=state[i][5];
                            if(!sum)
                            {
                                write(t-m);
                                break;
                            }
                        }
        
    }
}