[题解][NOI2015]软件包管理器

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int top[MAXN], sz[MAXN], son[MAXN], fa[MAXN],dep[MAXN],h[MAXN];
int clocker = 0;
vector<int> Tree[MAXN];
int n;
void dfs1(int curr)
{
	sz[curr] = 1;
	for (unsigned u = 0;u < Tree[curr].size();u++)
	{
		int &cur = Tree[curr][u];
		fa[cur] = curr;
		dep[cur] = dep[curr] + 1;
		dfs1(cur);
		sz[curr] += sz[cur];
		if (son[curr] == -1 || sz[cur] > sz[son[curr]])
		{
			son[curr] = cur;
		}
	}
	return;
}
void dfs2(int curr,int root)
{
	top[curr] = root;
	h[curr] = clocker;
	clocker++;
	if (son[curr] == -1)return;
	dfs2(son[curr], root);
	for (unsigned u = 0;u < Tree[curr].size();u++)
	{
		int &cur = Tree[curr][u];
		if (cur != son[curr])
		{
			dfs2(cur, cur);
		}
	}
}
const int ALL_INSTALL = 1;
const int ALL_UNINSTALL = -1;
const int NO_TAG = 0;
struct SegTree
{
	int RangeL, RangeR;
	SegTree *l, *r;
	int Installed;
	int Tag;
}*Root;
SegTree* MakeTree(int l, int r)
{
	SegTree* cur = new SegTree();
	cur->Installed = 0;
	cur->Tag = NO_TAG;
	if (l == r)
	{
		cur->RangeL = cur->RangeR = l;
		cur->l = cur->r = NULL;
		return cur;
	}
	int mid = (l + r) >> 1;
	cur->l = MakeTree(l, mid);
	cur->r = MakeTree(mid + 1, r);
	cur->RangeL = l;
	cur->RangeR = r;
	return cur;
}
void PushDown(SegTree* cur)
{
	if (!cur->Tag)return;
	if (cur->l == cur->r)
	{
		cur->Tag = NO_TAG;
		if (cur->Tag == ALL_INSTALL)
		{
			cur->Installed = 1;
		}
		else
		{
			cur->Installed = 0;
		}
		return;
	}
	cur->l->Tag = cur->r->Tag = cur->Tag;
	if (cur->Tag == ALL_INSTALL)
	{
		cur->Installed = cur->RangeR - cur->RangeL + 1;
	}
	else
	{
		cur->Installed = 0;
	}
	cur->Tag = NO_TAG;
	return;
}
int RangeQuery(SegTree* Range, int l, int r)
{
	if (Range->RangeL == l && Range->RangeR == r)
	{
		switch (Range->Tag)
		{
		case NO_TAG:		return Range->Installed;
		case ALL_INSTALL:	return r - l + 1;
		default:			return 0;
		}
	}
	if (Range->Tag)
	{
		if (Range->Tag == ALL_INSTALL)return r - l + 1;
		else return 0;
	}
	if (r <= Range->l->RangeR)
	{
		return RangeQuery(Range->l, l, r);
	}
	else if (l >= Range->r->RangeL)
	{
		return RangeQuery(Range->r, l, r);
	}
	else
	{
		return RangeQuery(Range->l, l, Range->l->RangeR) + RangeQuery(Range->r, Range->r->RangeL, r);
	}
}
int Ask(SegTree* Pos)
{
	if (!Pos)
	{
		return 0;
	}
	switch (Pos->Tag)
	{
	case NO_TAG:		return Pos->Installed;
	case ALL_INSTALL:	return Pos->RangeR - Pos->RangeL + 1;
	case ALL_UNINSTALL:	return 0;
	}
}
void RangeSet(SegTree* Range, int l, int r, int value)
{
	if (Range->RangeL == l && Range->RangeR == r)
	{
		Range->Tag = value;
		return;
	}
	PushDown(Range);
	if (r <= Range->l->RangeR)
	{
		RangeSet(Range->l, l, r, value);
	}
	else if (l >= Range->r->RangeL)
	{
		RangeSet(Range->r, l, r, value);
	}
	else
	{
		RangeSet(Range->l, l, Range->l->RangeR, value);
		RangeSet(Range->r, Range->r->RangeL, r, value);
	}
	Range->Installed = Ask(Range->l) + Ask(Range->r);
	return;
}
int Install(int x)
{
	int Edit = 0;
	while (x != -1)
	{
		int l = h[x], r = h[top[x]];
		if (l > r)swap(l, r);
		int Modify = r - l + 1 - RangeQuery(Root,l,r);
		if (!Modify)break;
		RangeSet(Root, l, r, ALL_INSTALL);
		x = fa[top[x]];
		Edit += Modify;
	}
	return Edit;
}
int Uninstall(int x)
{
	int l = h[x];
	int r = h[x] + sz[x] - 1;
	int ans = RangeQuery(Root, l, r);
	RangeSet(Root, l, r, ALL_UNINSTALL);
	return ans;
}
char buff[20];
/*
void check()
{
	fprintf(stderr, "-----CHECK-----\n");
	for (int i = 0;i < n;i++)
	{
		if (RangeQuery(Root, i, i))
		{
			fprintf(stderr,"%d Installed\n",i);
		}
		else
		{
			fprintf(stderr, "%d Not Installed\n", i);
		}
	}
	fprintf(stderr, "\n");
}
*/
int main()
{
	memset(son,-1, sizeof(son));
	fa[0] = -1;dep[0] = 1;
	scanf("%d", &n);
	Root = MakeTree(0, n - 1);
	for (int i = 1;i < n;i++)
	{
		int k;
		scanf("%d", &k);
		Tree[k].push_back(i);
	}
	dfs1(0);
	dfs2(0, 0);
	int q;
	scanf("%d\n", &q);
	while (q--)
	{
		char op;
		int x;
		scanf("%s %d", buff,&x);
		op = buff[0];
		if (op == 'i')
		{
			printf("%d\n", Install(x));
		}
		else
		{
			printf("%d\n", Uninstall(x));
		}
		//check();
	}
	return EXIT_SUCCESS;
}

提交地址：http://uoj.ac/problem/128
算法：树链剖分+线段树