题意
n n 个点 条无向边的图,找一个欧拉通路/回路使得这个路径所有结点的异或值最大。
题解
根据欧拉路径或者欧拉回路的来判断是否有解。
如果是欧拉路径,注意图中度为偶数的顶点,如果其degre[i]/2为奇数,不计入答案。这个画一画就知道了 。
如果是欧拉回路,在欧拉令的基础上,枚举起点,起点是不能计入答案的,原因在于从这里出发,并且最后回到此点,根据XOR的性质,可以得出。枚举起点求最大值即可,
代码
#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
const int nmax = 100000+7;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const ull p = 67;
const ull MOD = 1610612741;
int fa[nmax],tot;
int val[nmax],degree[nmax],sum;
int t,n,m;
int findset(int x){
int rt = x,temp;
while(fa[rt] != rt) rt = fa[rt];
while(x != rt){
temp = fa[x];
fa[x] = rt;
x = temp;
}
return rt;
}
void unionset(int x , int y){
x = findset(x), y = findset(y);
if(x == y) return;
else fa[x] = y , tot--;
}
int main(){
scanf("%d",&t);
while(t--){
scanf("%d %d",&n,&m);
sum = 0; tot = n;
memset(val,0,sizeof val);
memset(degree,0,sizeof degree);
for(int i = 1;i<=n;++i) fa[i] = i;
for(int i = 1;i<=n;++i) scanf("%d",&val[i]);
int u,v;
for(int i = 1;i<=m;++i){
scanf("%d %d",&u,&v);
unionset(u,v);
degree[u]++, degree[v]++;
}
int odd = 0;
for(int i = 1;i<=n;++i) if(degree[i]&1) odd++;
if( (odd == 2 || odd == 0 ) && tot == 1){
int ans = 0;
for(int i = 1;i<=n;++i){
if( (((degree[i] + 1)>>1)&1) == 1) ans = ans ^ val[i];
}
if(odd == 2) printf("%d\n",ans);
if(odd == 0){
int mx = 0;
for(int i = 1;i<=n;++i){
int tt = ans ^ val[i];
mx = max(mx,tt);
}
printf("%d\n",mx);
}
}else{
printf("Impossible\n");
continue;
}
myname
}
return 0;
}