题目大意:给你一棵树,刚开始每个节点都是-1,有两种操作
C x:查询x这个结点
T x c:将x和x的所有子孙结点都变成c
解题思路:dfs一下,找出每个点所管辖的区域(x和其所有子孙结点),这样就可以将点映射到区间了
#include <cstdio>
#include <cstring>
const int N = 50010;
const int M = 50010 << 2;
struct Edge{
int v, next;
Edge() {}
Edge(int v, int next): v(v), next(next) {}
}E[N * 2];
int head[N], id[N], left[N], right[N], val[M];
bool flag[M], vis[N];
int tot, n, q, cnt;
int dfs(int u, int fa) {
int start;
bool flag1 = false;
for (int i = head[u]; ~i; i = E[i].next) {
int v = E[i].v;
if (v != fa) {
if (!flag1) start = dfs(v, u);
else dfs(v, u);
flag1 = true;
}
}
id[u] = ++cnt;
if (!flag1) left[u] = cnt;
else left[u] = start;
right[u] = cnt;
return left[u];
}
void build(int u, int l, int r) {
val[u] = -1; flag[u] = false;
if (l == r) return ;
int mid = (l + r) >> 1;
build(u << 1, l, mid);
build(u << 1 | 1, mid + 1, r);
}
void PushDown(int u) {
if (flag[u]) {
val[u << 1] = val[u << 1 | 1] = val[u];
flag[u << 1] = flag[u << 1 | 1] = true;
flag[u] = false;
}
}
int Query(int u, int l, int r, int pos) {
if (l == r) return val[u];
PushDown(u);
int mid = (l + r) >> 1;
if (pos <= mid) return Query(u << 1, l, mid, pos);
else return Query(u << 1 | 1, mid + 1, r, pos);
}
void Modify(int u, int l, int r, int L, int R, int c) {
if (l == L && r == R) {
flag[u] = true;
val[u] = c;
return ;
}
PushDown(u);
int mid = (l + r) >> 1;
if (R <= mid) Modify(u << 1, l, mid, L, R, c);
else if (L > mid) Modify(u << 1 | 1, mid + 1, r, L, R, c);
else {
Modify(u << 1, l, mid, L, mid, c);
Modify(u << 1 | 1, mid + 1, r, mid + 1, R, c);
}
}
void AddEdge(int u, int v) {
E[tot] = Edge(v, head[u]);
head[u] = tot++;
E[tot] = Edge(u, head[v]);
head[v] = tot++;
}
void init() {
memset(vis, 0, sizeof(vis));
memset(head, -1, sizeof(head));
tot = 0;
scanf("%d", &n);
int u, v;
for (int i = 1; i < n; i++) {
scanf("%d%d", &u, &v);
vis[u] = true;
AddEdge(u, v);
}
cnt = 0;
for (int i = 1; i <= n; i++)
if (!vis[i]) {
dfs(i, -1);
break;
}
build(1, 1, n);
}
int cas = 1;
void solve() {
printf("Case #%d:\n", cas++);
scanf("%d", &q);
char op[4];
int a, b;
while (q--) {
scanf("%s", op);
if (op[0] == 'C') {
scanf("%d", &a);
printf("%d\n", Query(1, 1, n, id[a]));
}
else {
scanf("%d%d", &a, &b);
Modify(1, 1, n, left[a], right[a], b);
}
}
}
int main() {
int test;
scanf("%d", &test);
while (test--) {
init();
solve();
}
return 0;
}