【gym 101161E】:ACM Tax 主席树 + LCA

传送门

题意

给你一颗边带权树，多次询问路径上权值的中位数

分析

跟上一题一样，细节少了点，不用考虑$lca$带来的影响了

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 5e4 + 10, M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N], e[M], ne[M], w[M], num;
int father;
struct Node {
	int l, r;
	int cnt;
} tr[N * 50];
int root[N], dep[N], fa[N][25],idx;
int n, m;

void init() {
	for(int i = 1;i <= n;i++) h[i] = -1;
	idx = num = 0;
}

void add(int x, int y, int z) {
	ne[num] = h[x], e[num] = y, w[num] = z, h[x] = num++;
}

int build(int l, int r) {
	int p = ++idx;
	tr[p].cnt = 0;
	if (l == r) return p;
	int mid = (l + r) >> 1;
	tr[p].l = build(l, mid), tr[p].r = build(mid + 1, r);
	return p;
}

int insert(int p, int l, int r, int x) {
	int q = ++idx;
	tr[q] = tr[p];
	if (l == r) {
		tr[q].cnt++;
		return q;
	}
	int mid = (l + r) >> 1;
	if (x <= mid) tr[q].l = insert(tr[p].l, l, mid, x);
	else tr[q].r = insert(tr[p].r, mid + 1, r, x);
	tr[q].cnt = tr[tr[q].l].cnt + tr[tr[q].r].cnt;
	return q;
}

void dfs(int u, int f, int z) {
	dep[u] = dep[f] + 1;
	fa[u][0] = f;
	for(int i = 1;i <= 20;i++) fa[u][i] = fa[fa[u][i - 1]][i - 1];
	for(int i = h[u];~i;i = ne[i]){
		int j = e[i];
		if(j == f) continue;
		root[j] = insert(root[u],1,1e5 + 10,w[i]);
		dfs(j,u,w[i]);
	}
}

int LCA(int a, int b) {
	if (dep[a] < dep[b]) swap(a, b);
	for (int i = 20; i >= 0; i--)
		if (dep[fa[a][i]] >= dep[b])
			a = fa[a][i];
	if (a == b) return a;
	for (int i = 20; i >= 0; i--)
		if (fa[a][i] != fa[b][i])
			a = fa[a][i], b = fa[b][i];
	return fa[a][0];
}

int query(int B,int p,int q,int l,int r,int k){
    if(l == r) return r;
    int cnt = tr[tr[p].l].cnt + tr[tr[q].l].cnt - 2 * tr[tr[B].l].cnt;
    int mid = l + r >> 1;
    if(k <= cnt) return query(tr[B].l,tr[p].l,tr[q].l,l,mid,k);
    else return query(tr[B].r,tr[p].r,tr[q].r,mid + 1,r,k - cnt);
}



int main() {
	int T;
	read(T);
	while (T--) {
		read(n);
		init();
		for (int i = 1; i < n; i++) {
			int a, b, c;
			read(a), read(b), read(c);
			add(a, b, c), add(b, a, c);
		}
		root[0] = build(1, 1e5 + 10);
		dfs(1,0,0);
		read(m);
		while (m--) {
			int l,r;
			read(l),read(r);
			int x = LCA(l,r);
			int res = dep[l] + dep[r] - 2 * dep[x];
			if(res & 1){
				int ans = query(root[x],root[l],root[r],1,1e5 + 10,res / 2 + 1);
				printf("%.1lf\n",(double)ans);
			}
			else{
				int ans = query(root[x],root[l],root[r],1,1e5 + 10,res / 2 + 1) + query(root[x],root[l],root[r],1,1e5 + 10,res / 2);
				double p = 0.5 * ans;
				printf("%.1lf\n",p);
			}
		}
	}
	return 0;
}