洛谷2146 软件包管理器

树链剖分的模板题

#include <bits/stdc++.h>
using namespace std;
//Filename: 918.cpp
//
//Author: dezhonger - csdisassembly@gmail.com

//Create: 2020-11-06 23:58:17

typedef long long LL;
const int N = 100010;
int n, m;
int h[N], e[N], ne[N], idx;
int id[N], cnt;
int dep[N], sz[N], top[N], fa[N], son[N];

struct Tree {
	int l, r, flag, sum;
}tr[N * 4];

void add(int a, int b) {
	e[idx] = b;
	ne[idx] = h[a];
	h[a] = idx++;
}
//求出深度和重儿子
void dfs1(int u, int depth) {
	dep[u] = depth, sz[u] = 1;
	for (int i = h[u]; ~i; i = ne[i]) {
		int j = e[i];
		dfs1(j, depth + 1);
		sz[u] += sz[j];
		if (sz[son[u]] < sz[j]) son[u] = j;
	}
}
//求出链头节点
void dfs2(int u, int t) {
	id[u] = ++cnt, top[u] = t;
	//如果是叶子节点
	if (!son[u]) return ;
	//先遍历重儿子,重儿子的链头就是它父节点的链头
	dfs2(son[u], t);
	for (int i = h[u]; ~i; i = ne[i]) {
		int j = e[i];
		if (j == son[u]) continue;
		//轻儿子的链头就是自己
		dfs2(j, j);
	}
}

void pushup(int u) {
	tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
}

void pushdown(int u) {
	auto &root = tr[u];
	auto &left = tr[u << 1];
	auto &right = tr[u << 1 | 1];
	if (root.flag != -1) {
		left.sum = root.flag * (left.r - left.l + 1);
		right.sum = root.flag * (right.r - right.l + 1);
		left.flag = right.flag = root.flag;
		root.flag = -1;
	}
}

void build(int u, int l, int r) {
	tr[u] = {l, r, -1, 0};
	if (l == r) return ;
	int mid = l + r >> 1;
	build(u << 1, l, mid);
	build(u << 1 | 1, mid + 1, r);
}

void update(int u, int l, int r, int k) {
	if (l <= tr[u].l && r >= tr[u].r) {
		tr[u].flag = k;
		tr[u].sum = k * (tr[u].r - tr[u].l + 1);
		return ;
	}
	int mid = tr[u].l + tr[u].r >> 1;
	pushdown(u);
	if (l <= mid)  update(u << 1, l, r, k);
	if (r > mid) update(u << 1 | 1, l, r, k);
	pushup(u);
}

void update_path(int u, int v, int k) {
	while (top[u] != top[v]) {
		if (dep[top[u]] < dep[top[v]]) swap(u, v);
		update(1, id[top[u]], id[u], k);
		u = fa[top[u]];
	}
	if (dep[u] < dep[v]) swap(u, v);
	update(1, id[v], id[u], k);
}

void update_tree(int u, int k) {
	update(1, id[u], id[u] + sz[u] - 1, k);
}


int main() {
	scanf("%d", &n);
	memset(h, -1, sizeof h);
	for (int i = 2; i <= n; i++) {
		int p;
		scanf("%d", &p);
		p++;
		add(p, i);
		fa[i] = p;
	}
	dfs1(1, 1);
	dfs2(1, 1);
	build(1, 1, n);

	scanf("%d", &m);
	char op[20];
	int x;
	while (m--) {
		scanf("%s%d", op, &x);
		x++;
		int t = tr[1].sum;
		if (!strcmp(op, "install")) {
			update_path(1, x, 1);
			printf("%d\n", tr[1].sum - t);
		} else {
			update_tree(x, 0);
			printf("%d\n", t - tr[1].sum);
		}
	}
    return 0;
}