poj 3321 Apple Tree(树状数组)
2016-08-07 12:32
337 查看
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?
![](http://poj.org/images/3321_1.gif)
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.
Sample Input
Sample Output
Source
POJ Monthly--2007.08.05, Huang, Jinsong
详细题解
比较清晰的代码
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 26346 | Accepted: 7820 |
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?
![](http://poj.org/images/3321_1.gif)
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.
Sample Input
3 1 2 1 3 3 Q 1 C 2 Q 1
Sample Output
3 2
Source
POJ Monthly--2007.08.05, Huang, Jinsong
详细题解
比较清晰的代码
#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<vector> using namespace std; const int maxn=100000+10; int begin[maxn],end[maxn],apple[maxn],c[maxn]; int head[maxn]; int cnt,n; struct Edge { int to,next; }edge[maxn*2]; void addedge(int u,int v) { edge[cnt].to=v,edge[cnt].next=head[u],head[u]=cnt++;/////////// } int lowbit(int x) { return x&(-x); } int sum(int x) { int ret=0; while(x>0){ ret+=c[x];x-=lowbit(x); } return ret; } void add(int x,int d) { while(x<=n){ c[x]+=d;x+=lowbit(x); } } void init() { for(int i=1;i<=n;i++) apple[i]=1; memset(c,0,sizeof(c)); memset(begin,0,sizeof(begin)); memset(end,0,sizeof(end)); memset(head,-1,sizeof(head)); cnt=0; for(int i=1;i<=n;i++) add(i,1); } void dfs(int u,int fa) { begin[u]=++cnt; for(int i=head[u];i!=-1;i=edge[i].next) { int v=edge[i].to; if(v==fa) continue; dfs(v,u); } end[u]=cnt; } int main() { scanf("%d",&n); init(); for(int i=0;i<n-1;i++) { int u,v; scanf("%d%d",&u,&v); addedge(u,v),addedge(v,u); } cnt=0; dfs(1,0); int m; scanf("%d",&m); char s[10]; while(m--) { scanf("%s",s); if(s[0]=='Q') { int u; scanf("%d",&u); int ans=sum(end[u])-sum(begin[u]-1); printf("%d\n",ans); } else if(s[0]=='C') { int u; scanf("%d",&u); if(apple[u]) { add(begin[u],-1); apple[u]=0; } else { add(begin[u],1); apple[u]=1; } } } }
相关文章推荐
- cf602B Approximating a Constant Range
- Android——Service
- 仿微信聊天界面——键盘与面板的切换
- Android实现搜索功能 AutoCompleteTextView和MultiAutoCompleteTextView的用法
- 【Android】《App研发录》总结
- Android studio怎么直接对apk签名?
- Android Studio 签名打包过程图解
- Android studio 生成自定义文件名 apk
- eventBus3.0组件的详细操作
- 使用PathMeasure实现 动画CheckBox
- iOS 开发问题小结two
- android 加载图片oom若干方案小结
- android studio sharedpreference基本操作
- Android中ListView的分页--自定义ListView
- Android中的Sqlite数据库的简单使用
- android中String与InputStream之间的相互转换方式
- Android--Dialog详细讲解
- 关于libmsc.so文件加载到Android Studio中
- Android中图片的左右滑动(带小点点)
- Own your Android! Yet Another Universal Root CVE-2015-3636 (中文翻译) (3)