CodeForces - 343D Water Tree(树链剖分+线段树)
题意:
给出一棵树,然后给出m次操作,每次操作分为三种:
1 v:将v及其子树全部变为1
2 v:将v及其祖先全部变为0
3 v:查询点v的值
思路:
直接模拟
#include <bits/stdc++.h>
using namespace std;
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
typedef long long ll;
const int maxn=5e5+100;
int n,m,tot,siz[maxn],fa[maxn],son[maxn],id[maxn],idd[maxn],sum[maxn<<2],top[maxn],lazy[maxn<<2];
vector<int>mp[maxn];
void dfs1(int x,int f){
siz[x]=1;
fa[x]=f;
for(auto y:mp[x]){
if(y==f)continue;
dfs1(y,x);
siz[x]+=siz[y];
if(siz[son[x]]<siz[y])son[x]=y;
}
}
void dfs2(int x,int root){
id[x]=++tot;
idd[tot]=x;
top[x]=root;
if(son[x])dfs2(son[x],root);
for(auto y:mp[x]){
if(y!=fa[x]&&y!=son[x])dfs2(y,y);
}
}
void pushdown(int rt){
if(lazy[rt]!=-1){
sum[rt<<1]=sum[rt<<1|1]=lazy[rt];
lazy[rt<<1]=lazy[rt<<1|1]=lazy[rt];
lazy[rt]=-1;
}
}
void update(int rt,int l,int r,int x,int y,int val){
if(x<=l&&r<=y){
lazy[rt]=val;
sum[rt]=val;
return;
}
int mid=(l+r)>>1;
pushdown(rt);
if(x<=mid)update(lson,x,y,val);
if(y>mid)update(rson,x,y,val);
}
int query(int rt,int l,int r,int x){
if(l==r)return sum[rt];
int mid=(l+r)>>1;
pushdown(rt);
if(x<=mid)return query(lson,x);
else return query(rson,x);
}
int main(){
scanf("%d",&n);
for(int i=1;i<=4*n+5;i++)lazy[i]=-1;
for(int i=1,x,y;i<n;i++){
scanf("%d%d",&x,&y);
mp[x].push_back(y),mp[y].push_back(x);
}
dfs1(1,0);
dfs2(1,1);
scanf("%d",&m);
while(m--){
int op,x;
scanf("%d%d",&op,&x);
if(op==1){
update(1,1,n,id[x],id[x]+siz[x]-1,1);
}
else if(op==2){
while(top[x]!=1){
update(1,1,n,id[top[x]],id[x],0);
x=fa[top[x]];
}
update(1,1,n,1,id[x],0);
}
else printf("%d\n",query(1,1,n,id[x]));
}
}