poj3321(树状数组)
来源:互联网 发布:张大奕的淘宝店招人吗 编辑:程序博客网 时间:2024/05/29 11:24
http://poj.org/problem?id=3321
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
Sample Input
31 21 33Q 1C 2Q 1
Sample Output
32
#include <iostream>#include<cstring>#include<cstdlib>#include<string>#include<cstdio>#include<queue>#include<stack>#include<vector>#include<map>#include<list>#include<set>#define INF 1<<30#define max 100002using namespace std;struct nodel{ int next ,tail;} edge[max];struct node2{ int r,l;} apple[max];int s[max],cnt,c[max],a[max];void dfs(int u){ int i; apple[u].l=cnt; for(i=s[u]; i!=-1; i=edge[i].next) dfs(edge[i].tail); apple[u].r=cnt++;}inline int lowbit(int x){ return x&(-x);}void change(int x){ int i; if(a[x]) for(int i=x; i<cnt; i+=lowbit(i)) c[i]++; else for(i=x; i<cnt; i+=lowbit(i)) c[i]--;}int sum(int x){ int i,res=0; for(i=x; i>0; i-=lowbit(i)) res+=c[i]; return res;}int main(){ int i,n,m,t1,t2,t; char str[3]; scanf("%d",&n); memset(s,-1,sizeof(s)); for(i=0; i<n-1; i++) { scanf("%d%d",&t1,&t2); edge[i].tail=t2; edge[i].next=s[t1]; s[t1]=i; } cnt=1; dfs(1); scanf("%d",&m); for(i=1; i<=n; i++) { a[i]=1; change(i); } while(m--) { scanf("%s %d",str,&t); if(str[0]=='Q') printf("%d\n",sum(apple[t].r)-sum(apple[t].l-1)); else { a[apple[t].r]=(a[apple[t].r]+1)%2; change(apple[t].r); } } return 0;}
- poj3321(树状数组)
- poj3321 (树状数组)
- Apple Tree(POJ3321)(树状数组)
- poj3321 树状数组+dfs(时间戳)
- poj3321 dfs+树状数组
- poj3321---树状数组
- poj3321 树状数组
- poj3321 树状数组
- poj3321 树状数组
- poj3321 图+树状数组
- 【树状数组】 poj3321 Apple Tree
- poj3321 树状数组 线段树
- POJ3321---Apple Tree(树状数组)
- POJ3321:Apple Tree(树状数组)
- POJ3321:Apple Tree(树状数组)
- POJ3321 dfs序+树状数组
- POJ3321(dfs序+树状数组)
- (POJ3321)Apple Tree <dfs序列 树状数组>
- 模型模板
- 实现TreeView父子节点的联动
- pulltorefresh 上拉加载 下拉刷新
- Android开源项目(二)
- ultraedit替换所有空白行 --正则表达式使用
- poj3321(树状数组)
- C语言堆栈入门——堆和栈的区别
- R Extension package category and search
- AnnotationSessionFactoryBean和LocalSessionFactoryBean的区别
- HDU-1875-畅通工程再续-最小生成树
- js判断鼠标位置是不是在某个div中
- [ACM] POJ 2593 Max Sequence (动态规划,最大字段和)
- Ubuntu 下为Eclipse添加GBK等编码
- 如何优化Cocos2d-X游戏的内存