[BZOJ]4269: 再见Xor

weixin_30765475

于 2019-02-05 20:41:00 发布

阅读量73

点赞数

原文链接：http://www.cnblogs.com/wang9897/p/10353092.html

版权

题解:求最大值线性基基本操作....求次大值等于最大值异或上线性基能表示的最小值

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define link(x) for(edge *j=h[x];j;j=j->next)
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,r,l) for(int i=r;i>=l;i--)
const int MAXN=3e5+10;
const double eps=1e-8;
#define ll long long
using namespace std;
struct edge{int t,v;edge*next;}e[MAXN<<1],*h[MAXN],*o=e;
void add(int x,int y,int vul){o->t=y;o->v=vul;o->next=h[x];h[x]=o++;}
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return x*f;
}

int vis[31];

int main(){
    int n=read();
    int t;
    inc(i,1,n){
	t=read();
	for(int j=30;j>=0;j--){
	    if((t>>j)&1){
		if(vis[j])t^=vis[j];
		else{vis[j]=t;break;}
	    }
	}
    }
    int ans=0;
    dec(i,30,0)if(ans<(ans^vis[i]))ans^=vis[i];
    inc(i,0,30)if(vis[i]){t=vis[i];break;}
    printf("%d %d\n",ans,ans^t);
}