题意:
给你n个节点和每个节点的颜色
给你(n-1)条边连接这n个节点
最后可以形成一棵树(保证)
接下来又m次操作
1 代表将 节点x及子树的所有颜色节点变为 c
2 代表查询节点x及其子树所有节点的颜色数目
思路: 由于只有60种颜色 long long 64位可以标记
用DFS给每个节点排序(排序会改表节点的序列)
对生成的新序列进行建树
注意:(1<<60) = 0 因为数字默认为int类型 所以1<<60超过32位 所以用1ll<<60
ACcode:
#include<bits/stdc++.h>
using namespace std;
const long long maxn = 400010;
struct node
{
long long l;
long long r;
long long lazy;
long long colour;
} tree[maxn<<2];
vector<long long>v[maxn];
long long vis[maxn];
long long R[maxn],L[maxn];
long long a[maxn];
long long cur[maxn];
long long id=0;
long long num(long long x)
{
long long res=0;
while(x>0)
{
x-=(x&(-x));
res++;
}
return res;
}
void dfs(long long x) //DFS序列会重新编号 x的新R[] L[] 记录区间 id代表x 的新号码
{
L[x]=++id;
cur[id]=a[x];
vis[x]=1;
for(long long i=0; i<v[x].size(); i++)
{
if(vis[v[x][i]] == 1)
continue;
dfs(v[x][i]);
}
R[x]=id;
}
void pushdown(long long root)
{
if (tree[root].lazy != 0 )
{
tree[root * 2].lazy = tree[root * 2 + 1].lazy = tree[root].lazy;
tree[root * 2].colour = tree[root * 2 + 1].colour= (1ll<<tree[root].lazy);
tree[root ].colour = (1ll<<tree[root].lazy);
tree[root].lazy = 0;
}
}
void pushup(long long root)
{
tree[root].colour = (tree[root * 2].colour | tree[root * 2 + 1].colour);
}
void build(long long root, long long l, long long r)
{
tree[root].l = l;
tree[root].r = r;
tree[root].lazy = 0;
if (l == r)
{
tree[root].colour = (1ll<<cur[l]);
return;
}
long long mid = (l + r) / 2;
build(root * 2, l, mid);
build(root * 2 + 1, mid + 1, r);
pushup(root);
}
void update(long long root, long long l, long long r, long long c)
{
long long mid = (tree[root].r + tree[root].l) / 2;
if (l<= tree[root].l && tree[root].r <= r)
{
tree[root].lazy = c;
tree[root].colour = (1ll<<c);
return;
}
pushdown(root);
if (l <= mid)
update(root * 2, l, r, c);
if (mid<r)
update(root * 2 + 1, l, r, c);
pushup(root);
}
long long querry(long long root,long long l,long long r)
{
long long mid = (tree[root].l + tree[root].r) / 2;
long long ans = 0;
if (l <= tree[root].l && tree[root].r <= r)
return tree[root].colour;
pushdown(root);
if (l <= mid)
ans |= querry(root * 2, l, r);
if (r > mid)
ans |= querry(root * 2 + 1, l, r);
pushup(root);
return ans;
}
int main() //freopen("in.txt","r",stdin);
{
long long n,m;
scanf("%I64d%I64d",&n,&m);
for(long long i=1; i<=n; i++)
scanf("%I64d",&a[i]);
for(long long i=1; i<=n-1; i++)
{
long long x,y;
scanf("%d%d",&x,&y);
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1);
build(1,1,n);
for(long long i=1; i<=m; i++)
{
long long Case;
scanf("%I64d",&Case);
if(Case == 2)
{
long long x;
scanf("%I64d",&x);
printf("%I64d\n",num( querry(1,L[x],R[x])) );
}
else
{
long long x;
long long c;
scanf("%I64d%I64d",&x,&c);
update(1,L[x],R[x],c);
}
}
return 0;
}