[点分树 树状数组] BZOJ 3730 震波

线段树T成翔 只能用vector写BIT 痛苦的回忆啊

思路不难想 先建出点分树 然后每个点对于他掌管的点的距离与权值建成BIT

然后每次查询就是爬点分树

这里有点注意

往树上爬的时候不能中途break，不会因为有一个祖先爬不上去就终止，说不定有一个爷爷比爸爸还近

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
using namespace std;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
  return *p1++;
}

inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=100005;
const int K=25;

struct edge{
  int u,v,next;
}G[N<<1];
int head[N],inum;

inline void add(int u,int v,int p){
  G[p].u=u; G[p].v=v; G[p].next=head[u]; head[u]=p;
}

int n,val[N];
#define V G[p].v
int fat[N][K],dis[N][K];
int size[N],del[N];
int sum,rt,minimum;

inline void Root(int u,int fa) {  
  int maximum=0;  
  size[u]=1;  
  for (int p=head[u];p;p=G[p].next)  
    if (V!=fa && !del[V]) {  
      Root(V,u);  
      size[u]+=size[V];  
      maximum=max(maximum,size[V]);  
    }  
  maximum=max(maximum,sum-size[u]);  
  if (minimum>maximum) minimum=maximum,rt=u;  
}

int maxd;

inline void Depth(int u,int fa,int d,int f){
  size[u]=1; fat[u][++*fat[u]]=f; dis[u][++*dis[u]]=d;
  maxd=max(maxd,d);
  for (int p=head[u];p;p=G[p].next)
    if (!del[V] && V!=fa)
      Depth(V,u,d+1,f),size[u]+=size[V];
}

vector<int> c1[N],c2[N];

inline void Divi(int u) {  
  del[u]=1;
  maxd=0; Depth(u,0,0,u);
  int tmp=maxd; c1[u].resize(tmp+2); c1[u][0]=tmp+1; 
  for (int p=head[u];p;p=G[p].next)
    if (!del[V]){
      sum=size[V]; minimum=1<<30;   
      Root(V,u);
      c2[rt].resize(tmp+2); c2[rt][0]=tmp+1;
      Divi(rt);
    }
}

inline void Add(vector<int> &c,int x,int r){
  int maxn=c[0]; x++; 
  for (int i=x;i<=maxn;i+=i&-i)
    c[i]+=r;
}

inline int Query(const vector<int> &c,int x){
  int ret=0; x++; x=min(x,c[0]);
  for (int i=x;i;i-=i&-i)
    ret+=c[i];
  return ret;
}

/*int root1[N],root2[N];
int ls[N*100],rs[N*100],ssum[N*100],ncnt;

inline void Add(int &x,int l,int r,int t,int v){
  if (!x) x=++ncnt; ssum[x]+=v;
  if (l==r) return; 
  int mid=(l+r)>>1;
  if (t<=mid)
    Add(ls[x],l,mid,t,v);
  else
    Add(rs[x],mid+1,r,t,v);
}

inline int Query(int &x,int l,int r,int qr){
  if (!x) return 0;
  if (l==r) return ssum[x];
  int mid=(l+r)>>1,ret=0;
  if (qr<=mid)
    return Query(ls[x],l,mid,qr);
  else
    return ssum[ls[x]]+Query(rs[x],mid+1,r,qr);
    }*/
			     
int main(){
  int Q,iu,iv,order; int lastans=0;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(Q);
  for (int i=1;i<=n;i++) read(val[i]);
  for (int i=1;i<n;i++)
    read(iu),read(iv),add(iu,iv,++inum),add(iv,iu,++inum);
  minimum=1<<30; sum=n; Root(1,0);   
  Divi(rt);
  for (int i=1;i<=n;i++){
    reverse(fat[i]+1,fat[i]+*fat[i]+1),reverse(dis[i]+1,dis[i]+*dis[i]+1);
    for (int j=1;j<=*fat[i];j++){
      //Add(root1[fat[i][j]],0,n,dis[i][j],val[i]);
      //if (j-1) Add(root2[fat[i][j-1]],0,n,dis[i][j],val[i]);
      Add(c1[fat[i][j]],dis[i][j],val[i]);
      if (j-1) Add(c2[fat[i][j-1]],dis[i][j],val[i]);
    }
  }
  while (Q--){
    read(order); read(iu); read(iv);
    iu^=lastans; iv^=lastans;
    if (order==1){
      for (int j=1;j<=*fat[iu];j++){
	//Add(root1[fat[iu][j]],0,n,dis[iu][j],iv-val[iu]);
	//if (j-1) Add(root2[fat[iu][j-1]],0,n,dis[iu][j],iv-val[iu]);
	Add(c1[fat[iu][j]],dis[iu][j],iv-val[iu]);
	if (j-1) Add(c2[fat[iu][j-1]],dis[iu][j],iv-val[iu]);
      }
      val[iu]=iv;
    }else{
      int ret=0;
      for (int j=1;j<=*fat[iu];j++)
	if (iv-dis[iu][j]>=0){
	  //ret+=Query(root1[fat[iu][j]],0,n,iv-dis[iu][j]);
	  //if (j-1) ret-=Query(root2[fat[iu][j-1]],0,n,iv-dis[iu][j]);
	  ret+=Query(c1[fat[iu][j]],iv-dis[iu][j]);
	  if (j-1) ret-=Query(c2[fat[iu][j-1]],iv-dis[iu][j]);
	}	
      printf("%d\n",lastans=ret);
    }
  }
  return 0;
}