POJ-1222 EXTENDED LIGHTS OUT 高斯消元

　　題目連結：http://poj.org/problem?id=1222

　　異或高斯消元。

1 //STATUS:C++_AC_0MS_156KB
  2 #include <functional>
  3 #include <algorithm>
  4 #include <iostream>
  5 //#include <ext/rope>
  6 #include <fstream>
  7 #include <sstream>
  8 #include <iomanip>
  9 #include <numeric>
 10 #include <cstring>
 11 #include <cassert>
 12 #include <cstdio>
 13 #include <string>
 14 #include <vector>
 15 #include <bitset>
 16 #include <queue>
 17 #include <stack>
 18 #include <cmath>
 19 #include <ctime>
 20 #include <list>
 21 #include <set>
 22 #include <map>
 23 using namespace std;
 24 //using namespace __gnu_cxx;
 25 //define
 26 #define pii pair<int,int>
 27 #define mem(a,b) memset(a,b,sizeof(a))
 28 #define lson l,mid,rt<<1
 29 #define rson mid+1,r,rt<<1|1
 30 #define PI acos(-1.0)
 31 //typedef
 32 typedef long long LL;
 33 typedef unsigned long long ULL;
 34 //const
 35 const int N=35;
 36 const int INF=0x3f3f3f3f;
 37 const int MOD=100000,STA=8000010;
 38 const LL LNF=1LL<<60;
 39 const double EPS=1e-8;
 40 const double OO=1e15;
 41 const int dx[4]={-1,0,1,0};
 42 const int dy[4]={0,1,0,-1};
 43 const int day[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
 44 //Daily Use ...
 45 inline int sign(double x){return (x>EPS)-(x<-EPS);}
 46 template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
 47 template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
 48 template<class T> inline T lcm(T a,T b,T d){return a/d*b;}
 49 template<class T> inline T Min(T a,T b){return a<b?a:b;}
 50 template<class T> inline T Max(T a,T b){return a>b?a:b;}
 51 template<class T> inline T Min(T a,T b,T c){return min(min(a, b),c);}
 52 template<class T> inline T Max(T a,T b,T c){return max(max(a, b),c);}
 53 template<class T> inline T Min(T a,T b,T c,T d){return min(min(a, b),min(c,d));}
 54 template<class T> inline T Max(T a,T b,T c,T d){return max(max(a, b),max(c,d));}
 55 //End
 56 
 57 int ma[N][N],A[N][N],B[N];
 58 int T;
 59 
 60 void getA(int n,int m)
 61 {
 62     int i,j,k,x,y;
 63     mem(A,0);
 64     for(i=0;i<n;i++){
 65         for(j=0;j<m;j++){
 66             A[i*6+j][i*6+j]=1;
 67             for(k=0;k<4;k++){
 68                 x=i+dx[k];
 69                 y=j+dy[k];
 70                 if(x>=0&&x<n && y>=0&&y<m){
 71                     A[i*6+j][x*6+y]=1;
 72                 }
 73             }
 74         }
 75     }
 76     for(i=0;i<n;i++){
 77         for(j=0;j<m;j++)
 78             A[i*6+j][30]=ma[i][j];
 79     }
 80 }
 81 
 82 void gauss(int n)
 83 {
 84     int i,j,k;
 85     for(i=0;i<n;i++){
 86         if(!A[i][i]){
 87             for(j=i+1;j<n;j++){
 88                 if(A[j][i]){
 89                     for(k=i;k<=n;k++)swap(A[i][k],A[j][k]);
 90                     break;
 91                 }
 92             }
 93         }
 94         for(j=i+1;j<n;j++){
 95             if(A[j][i]){
 96                 for(k=i;k<=n;k++)
 97                     A[j][k]^=A[i][k];
 98             }
 99         }
100     }
101     for(i=n-1;i>=0;i--){
102         k=0;
103         for(j=i+1;j<n;j++)k^=A[i][j]*B[j];
104         B[i]=k^A[i][n];
105     }
106 }
107 
108 int main()
109 {
110  //   freopen("in.txt","r",stdin);
111     int i,j,ca=1;
112     scanf("%d",&T);
113     while(T--)
114     {
115         for(i=0;i<5;i++){
116             for(j=0;j<6;j++)
117                 scanf("%d",&ma[i][j]);
118         }
119         getA(5,6);
120 
121         gauss(30);
122 
123         printf("PUZZLE #%d\n",ca++);
124         for(i=0;i<5;i++){
125             printf("%d",B[i*6]);
126             for(j=1;j<6;j++)
127                 printf(" %d",B[i*6+j]);
128             putchar('\n');
129         }
130     }
131     return 0;
132 }      

轉載于:https://www.cnblogs.com/zhsl/archive/2013/05/30/3109352.html