【例题记录】树链剖分·线段树特殊懒标记flag 0|1

习题：[NOI2015] 软件包管理器 - 洛谷

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int top[N], son[N], fa[N], siz[N], dep[N], dfn[N], rnk[N], dfncnt;
int head[N], cnt, n, q;
struct node {
	int v, ne;
}e[N << 1];
void add(int u, int v) {
	e[++cnt].v = v, e[cnt].ne = head[u], head[u] = cnt;
}
struct segtree {
	int sum[N << 2], flag[N << 2];
	void build(int root, int left, int right) {
		if (left == right) {
			sum[root] = 0 ; flag[root]=-1; return;
		}
		int mid = left + right >> 1;
		build(root << 1, left, mid);
		build(root << 1 | 1, mid + 1, right);
		sum[root] = sum[root << 1] + sum[root << 1 | 1];
	}
	void pushdown(int root, int left, int right) {
		if(flag[root]!=0&&flag[root]!=1) return;
		int mid = left + right >> 1;
		sum[root << 1] = (mid - left + 1) * flag[root];
		flag[root << 1] = flag[root];
		sum[root << 1 | 1] = (right - mid) * flag[root];
		flag[root << 1 | 1] = flag[root];
		flag[root]=-1;
	}
	void update(int root, int left, int right, int l, int r, int val) {
		if (l <= left && right <= r) {
			sum[root] = (right - left + 1) * val; flag[root] = val; return;
		}
		pushdown(root, left, right);
		int mid = left + right >> 1;
		if (l <= mid) update(root << 1, left, mid, l, r, val);
		if (r > mid) update(root << 1 | 1, mid + 1, right, l, r, val);
		sum[root]=sum[root<<1]+sum[root<<1|1];
	}
	int query(int root, int left, int right, int l, int r) {
		if (l <= left && right <= r) return sum[root];
		pushdown(root, left, right);
		int mid = left + right >> 1;
		if (r <= mid) return query(root << 1, left, mid, l, r);
		else if (l > mid) return query(root << 1 | 1, mid + 1, right, l, r);
		else return query(root << 1, left, mid, l, r) + query(root << 1 | 1, mid + 1, right, l, r);
	}
}tr;
void dfs1(int now) {
	siz[now] = 1;
	for (int i = head[now]; i; i = e[i].ne) {
		if (dep[e[i].v]) continue;
		dep[e[i].v] = dep[now] + 1;
		fa[e[i].v] = now;
		dfs1(e[i].v);
		siz[now] += siz[e[i].v];
		if (!son[now] || siz[son[now]] < siz[e[i].v]) son[now] = e[i].v;
	}
}
void dfs2(int now, int tp) {
	top[now] = tp;
	dfn[now] = ++dfncnt;
	rnk[dfncnt] = now;
	if (son[now]) dfs2(son[now], tp);
	for (int i = head[now]; i; i = e[i].ne) {
		if (e[i].v != son[now] && e[i].v != fa[now]) dfs2(e[i].v, e[i].v);
	}
}
int update_install(int x, int y) {
	int fx = top[x], fy = top[y];
	while (fx != fy) {
		if (dep[fx] >= dep[fy]) {
			tr.update(1, 1, n, dfn[fx], dfn[x], 1), x = fa[fx];
		}
		else {
			tr.update(1, 1, n, dfn[fy], dfn[y], 1), y = fa[fy];
		}
		fx = top[x], fy = top[y];
	}
	if (dfn[x] < dfn[y]) tr.update(1, 1, n, dfn[x], dfn[y], 1);
	else tr.update(1, 1, n, dfn[y], dfn[x], 1);
}
int main() {
	cin >> n;
	for (int i = 2; i <= n; i++) {
		int num; cin >> num; ++num;
		add(num, i);
	}
	dep[1] = 1; dfs1(1); dfs2(1, 1);
	tr.build(1, 1, n);
	cin >> q;
	while (q--) {
		string s; cin >> s;
		int t1 = tr.sum[1];
		if (s[0] == 'i') {
			int x; cin >> x; ++x;
			update_install(1, x);
			cout << abs(tr.sum[1] - t1) << endl;
		}
		else {
			int x; cin >> x; ++x;
			tr.update(1, 1, n, dfn[x], dfn[x] + siz[x] - 1, 0);
			cout << abs(tr.sum[1] - t1) << endl;
		}
	}
	return 0;
}