poj 1222:EXTENDED LIGHTS OUT

来源：互联网发布：淘宝双十一活动要求编辑：程序博客网时间：2024/04/29 22:56

解题思路：

DFS

#include<iostream>#include<cstring>using namespace std;struct board{int v[10][10];int c[10][10];};board map;int no = 0;bool flag; void DFS(board tmp,int i){if(flag)return;if(i==7){for(int j=2;j<=5;j++)for(int k=1;k<=6;k++)if(tmp.v[j-1][k]==1){tmp.v[j][k] = !tmp.v[j][k];tmp.v[j-1][k] = !tmp.v[j-1][k];tmp.v[j+1][k] = !tmp.v[j+1][k];tmp.v[j][k-1] = !tmp.v[j][k-1];tmp.v[j][k+1] = !tmp.v[j][k+1];tmp.c[j][k] = 1;}for(int k=1;k<=6;k++)if(tmp.v[5][k]==1)return;flag = true;cout<<"PUZZLE #"<<no<<endl;for(int j=1;j<=5;j++){for(int k=1;k<=6;k++){cout<<tmp.c[j][k]<<" ";}cout<<endl;}return;}board tmp2 = tmp;DFS(tmp2,i+1);board tmp3 = tmp;tmp3.v[1][i] = !tmp3.v[1][i];tmp3.v[1][i-1] = !tmp3.v[1][i-1];tmp3.v[1][i+1] = !tmp3.v[1][i+1];tmp3.v[2][i] = !tmp3.v[2][i];tmp3.c[1][i] = 1;DFS(tmp3,i+1);return;}int main(){int n;cin>>n;while(n--){no++;memset(map.v,0,sizeof(map.v));memset(map.c,0,sizeof(map.c));for(int i=1;i<=5;i++)for(int j=1;j<=6;j++)cin>>map.v[i][j];flag = false;DFS(map,1);}return 0;}

0 0