传送门
分析
首先我们需要知道一个性质,线性基内的元素数量是唯一的,也就是说我们能够插入的数的个数是确定的,如果有一个数不能插入线性基,我们只需要更改插入顺序就可以了
所以,我们可以贪心的去想,按照魔力值从大到小的顺序把元素需要插入线性基,能够插入就加上这个矿石的魔力值
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int n;
vector<PII> nums;
ll b[N];
bool add(ll x){
for(int i = 62;i >= 0;i--){
if(x & (1ll << i)) {
if(b[i]) x ^= b[i];
else{
b[i] = x;
return true;
}
}
}
return false;
}
bool cmp(PII x,PII y){
return x.se > y.se;
}
int main() {
read(n);
for(int i = 1;i <= n;i++){
PII t;
read(t.fi);
read(t.se);
nums.pb(t);
}
sort(all(nums),cmp);
int ans = 0;
for(auto t:nums)
if(add(t.fi)) ans += t.se;
di(ans);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/