BZOJ1923: [Sdoi2010]外星千足虫

 1 #include<cstdio>
 2 #include<cstdlib>
 3 #include<cmath>
 4 #include<cstring>
 5 #include<algorithm>
 6 #include<iostream>
 7 #include<vector>
 8 #include<map>
 9 #include<set>
10 #include<queue>
11 #include<string>
12 #include<bitset>
13 #define inf 1000000000
14 #define maxn 2000+5
15 #define maxm 100000+5
16 #define eps 1e-10
17 #define ll long long
18 #define pa pair<int,int>
19 #define for0(i,n) for(int i=0;i<=(n);i++)
20 #define for1(i,n) for(int i=1;i<=(n);i++)
21 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
22 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
23 #define for4(i,x) for(int i=head[x],y=e[i].go;i;i=e[i].next,y=e[i].go)
24 #define mod 1000000007
25 using namespace std;
26 inline int read()
27 {
28     int x=0,f=1;char ch=getchar();
29     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
30     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
31     return x*f;
32 }
33 int n,m,tot,b[maxn],ans[maxn];
34 bitset<1005> a[maxn],c[2];
35 int main()
36 {
37     freopen("input.txt","r",stdin);
38     freopen("output.txt","w",stdout);
39     n=read();m=read();
40     c[0][0]=0;c[1][0]=1;
41     for1(i,m)
42     {
43         for1(j,n+1)
44         {
45             char ch=getchar();
46             while(ch!=‘0‘&&ch!=‘1‘)ch=getchar();
47             a[i]=a[i]<<1^c[(int)(ch-‘0‘)];
48         }
49         for3(j,n,1)if(a[i][j]&1)
50         {
51             if(b[j])a[i]^=a[b[j]];
52             else {b[j]=i;tot++;break;}
53         }
54         if(tot==n){ans[0]=i;break;}
55     }
56     if(tot<n)printf("Cannot Determine\n");
57     else
58     {
59         printf("%d\n",ans[0]);
60         //for1(i,n)cout<<i<<‘ ‘<<b[i]<<‘ ‘<<a[b[i]]<<endl;
61         for1(i,n)
62         {
63             ans[i]=a[b[i]][0];
64             for1(j,i-1)if(a[b[i]][j])ans[i]^=ans[j];
65         }
66         for3(i,n,1)printf("%s\n",ans[i]?"?y7M#":"Earth");
67     }
68     return 0;
69 }