C++14(g++5.4) 解法, 执行用时: 5ms, 内存消耗: 504K, 提交时间: 2019-08-09 09:27:18

#include <bits/stdc++.h>
using namespace std;
int const N = 100 + 10;
int const maxbit = 32;
int a[N],p[maxbit],n;
long long ans;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	sort(a+1,a+n+1,greater<int>());
	for(int i=1,j;i<=n;i++){
		int x = a[i];
		for(j=maxbit-1;j>=0;j--){
			if(x & (1<<j)){
				if(p[j] == 0){
					p[j] = x;
					break;
				}else{
					x ^= p[j];
				}
			}
		}
		if(j == -1)	ans += a[i];
	}
	printf("%lld\n",ans);
	return 0;
}

C++11(clang++ 3.9) 解法, 执行用时: 3ms, 内存消耗: 600K, 提交时间: 2020-04-30 21:30:11

#include<bits/stdc++.h>
using namespace std;

#define ll long long 

const int N=2e5+100;

int a[N],d[N];
int main()
{
	int n;
	cin>>n;
	ll ans=0;
	for(int i=1;i<=n;i++) cin>>a[i],ans+=a[i];
	sort(a+1,a+1+n,greater<int>()); 
	for(int i=1;i<=n;i++)
	{
		int x=a[i];
		for(int i=30;i>=0;i--)
		{
			if(x>>i&1)
			{
				if(d[i]) x^=d[i];
				else 
				{
					d[i]=x;
					break;
				}
			} 
		}
		if(x) ans-=a[i];
	}
	cout<<ans<<endl;
	return 0;
}