题目链接:https://www.lydsy.com/JudgeOnline/problem.php?id=2460
思路:我们发现选元素的过程就是构造线性基的过程,为使得总的魔力值最大,我们对元素按魔力值排序按权值从大到小插入到线性基中就可以保证得到的线性基中的元素是权值之和最大的。
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
#define ll long long
int n, q; ll x, cnt;
struct node
{
int val; ll id;
}a[1005];
bool cmp(node a, node b)
{
return a.val > b.val;
}
struct Linear_basis
{
ll d[61], p[61];
void init()
{
memset(d,0,sizeof(d));
memset(p,0,sizeof(p));
cnt = 0;
}
bool add(ll val)
{
for(int i = 60; i >= 0; i--)
if(val & (1LL << i))
{
if(!d[i])
{
d[i] = val;
break;
}
val^=d[i];
}
return val > 0;
}
ll query_max()
{
ll ret = 0;
for(int i = 60; i >= 0; i--)
if((ret ^ d[i]) > ret)
ret ^= d[i];
return ret;
}
ll query_min()
{
for(int i = 0;i <= 60; i++)
if(d[i])
return d[i];
return 0;
}
void rebuild()
{
for(int i = 60; i >= 0; i--)
for(int j = i - 1; j >= 0; j--)
if(d[i] & (1LL << j))
d[i] ^= d[j];
for(int i = 0; i <= 60; i++)
if(d[i]) p[cnt++] = d[i];
}
ll kth_query(ll k)
{
int ret = 0;
if(k >= (1LL << cnt))
return -1;
for(int i = 60; i >= 0; i--)
if(k & (1LL << i))
ret ^= p[i];
return ret;
}
}LB;
int main()
{
LB.init();
scanf("%d",&n);
for(int i = 0; i < n; i++)
scanf("%lld%d", &a[i].id, &a[i].val);
sort(a, a+n, cmp);
int ans = 0;
for(int i = 0; i < n; i++)
if(LB.add(a[i].id)) ans += a[i].val;
printf("%d\n", ans);
}