The xor-longest Path(位运算 + 树形DP + 字典树)

The xor-longest Path

一、题意

给你一棵n个节点的树，树的边都有权值，从树中选取两个节点x，y，使得从x到y的路径上边的权值的异或最大。

二、题解

1. 异或存在一个性质，1^1 = 0，所以从x到y的异或 = 从x到根的异或 ^ 从y到根的异或。
2. 我们先dfs求一下每个节点到根的异或。
3. 再用创建逆序字典树，求解最大的异或即可。

三、Accode

/*
 * @Author: NEFU_马家沟老三
 * @LastEditTime: 2020-09-12 13:59:36
 * @CSDN blog: https://blog.csdn.net/acm_durante
 * @E-mail: 1055323152@qq.com
 * @ProbTitle: 
 */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define lowbit(x) ((x) & -(x))
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define mem(a, b) memset(a, b, sizeof(a))
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const double PI = acos(-1.0);
const int N = 1e5+5;
ll dis[N];//到根节点异或的距离
int head[N],cnt = 0;
struct node
{
    int v,next;
    ll w;
}e[N<<1];

int trie[N*32][2], tot = 1;

void add(int u,int v,ll w){//链式前向星
    e[++cnt].v = v;
    e[cnt].w = w;
    e[cnt].next = head[u];
    head[u] = cnt;
}

void dfs(int u,int fa){//树形dp
    for(int i = head[u]; ~i ; i = e[i].next){
        int v = e[i].v; ll w = e[i].w;
        if(fa == v) continue;
        dis[v] = dis[u] ^ w; 
        dfs(v,u);
    }
}

void insert_trie(ll x){//构建字典树
    int p = 1;
    for(int i = 30 ;i >= 0; i--){
        int tmp = (x>>i)&1;
        if(trie[p][tmp] == 0) trie[p][tmp] = ++tot;
        p = trie[p][tmp];
    }
}

ll search_trie(ll x){//查询答案
    ll res =0;
    int p = 1;
    for(int i = 30; i >= 0; i--){
        int tmp = (x>>i)&1;
        if(trie[p][tmp^1]){
            p = trie[p][tmp^1];
            res += (1 << i);
        }
        else{
            p = trie[p][tmp];
        }
    }
    return res;
}
int main()
{
    int n;
    mem(head,-1);
    scanf("%d",&n);
    rep(i,1,n-1){
        int u,v;
        ll w;
        scanf("%d%d%lld",&u,&v,&w);
        add(u,v,w);
        add(v,u,w);
    }
    dfs(0,0);
    ll ans = 0;
    rep(i,1,n){
        ans = max(ans,search_trie(dis[i]));
        insert_trie(dis[i]);
    }
    printf("%lld\n",ans);
    return 0;
}
/*
4
0 1 3
1 2 4
1 3 6

7
*/