Bzoj 3105 New Nim Games

Note that the XOR of a non-empty set of a linear base is not 0.

Our goal is to eliminate such a linear base, is opposite how to take, Xor or and is 1.

From the big to the small sort of elimination is good

#include <iostream>#include<cstdio>#include<cstring>#include<algorithm>#defineMAXN 105using namespacestd;Long Longn,a[maxn],b[maxn],bit[ +],ans=0, sum=0;BOOLvis[ +];BOOLcmpLong LongXLong Longy) {    returnX>y;}intMain () {scanf ("%lld",&N);  for(Long LongI=1; i<=n;i++) {scanf ("%lld", &a[i]); sum+=a[i];} Sort (a+1, a+n+1, CMP);  for(Long LongI=1; i<=n;i++) b[i]=A[i];  for(Long LongI=1; i<=n;i++)         for(Long Longk= to; k>=0; k--)        {            if(! (a[i]& (1<<k)))Continue; if(!Vis[k]) {Vis[k]=true; ans+=b[i];bit[k]=a[i]; Break;} Elsea[i]^=Bit[k]; } printf ("%lld\n", sum-ans); return 0;}

Bzoj 3105 New Nim Games