poj3321 Apple Tree

Description

There is an apple tree outside of kaka’s house. Every autumn, a lot of
apples will grow in the tree. Kaka likes apple very much, so he has
been carefully nurturing the big apple tree.

The tree has N forks which are connected by branches. Kaka numbers the
forks by 1 to N and the root is always numbered by 1. Apples will grow
on the forks and two apple won’t grow on the same fork. kaka wants to
know how many apples are there in a sub-tree, for his study of the
produce ability of the apple tree.

The trouble is that a new apple may grow on an empty fork some time
and kaka may pick an apple from the tree for his dessert. Can you help
kaka?

Input

The first line contains an integer N (N ≤ 100,000) , which is the
number of the forks in the tree. The following N - 1 lines each
contain two integers u and v, which means fork u and fork v are
connected by a branch. The next line contains an integer M (M ≤
100,000). The following M lines each contain a message which is either
“C x” which means the existence of the apple on fork x has been
changed. i.e. if there is an apple on the fork, then Kaka pick it;
otherwise a new apple has grown on the empty fork. or “Q x” which
means an inquiry for the number of apples in the sub-tree above the
fork x, including the apple (if exists) on the fork x Note the tree is
full of apples at the beginning

Output For every inquiry, output the correspond answer per line.

dfs序+树状数组维护子树信息。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int fir[250010],ne[500010],to[500010],fa[250010],lf[250010],rt[250010],s[250010],n,clo;
void add(int num,int f,int t)
{
    ne[num]=fir[f];
    fir[f]=num;
    to[num]=t;
}
void dfs(int u,int f)
{
    fa[u]=f;
    lf[u]=++clo;
    for (int i=fir[u];i;i=ne[i])
      if (to[i]!=f)
        dfs(to[i],u);
    rt[u]=clo;
}
int qry(int p)
{
    int ret=0;
    for (;p;p-=p&-p)
      ret+=s[p];
    return ret;
}
void add(int p,int x)
{
    for (;p<=n;p+=p&-p)
      s[p]+=x;
}
int main()
{
    int i,j,k,m,p,q,x,y,z;
    char ss[5];
    scanf("%d",&n);
    for (i=1;i<n;i++)
    {
        scanf("%d%d",&x,&y);
        add(i*2,x,y);
        add(i*2+1,y,x);
    }
    dfs(1,-1);
    for (i=2;i<=n;i++)
    {
        add(lf[i],1);
        add(rt[i]+1,-1);
    }
    scanf("%d",&m);
    while (scanf("%s",ss+1)==1)
      if (ss[1]=='W')
      {
        scanf("%d",&x);
        printf("%d\n",qry(lf[x]));
      }
      else
      {
        scanf("%d%d",&x,&y);
        if (fa[x]==y) swap(x,y);
        add(lf[y],-1);
        add(rt[y]+1,1);
      }
}