这篇题解我是来除草的。。。具体题解请见莫涛神犇的题解。。。以及APIO上他的讲题
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
int n=0,m=0,e=1,maxt=0,s=0;
long long sum[50005],x=0,a[100005],choose=0,w[200005];
int head[50005],link[200005],next[200005];
bool vis[50005],flag[200005];
void add(int u,int v,long long tmpw)
{
next[++e]=head[u];
head[u]=e;
link[e]=v;
w[e]=tmpw;
next[++e]=head[v];
head[v]=e;
link[e]=u;
w[e]=tmpw;
}
void dfs(int s)
{
vis[s]=1;
for (int ne=head[s];ne;ne=next[ne])
if (!vis[link[ne]])
{
flag[ne]=1;
flag[ne^1]=1;
sum[link[ne]]=sum[s]^w[ne];
dfs(link[ne]);
}
}
void update(int &a,int b)
{
if (a<b) a=b;
}
int main()
{
freopen("xor.in","r",stdin);
freopen("xor.out","w",stdout);
scanf("%d%d",&n,&m);
int i=0,j=0,u=0,v=0;
long long tmpw=0;
for (i=1;i<=m;i++)
{
scanf("%d%d%I64d",&u,&v,&tmpw);
add(u,v,tmpw);
}
sum[1]=0;
dfs(1);
for (i=2;i<=e;i++)
if (!flag[i])
{
a[++s]=sum[link[i]]^sum[link[i^1]]^w[i];
flag[i]=1;flag[i^1]=1;
update(maxt,(int)(log2(a[s])+1));
}
x=sum[n];
update(maxt,(int)(log2(a[s])+1));
for (i=maxt-1;i>=0;i--)
{
choose=0;
for (j=1;j<=s;j++)
if (a[j]&(long long)((long long)(1)<<(long long)(i)))
{
choose=a[j];
break;
}
if (choose)
{
if ((x&(long long)((long long)(1)<<(long long)(i)))==0) x^=choose;
for (j=1;j<=s;j++)
if (a[j]&(long long)((long long)(1)<<(long long)(i)))
a[j]^=choose;
}
}
printf("%I64d",x);
return 0;
}