题目链接
给定一棵树,已知每个节点的父亲节点,和每个节点上的名字(字符串),对于每个询问vi,ki,求子树vi内v的kth层儿子(子树内比子树根深度大k层的部分)中不重复名字的个数。
首先,如果是用Dsu的话,需要注意到一种情况:
5
a 0
a 1
a 1
a 1
a 2
1
1 1
ans:1
可以画一下图,不然会WA9,遇到这样的情况的话,我们需要考虑的是它在对应的深度上,以及其余的深度上的,所以,我在这维护了一个unordered_set,因为set带log,能优化还是尽量优化下来。
然后我们对每个子树的对应的深度进行维护,因为是Dsu,跟轻重链有着相互对应的关系,所以,我们确保了复杂度是在级别的。因为深度,以及深度放进set中维护的点,其实也就是遍历到的点,所以点是级别的,也意味着复杂度是级别的。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e5 + 7;
int N, Q, head[maxN], cnt, name[maxN], name_ith;
struct Eddge
{
int nex, to;
Eddge(int a=-1, int b=0):nex(a), to(b) {}
}edge[maxN];
inline void addEddge(int u, int v)
{
edge[cnt] = Eddge(head[u], v);
head[u] = cnt++;
}
int siz[maxN], dfn[maxN], tot, rid[maxN], Wson[maxN], deep[maxN];
void pre_dfs(int u)
{
siz[u] = 1; dfn[u] = ++tot; rid[tot] = u;
int maxx = 0;
for(int i=head[u], v; ~i; i=edge[i].nex)
{
v = edge[i].to;
deep[v] = deep[u] + 1;
pre_dfs(v);
siz[u] += siz[v];
if(siz[v] > maxx)
{
maxx = siz[v];
Wson[u] = v;
}
}
}
struct Question
{
int id, depth;
Question(int a=0, int b=0):id(a), depth(b) {}
};
vector<Question> vt[maxN];
int ans[maxN];
unordered_set<int> deep_kid[maxN << 1];
void dfs(int u, bool keep)
{
for(int i=head[u], v; ~i; i=edge[i].nex)
{
v = edge[i].to;
if(v == Wson[u]) continue;
dfs(v, false);
}
if(Wson[u]) dfs(Wson[u], true);
for(int i=head[u], v, id; ~i; i=edge[i].nex)
{
v = edge[i].to;
if(v == Wson[u]) continue;
for(int j=dfn[v]; j<dfn[v] + siz[v]; j++)
{
id = rid[j];
deep_kid[deep[id]].insert(name[id]);
}
}
int len = (int)vt[u].size();
Question now;
for(int i=0; i<len; i++)
{
now = vt[u][i];
ans[now.id] = (int)deep_kid[now.depth].size();
}
if(!keep)
{
for(int i=dfn[u] + 1, v; i<dfn[u] + siz[u]; i++)
{
v = rid[i];
deep_kid[deep[v]].clear();
}
}
else
{
deep_kid[deep[u]].insert(name[u]);
}
}
inline void init()
{
cnt = name_ith = tot = 0;
for(int i=0; i<=N; i++) head[i] = -1;
}
string s;
unordered_map<string, int> mp;
int main()
{
scanf("%d", &N);
init();
for(int i=1, ff; i<=N; i++)
{
cin >> s; scanf("%d", &ff);
if(!mp[s]) mp[s] = ++name_ith;
name[i] = mp[s];
addEddge(ff, i);
}
deep[0] = 0;
pre_dfs(0);
scanf("%d", &Q);
for(int i=1, id, depth; i<=Q; i++)
{
scanf("%d%d", &id, &depth);
vt[id].push_back(Question(i, depth + deep[id])); //这里记录的是真实深度
}
dfs(0, false);
for(int i=1; i<=Q; i++) printf("%d\n", ans[i]);
return 0;
}