G66 线性基+贪心法 P4301 [CQOI2013] 新Nim游戏

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=110,B=60;
LL a[N];
LL p[B+5];
bool ins(LL x)
{
    for(int i=B;i>=0;--i)if(x>>i&1)
        if(!p[i])return p[i]=x,1;
        else x^=p[i];
    return 0;
}
int main()
{
    int n;scanf("%d", &n);
    for(int i=1;i<=n;++i)scanf("%lld", &a[i]);
    sort(a+1, a+1+n);
    LL ans=0;
    memset(p,0,sizeof(p));
    for(int i=n;i>=1;i--)
        if(!ins(a[i]))ans+=a[i];
    printf("%lld\n", ans);
    return 0;
}