这题快速维护的方法是:
每个节点只有一个父亲,和许多儿子
这样每个节点存放儿子每种颜色的数目,用个map来存,然后和父亲的关系每次特殊考虑即可
每次染色完,把当前节点颜色修改,然后父亲的map修改即可
代码:
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
using namespace std;
const int N = 100005;
int t, n;
vector<int> g[N];
int fa[N], a[N];
map<int, int> c[N];
int main() {
int cas = 0;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
int u, v;
int ans = 1;
for (int i = 1; i <= n; i++) {
g[i].clear();
c[i].clear();
a[i] = 0;
}
for (int i = 0; i < n - 1; i++) {
scanf("%d%d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
queue<int> Q;
Q.push(1);
while (!Q.empty()){
int u = Q.front(); Q.pop();
for (int i = 0; i < g[u].size(); i++){
int v = g[u][i];
if (fa[u] == v) continue;
c[u][0]++;
fa[v] = u;
Q.push(v);
}
}
printf("Case #%d:\n", ++cas);
int qn, q;
scanf("%d", &qn);
while (qn--) {
scanf("%d", &q);
if (q == 1) printf("%d\n", ans);
else {
int u, x;
scanf("%d%d", &u, &x);
if (a[u] == x) continue;
ans += c[u][a[u]];
ans -= c[u][x];
if (u != 1) {
if (a[fa[u]] != a[u]) {
if (a[fa[u]] == x) ans--;
} else ans++;
}
c[fa[u]][a[u]]--;
c[fa[u]][x]++;
a[u] = x;
}
}
}
return 0;
}