[BZOJ2460][BeiJing2011]元素（贪心+高斯消元求线性基）

题目描述

题解

代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define LL long long
#define N 1005

int n,ans,b
;
struct hp{LL num;int val;}a
;

int cmp(hp a,hp b)
{
return a.val>b.val;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;++i) scanf("%lld%d",&a[i].num,&a[i].val);
sort(a+1,a+n+1,cmp);
for (int i=1;i<=n;++i)
for (int j=59;j>=0;--j)
if (a[i].num>>j&1)
{
if (!b[j]) {b[j]=i;break;}
else a[i].num^=a[b[j]].num;
}
for (int i=0;i<=59;++i) ans+=a[b[i]].val;
printf("%d\n",ans);
}