POJ 題目3321 Apple Tree（線段樹）

標籤：each   arch   int   car   lin   img   images   iss   bsp   

Apple Tree

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 21566		Accepted: 6548

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 toN 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 forku and forkv 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 forkx, 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.

Sample Input

31 21 33Q 1C 2Q 1

Sample Output

32

Source

POJ Monthly--2007.08.05, Huang, Jinsong

題目大意給你一棵樹，每一個節點開始的時候有一個蘋果，下邊m個操作，Q a，查詢以a和a的子樹的總共的蘋果數，c b。改動操作，改變b節點，，開始在有變沒有，沒有變成有

ac代碼

#include<stdio.h>#include<string.h>struct node{int u,v,next;}edge[100010<<1];int head[100010],cnt,num[100010],son[100010],cc,vis[100100];void add(int u,int v){edge[cnt].u=u;edge[cnt].v=v;edge[cnt].next=head[u];head[u]=cnt++;}void dfs(int u){num[u]=++cc;//son[u]=1;vis[u]=1;for(int i=head[u];i!=-1;i=edge[i].next){int v=edge[i].v;if(!vis[v])dfs(v);//son[u]+=son[v];}son[u]=cc;}struct s{int sum,cover;}node[100010<<2];void pushdown(int tr,int m){if(node[tr].cover){node[tr<<1].cover=node[tr<<1|1].cover=1;node[tr<<1].sum=m-(m>>1);node[tr<<1|1].sum=(m>>1);node[tr].cover=0;}}void build(int l,int r,int tr){node[tr].cover=1;node[tr].sum=r-l+1;if(l==r){return;}int mid=(l+r)>>1;build(l,mid,tr<<1);build(mid+1,r,tr<<1|1);}void update(int pos,int l,int r,int tr){if(l==pos&&r==pos){if(node[tr].cover){node[tr].cover=0;node[tr].sum=0;}else{node[tr].cover=1;node[tr].sum=1;}return;}pushdown(tr,r-l+1);int mid=(l+r)>>1;if(pos<=mid)update(pos,l,mid,tr<<1);elseupdate(pos,mid+1,r,tr<<1|1);node[tr].sum=node[tr<<1].sum+node[tr<<1|1].sum;if(node[tr<<1].cover&&node[tr<<1|1].cover){node[tr].cover=1;}}int query(int L,int R,int l,int r,int tr){if(L<=l&&R>=r){return node[tr].sum;}int mid=(l+r)>>1;pushdown(tr,r-l+1);int ans=0;if(L<=mid)ans+=query(L,R,l,mid,tr<<1);if(R>mid)ans+=query(L,R,mid+1,r,tr<<1|1);return ans;/*if(R<=mid)return query(L,R,l,mid,tr<<1);elseif(L>mid)return query(L,R,mid+1,r,tr<<1|1);elsereturn query(L,mid,l,mid,tr<<1)+query(mid+1,R,mid+1,r,tr<<1|1);*/}int main(){int n;while(scanf("%d",&n)!=EOF){cnt=0;cc=0;memset(head,-1,sizeof(head));memset(vis,0,sizeof(vis));int i;for(i=0;i<n-1;i++){int a,b;scanf("%d%d",&a,&b);add(a,b);}dfs(1);int m;scanf("%d",&m);build(1,n,1);while(m--){char s[2];scanf("%s",s);if(s[0]=='Q'){int a;scanf("%d",&a);int ans=query(num[a],son[a],1,n,1);printf("%d\n",ans);}else{int a;scanf("%d",&a);update(num[a],1,n,1);}}}}

POJ 題目3321 Apple Tree（線段樹）