01Trie基础模板 P4551

//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
const int N = 100005;
int n;
int head[N] , cnt;
struct node{
    int t , next, w;
}edge[2 * N];
void add (int f, int t, int w)
{
    edge[cnt].t = t;
    edge[cnt].w = w;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
int val[N];
void dfs (int u , int fa)
{
    for (int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t , w = edge[i].w;
        if (v != fa)
        {
            val[v] = (val[u] ^ w);
            dfs (v, u);
        }
    }
}
int trie[N*30][2], tot = 0, root;
void insert (int& rt , int num , int dep)
{
    if(!rt) rt = ++ tot;
    if(dep < 0) return ;
    int x = (num >> dep) & 1;
    insert(trie[rt][x], num, dep - 1);
}
ll query (int rt , int num ,int dep)
{
    if (dep < 0) return 0;
    ll ans = 0;
    int x = (num >> dep) & 1;
    if (trie[rt][x^1])
        ans += (1 << dep) + query (trie[rt][x^1] , num, dep - 1);
    else
        ans += query(trie[rt][x] , num, dep - 1);
    return ans ;
}
int main()
{
    read(n);
    mem (head,-1);
    for (int i = 1 ; i < n ; i ++)
    {
        int u , v , w;
        read(u, v , w);
        add (u, v, w);
        add (v, u, w);
    }
    dfs (1, 1);
    for (int i = 1; i <= n ; i ++)
        insert(root,val[i],30);
    ll ans = 0;
    for (int i = 1; i <= n ; i ++)
        ans = max (ans , query(root, val[i], 30));
    write(ans), LF;
}