[高斯消元 线性基 二进制拆分] BZOJ 2844 albus就是要第一个出场

和hdu3949刚好相反啦

记得特判0

还是一个结论 异或值有1<<s 总组合有1<<n 每种值恰好出现1<<(n-s)次

#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(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=100005,K=31;
const ll P=10086;

int n,m,tot;
int w,a[N];
ll ans;

inline int Gauss(){
    int k=1;
    for (int p=K;~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;
}

inline ll Pow(ll a,int b){
    ll ret=1;
    for (;b;b>>=1,(a*=a)%=P)
        if (b&1)
            (ret*=a)%=P;
    return ret;
}

int main()
{
    freopen("t.in","r",stdin);
    freopen("t.out","w",stdout);
    read(n);
    for (int i=1;i<=n;i++) read(a[i]);
    read(w); if (w==0) return printf("1\n"),0;
    tot=Gauss();
    int tmp=0;
    for (int i=1;i<=tot;i++)
        if ((tmp^a[i])<w)
            tmp^=a[i],(ans+=Pow(2,tot-i))%=P;
    (ans+=1)%=P;
    (ans*=Pow(2,n-tot))%=P;
    (ans+=1)%=P;
    printf("%lld\n",ans);
    return 0;
}