P4151 最大XOR和路径 线性基

题解见:https://www.luogu.org/problemnew/solution/P4151

其实就是找出所有环 把环上所有边异或起来得到的值扔到线性基里面

然后随便走一条从1~n的链 最后求最大异或和即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define LL long long
LL num[];
bool insert(LL x) {
        for (int i = ; i >= ; i--)
                if ((x >> i) & ) {
                        if (!num[i]) {
                                num[i] = x;
                                return true;
                        }
                        x ^= num[i];
                }
        return false;
}
LL query(LL x) {
        LL res = x;
        for (int i = ; i >= ; i--)
                if ((res ^ num[i]) > res)
                        res ^= num[i];
        return res;
}
struct edge {
        int to, next;
        LL w;
} e[];
int head[], ecnt;
inline void adde(int from, int to, LL w) {
        e[++ecnt] = (edge) {to, head[from], w}, head[from] = ecnt;
        e[++ecnt] = (edge) {from, head[to], w}, head[to] = ecnt;
}
int vis[];
LL del[];
void dfs(int u, LL res) {
        del[u] = res, vis[u] = ;
        for (int i = head[u]; i; i = e[i].next)
                if (!vis[e[i].to])
                        dfs(e[i].to, res ^ e[i].w);
                else
                        insert(res ^ e[i].w ^ del[e[i].to]);
}
int main() {
        int n, m, a, b;
        LL c;
        scanf("%d%d", &n, &m);
        for (int i = ; i <= m; i++)
                scanf("%d%d%lld", &a, &b, &c), adde(a, b, c);
        dfs(, );
        printf("%lld\n", query(del[n]));
}