题面:https://www.luogu.org/problemnew/show/P4826
本题可以将两点之间异或值进行建图,再跑一边最大生成树,之后累加答案即可。
Code:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<ctime>
using namespace std;
const int N=1000005;
long long n,u1,v1,Cnt,fa[N],ans,a[N],k,cou;
struct Node{
long long u,v,w;
}Edge[N*2];
bool cmp(Node a,Node b){
return a.w>b.w;
}
int find(int x){
if(fa[x]!=x){
fa[x]=find(fa[x]);
}
return fa[x];
}
void kruskal(){
sort(Edge+1,Edge+1+cou,cmp);
for(int i=1;i<=cou;i++){
u1=find(Edge[i].u);
v1=find(Edge[i].v);
if(u1==v1){
continue;
}
ans+=Edge[i].w;
fa[v1]=u1;
Cnt++;
if(Cnt==n-1){
break;
}
}
}
int main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
for(int j=1;j<i;j++){
int d=a[i] xor a[j];
Edge[++cou].u=i;
Edge[cou].v=j;
Edge[cou].w=d;
}
}
for(int i=1;i<=n;i++){
fa[i]=i;
}
kruskal();
printf("%lld\n",ans);
return 0;
}
P4826 Super Cow
Guess you like
Origin www.cnblogs.com/ukcxrtjr/p/11184820.html
Recommended
Ranking