洛谷P4116 Qtree3 树剖+线段树

---

洛谷P4116 Qtree3

---

标签

• 树剖
• 线段树

---

简明题意

• 给一棵树，每个节点有黑色或者白色两种颜色。需要支持2种操作
  1. 修改：将某个节点的颜色取反（黑色变成白色，白色变黑色）
  2. 查询：对于给定的u，查询1–u路径上的第一个黑点是谁

---

思路

• 树剖，剖完用线段树取维护区间的最小深度对应的原始编号就行了

---

注意事项

• 注意线段树的操作是对新编号，所以传参要注意

---

总结

• 无

---

AC代码

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;

const int maxn = 1e5 + 10;

int n, m;
vector<int> g[maxn];

int dep[maxn], fa[maxn], siz[maxn], son[maxn];
void dfs1(int u, int f, int deep)
{
   dep[u] = deep;
   fa[u] = f;
   siz[u] = 1;

   int max_son = -1;
   for (auto& v : g[u])
   	if (v != f)
   	{
   		dfs1(v, u, deep + 1);
   		siz[u] += siz[v];
   		if (siz[v] > max_son)
   			max_son = siz[v], son[u] = v;
   	}
}

int top[maxn], id[maxn], cnt;
void dfs2(int u, int topf)
{
   top[u] = topf;
   id[u] = ++cnt;

   if (son[u])
   {
   	dfs2(son[u], topf);
   	for (auto& v : g[u])
   		if (v != fa[u] && v != son[u])
   			dfs2(v, v);
   }
}

struct Node
{
   int l, r, min, min_id;
};

Node tree[maxn * 4];

void build(int o, int l, int r)
{
   tree[o].l = l, tree[o].r = r;
   tree[o].min = 1e9;
   if (l == r)
   	return;

   int mid = (l + r) / 2;
   build(o * 2, l, mid);
   build(o * 2 + 1, mid + 1, r);
}

void update(int o)
{
   if (tree[o].l != tree[o].r)
   {
   	if (tree[o * 2].min < tree[o * 2 + 1].min)
   		tree[o].min = tree[o * 2].min, tree[o].min_id = tree[o * 2].min_id;
   	else
   		tree[o].min = tree[o * 2 + 1].min, tree[o].min_id = tree[o * 2 + 1].min_id;
   }
}

void change(int o, int x, int c, int idx)
{
   if (tree[o].l == tree[o].r)
   {
   	if (tree[o].min == 1e9)
   		tree[o].min = c, tree[o].min_id = idx;
   	else
   		tree[o].min = 1e9;
   	return;
   }

   int mid = (tree[o].l + tree[o].r) / 2;
   if (x <= mid)
   	change(o * 2, x, c, idx);
   else
   	change(o * 2 + 1, x, c, idx);

   update(o);
}

pair<int, int> ask(int o, int l, int r)
{
   if (tree[o].l == l && tree[o].r == r)
   	return pair<int, int>(tree[o].min, tree[o].min_id);

   int mid = (tree[o].l + tree[o].r) / 2;
   if (r <= mid)
   	return ask(o * 2, l, r);
   else if (l > mid)
   	return ask(o * 2 + 1, l, r);
   else
   	return min(ask(o * 2, l, mid), ask(o * 2 + 1, mid + 1, r));
}

void solve()
{
   int n, m;
   scanf("%d%d", &n, &m);
   for (int i = 1; i < n; i++)
   {
   	int u, v;
   	scanf("%d%d", &u, &v);

   	g[u].push_back(v), g[v].push_back(u);
   }

   dfs1(1, 1, 1);
   dfs2(1, 1);
   build(1, 1, n);

   while (m--)
   {
   	int opt;
   	scanf("%d", &opt);

   	if (opt == 0)
   	{
   		int u;
   		scanf("%d", &u);

   		change(1, id[u], dep[u], u);
   	}
   	else
   	{
   		int v;
   		scanf("%d", &v);

   		int ans = 1e9, ans_id = -1;
   		while (top[v] != 1)
   		{
   			pair<int, int> t = ask(1, id[top[v]], id[v]);
   			if (t.first < ans)
   				ans = t.first, ans_id = t.second;
   			v = fa[top[v]];
   		}
   		pair<int, int> t = ask(1, 1, id[v]);
   		if (t.first < ans)
   			ans_id = t.second;

   		printf("%d\n", ans_id);
   	}
   }
}

int main()
{
   freopen("Testin.txt", "r", stdin);
   solve();
   return 0;
}

---

双倍经验

• 无