CF Gym ACM Tax (主席树, LCA)

求树上两点间路径上边权的中位数.

 

就是 z = lca(x,y)

x y 减去 两倍的 z.

#include<bits/stdc++.h>
using namespace std;
const int N = 5e4+100;
int Head[N],Next[N*2],To[N*2],Val[N*2],cnt;
int dep[N],f[N][23];
int ls[N*40],rs[N*40],rt[N],tim,num[N*40];
int n,m,nm;
void add(int u , int v, int w){
    ++cnt; Next[cnt] = Head[u]; Head[u] = cnt; To[cnt] = v; Val[cnt] = w;
}
void modify(int &now, int l, int r, int k){
    tim++; ls[tim] = ls[now]; rs[tim] = rs[now];  num[tim] = num[now] + 1;  now = tim;
    if (l + 1 == r) return;
    int mid = (l + r) >> 1;
    if (k < mid) modify(ls[now],l,mid,k);
    if (k >= mid) modify(rs[now],mid,r,k);
}

int Query(int rt1, int rt2, int rt3, int l, int r, int a){
    if (l >= r) return 0;
    if (l + 1 == r){
        return l;
    }
    int mid = (l + r) >> 1;
    int ans = num[ls[rt2]] + num[ls[rt1]] - 2*num[ls[rt3]]; // num没有写
    if (ans >= a) return Query(ls[rt1],ls[rt2],ls[rt3],l,mid,a); 
    if (ans < a) return Query(rs[rt1],rs[rt2],rs[rt3],mid,r,a-ans); //手残 rs 写成rt
    return 0;
}

void dfs(int u, int fa, int deep){
    f[u][0] = fa; dep[u] = deep;
    for (int i = 1; i < 23; ++i) f[u][i] = f[f[u][i-1]][i-1];
    for (int i = Head[u]; i; i = Next[i]){
        int v = To[i]; 
        if (v == fa) continue;
        rt[v] = rt[u]; modify(rt[v],1,nm+1,Val[i]);
        dfs(v,u,deep + 1);
    }
}

int LCA(int x, int y){
    if (dep[x] < dep[y]) swap(x,y);
    for (int i = 22; i >= 0; --i)
        if (dep[f[x][i]] >= dep[y]) x = f[x][i];
    if (x == y) return x;
    for (int i = 22; i >= 0; --i)
        if (f[x][i] != f[y][i]){
            x = f[x][i]; y = f[y][i];
        }
    return f[x][0];
}

void init(){
    cnt = 0; memset(Head, 0, sizeof Head);
    int x,y,z;
    nm = 0; tim = 0;
    scanf("%d",&n);
    for (int i  = 1; i < n; ++i){
        scanf("%d%d%d",&x,&y,&z);
        add(x,y,z); add(y,x,z); nm = max(nm,z);
    }
    memset(rt, 0 ,sizeof rt);
    memset(num, 0, sizeof num);
    dfs(1,0,1); //这里 0 的深度和 1 的深度设成一样了.
    scanf("%d",&m);
    for (int i = 0; i < m; ++i){
        scanf("%d%d",&x,&y);
        z = LCA(x,y);
        int tot = dep[x] + dep[y] - 2*dep[z];
        int ans;
        if (tot&1){
            ans = Query(rt[x],rt[y],rt[z],1,nm+1,(tot+1)/2);
            printf("%.1lf\n",1.0*ans);
        } else{
            ans = Query(rt[x],rt[y],rt[z],1,nm+1,tot/2);
            ans += Query(rt[x],rt[y],rt[z],1,nm+1,tot/2+1);
            printf("%.1lf\n",1.0*ans/2);
        }
    }
}
int main(){
    int T; scanf("%d",&T);
    while(T--){
        init();
    } 
    return 0;
}
/*
1
6
1 2 9
2 5 5
2 4 7
3 5 1
3 6 4
5
1 3
4 6
2 6
3 5
4 5




5.0
4.5
4.0
*/