Pku3764 The xor-longest Path【字典树 最长异或路径值】

BZOJ1954 题目链接

---

  给定一棵n个点的带权树，求树上最长的异或和路径

  这道题我们可以想到这样的解法，有从“s->v”和“s->u”的路径，那么v到u的路径就是其中这两个的异或值，所以，我们只需要查询s->x的异或值的最大值即可，那么不妨去直接查询字典树，并且在查询完之后，把现在所到达的值给存进去即可。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e5 + 7;
int N, dp[maxN], trie[maxN * 32][2], tot, head[maxN], cnt;
struct Eddge
{
    int nex, to, val;
    Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), val(c) {}
}edge[maxN<<1];
inline void addEddge(int u, int v, int w)
{
    edge[cnt] = Eddge(head[u], v, w);
    head[u] = cnt++;
}
inline void _add(int u, int v, int w) { addEddge(u, v, w); addEddge(v, u, w); }
inline void clear(int x)
{
    trie[x][0] = trie[x][1] = 0;
}
inline void Insert(int x)
{
    int root = 0;
    for(int i=31; i>=0; i--)
    {
        int bit = (x >> i) & 1;
        if(!trie[root][bit])
        {
            trie[root][bit] = ++tot;
            clear(tot);
        }
        root = trie[root][bit];
    }
}
inline int Search(int x)
{
    int root = 0, ans = 0;
    for(int i=31; i>=0; i--)
    {
        int  bit = (x >> i) & 1;
        if(trie[root][bit ^ 1])
        {
            root = trie[root][bit ^ 1];
            ans += 1 << i;
        }
        else root = trie[root][bit];
    }
    return ans;
}
int maxx;
void dfs(int u, int fa)
{
    maxx = max(maxx, Search(dp[u]));
    Insert(dp[u]);
    for(int i=head[u], v, w; ~i; i=edge[i].nex)
    {
        v = edge[i].to; w = edge[i].val;
        if(v == fa) continue;
        dp[v] = dp[u] ^ w;
        dfs(v, u);
    }
}
inline void init()
{
    trie[0][0] = trie[0][1] = 0;
    tot = maxx = 0;
    cnt = 0;
    for(int i=1; i<=N; i++) head[i] = -1;
}
int main()
{
    scanf("%d", &N);
    init();
    for(int i=1, u, v, w; i<N; i++)
    {
        scanf("%d%d%d", &u, &v, &w);
        _add(u, v, w);
    }
    dfs(1, 0);
    printf("%d\n", maxx);
    return 0;
}
/*
4
1 2 3
2 3 4
2 4 6
*/