分析
首先做异或前缀和,然后可以把此问题转换成求两两xor的前k大,那么每次若当前堆顶为第 t t t大,把当前trie中的第 t + 1 t+1 t+1大插入堆中,在trie中类似求第 k k k大的方法求出答案
代码
#include <cstdio>
#include <cctype>
#include <queue>
#define rr register
using namespace std;
typedef unsigned uit;
const int N=500001;
struct rec{
uit id,rk,w;
bool operator <(const rec &t)const{
return w<t.w;
}
};
priority_queue<rec>q; uit s[N];
int trie[N<<5][2],tot,n,m,ed[N<<5];
inline uit iut(){
rr uit ans=0; rr char c=getchar();
while (!isdigit(c)) c=getchar();
while (isdigit(c)) ans=(ans<<3)+(ans<<1)+(c^48),c=getchar();
return ans;
}
inline void Insert(uit x){
rr int p=0;
for (rr int i=31;~i;--i){
rr int t=(x>>i)&1; ++ed[p];
if (!trie[p][t]) trie[p][t]=++tot;
p=trie[p][t];
}
++ed[p];
}
inline uit query(uit x,uit rk){
rr int p=0; rr uit ans=0;
for (rr int i=31;~i;--i){
rr int t=(x>>i)&1;
if (!trie[p][t^1]) p=trie[p][t];
else if (rk<=ed[trie[p][t^1]]) ans|=1ll<<i,p=trie[p][t^1];
else rk-=ed[trie[p][t^1]],p=trie[p][t];
}
return ans;
}
signed main(){
n=iut(),m=iut()<<1; rr long long ans=0;
for (rr int i=1;i<=n;++i) s[i]=s[i-1]^iut();
for (rr int i=0;i<=n;++i) Insert(s[i]);
for (rr int i=0;i<=n;++i) q.push((rec){i,1,query(s[i],1)});
for (rr int i=1;i<=m;++i){
rr rec now=q.top(); q.pop(); ans+=now.w;
if (now.rk<n) q.push((rec){now.id,now.rk+1,query(s[now.id],now.rk+1)});
}
return !printf("%lld",ans>>1);
}