【luogu P4556】[Vani有约会]雨天的尾巴 /【模板】线段树合并

[Vani有约会]雨天的尾巴 /【模板】线段树合并

题目链接：luogu P4556

题目大意

给你一棵树，然后有一些操作时给一条路径上的每个点都放某一个类型的一个东西。
然后放完之后要你回答每个点上那个类型的东西最多，没有东西输出 0。

思路

突然发现自己原来没有写过线段树合并的模板。
（如果要看怎么做可以去看我线段树分裂的题解）

就直接上模板罢了。

代码

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

const int N = 1e5 + 100;
struct node {
	int to, nxt;
}e[N << 1];
int n, m, le[N], KK, rt[N];
int fa[N][21], deg[N], ans[N];
vector <int> G[N];

void add(int x, int y) {
	e[++KK] = (node){y, le[x]}; le[x] = KK;
}

void dfs(int now, int father) {
	deg[now] = deg[father] + 1; fa[now][0] = father;
	for (int i = 1; i <= 20; i++) fa[now][i] = fa[fa[now][i - 1]][i - 1];
	for (int i = le[now]; i; i = e[i].nxt)
		if (e[i].to != father) {
			dfs(e[i].to, now);
		}
}

int LCA(int x, int y) {
	if (deg[x] < deg[y]) swap(x, y);
	for (int i = 20; i >= 0; i--) if (deg[fa[x][i]] >= deg[y]) x = fa[x][i];
	if (x == y) return x;
	for (int i = 20; i >= 0; i--) if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i];
	return fa[x][0];
}

struct XD_tree {
	int ls[N << 6], rs[N << 6], maxn[N << 6], pla[N << 6], tot;
	bool leaf[N << 6];
	
	void up(int x) {
		if (maxn[ls[x]] >= maxn[rs[x]]) maxn[x] = maxn[ls[x]], pla[x] = pla[ls[x]];
			else maxn[x] = maxn[rs[x]], pla[x] = pla[rs[x]];
	}
	
	int merge(int x, int y) {
		if (!x || !y) return x + y;
		if (leaf[x]) {maxn[x] += maxn[y]; return x;}
		ls[x] = merge(ls[x], ls[y]);
		rs[x] = merge(rs[x], rs[y]);
		up(x); return x;
	}
	
	int insert(int now, int l, int r, int pl, int va) {
		if (!now) now = ++tot, leaf[now] = (l == r);
		if (l == r) {
			pla[now] = pl; maxn[now] += va; return now;
		}
		int mid = (l + r) >> 1;
		if (pl <= mid) ls[now] = insert(ls[now], l, mid, pl, va);
			else rs[now] = insert(rs[now], mid + 1, r, pl, va);
		up(now); return now;
	}
}T;

void dfs1(int now, int father) {
	for (int i = le[now]; i; i = e[i].nxt)
		if (e[i].to != father) dfs1(e[i].to, now), rt[now] = T.merge(rt[now], rt[e[i].to]);
	for (int i = 0; i < G[now].size(); i++)
		rt[now] = T.insert(rt[now], 1, 100000, G[now][i] < 0 ? -G[now][i] : G[now][i], G[now][i] < 0 ? -1 : 1);
	ans[now] = T.maxn[rt[now]] ? T.pla[rt[now]] : 0;
}

int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i < n; i++) {
		int x, y; scanf("%d %d", &x, &y); add(x, y); add(y, x);
	}
	
	dfs(1, 0);
	while (m--) {
		int x, y, z; scanf("%d %d %d", &x, &y, &z); int lca = LCA(x, y);
		G[x].push_back(z); G[y].push_back(z); G[lca].push_back(-z); G[fa[lca][0]].push_back(-z);
	}
	
	dfs1(1, 0);
	for (int i = 1; i <= n; i++) printf("%d\n", ans[i]);
	
	return 0;
}