[高斯消元 线性基 二进制拆分] HDU 3949 XOR

意识流的记一个结论就好了 将K二进制拆分什么的 不难想

注意特判0

安利：http://hzwer.com/5491.html

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
    return *p1++;
}
inline void read(ll &x){
    char c=nc(),b=1;
    for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
    for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
inline void read(int &x){
    char c=nc(),b=1;
    for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
    for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=10005;

int n,cnt;
ll a[N];

int Gauss(){
    int k=1;
    for (int p=63;~p;p--)
    {
        int t=0;
        for (int i=k;i<=n && !t;i++)
            if (a[i]>>p&1)
                t=i;
        if (!t) continue;
        swap(a[t],a[k]);
        for (int i=1;i<=n;i++)
            if (i!=k && a[i]>>p&1)
                a[i]^=a[k];
        k++;
    }
    return k-1;
}

inline ll calc(ll k){
    if(cnt<n){
        if(k==1) return 0;
        else k--;
    }
    if(k>=(1LL<<cnt)) return -1;
    ll ans=0;
    for(int i=0;i<=63;i++)
        if(k>>i&1)
            ans^=a[cnt-i];
    return ans;
}

inline void print()
{
    for (int i=1;i<=cnt;i++) printf("%lld ",a[i]); printf("\n");
}

int main()
{
    int Test,Q,t; ll k;
    freopen("t.in","r",stdin);
    freopen("t.out","w",stdout);
    read(Test);
    for (int t=1;t<=Test;t++)
    {
        read(n);
        for (int i=1;i<=n;i++) read(a[i]);
        cnt=Gauss();
        read(Q);
        printf("Case #%d:\n",t);
        while (Q--)
            read(k),printf("%lld\n",calc(k));
    }
    return 0;
}