题意:
问一个无向图是否有欧拉路径,并且有的话使得经过的点的权值异或和最大,输出这个异或值。
做法:
首先判图是否连通。
然后度为奇数的点只能有0个或2个。
发现一个性质:(度+1)/2是奇数的点都是在路径上的。
如果度为奇数的点有2个就一个是起点一个是终点,如果0个说明有欧拉回路,则所有点都可以取为起点,枚举一遍选最大值即可。
代码:
/*************************************************************
Problem: hdu 5883 The Best Path
User: fengyuan07
Language: C++
Result: Accepted
Time: 1450MS
Memory: 4720K
Submit_Time: 2018-01-24 10:53:59
*************************************************************/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cctype>
#include<cstdlib>
#include<cmath>
using namespace std;
typedef long long ll;
inline ll read() {
char ch = getchar(); ll x = 0; int op = 1;
for(; !isdigit(ch); ch = getchar()) if(ch == '-') op = -1;
for(; isdigit(ch); ch = getchar()) x = x*10+ch-'0';
return x*op;
}
inline void write(ll a) {
if(a < 0) putchar('-'), a = -a;
if(a >= 10) write(a/10); putchar('0'+a%10);
}
const int N = 100010, M = 500010;
int n, m;
int a[N], d[N], fa[N];
inline int getfa(int x) { return fa[x] == x ? x : fa[x] = getfa(fa[x]); }
int main() {
int test; test = read();
while(test --) {
n = read(), m = read();
for(int i = 1; i <= n; i ++) a[i] = read(), fa[i] = i;
memset(d, 0, sizeof d);
for(int i = 1; i <= m; i ++) {
int x = read(), y = read(), fx, fy;
d[x] ++, d[y] ++;
fx = getfa(x); fy = getfa(y);
if(fx != fy) fa[fx] = fy;
} bool flag = 1; int st = 0;
for(int i = 1; i <= n; i ++)
if(d[i]) { st = i; break; }
for(int i = 1; i <= n; i ++) {
if(!d[i]) continue;
if(getfa(i) != getfa(st)) { flag = 0; break; }
}
if(!flag) { puts("Impossible"); continue; } int odd_tot = 0;
for(int i = 1; i <= n; i ++)
if(d[i]&1) odd_tot ++;
if(odd_tot != 0 && odd_tot != 2) { puts("Impossible"); continue; }
int tmp = 0, ans = 0;
for(int i = 1; i <= n; i ++)
if((d[i]+1)/2%2) tmp ^= a[i];
if(odd_tot == 0) for(int i = 1; i <= n; i ++) ans = max(ans, tmp^a[i]);
else ans = tmp;
printf("%d\n", ans);
}
return 0;
}