POJ 3321 Apple Tree (树状数组)
来源:互联网 发布:config.php 编辑:程序博客网 时间:2024/05/17 07:43
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
Sample Input
31 21 33Q 1C 2Q 1
Sample Output
32
Source
#include<cstdio>#include <cmath>#include <vector>#include <complex>#include<cstdlib>#include<string.h>#include <iostream>#include <algorithm>#defineMAX 100100int arr[MAX], hash[MAX], top, bro[MAX];bool oc[MAX];struct node{int nxt, t;}edge[MAX];int head[MAX], inde;void fresh(){inde = 0;top = 1;memset(head, -1, sizeof(head));}void addedge(int s, int t){edge[inde].t = t;edge[inde].nxt = head[s];head[s] = inde++;}void dfs(int n, int jp){int i = head[n], lst = jp;while(i >= 0){dfs(edge[i].t, lst);lst = edge[i].t;i = edge[i].nxt;}bro[n] = jp;hash[n] = top++;}inline int lowbit(int n){return n & (-n);}void update(int x, int n){while(x < MAX){arr[x] += n;x += lowbit(x);}}int get(int x){int res = 0;while(x > 0){res += arr[x];x -= lowbit(x);}return res;}int main(){int num, i, s, t, tmp;char ord;scanf("%d", &num);memset(oc, 0, sizeof(oc));fresh();for(i = 1; i < num; i++){scanf("%d%d", &s, &t);addedge(s, t);oc[t] = 1;}for(i = 1; oc[i]; i++);dfs(i, 0);for(i = 1; i <= num; i++){update(hash[i], 1);}scanf("%d", &num);memset(oc, 1, sizeof(oc));for(i = 0; i < num; i++){getchar();scanf("%c", &ord);if(ord == 'Q'){scanf("%d", &tmp);printf("%d\n", get(hash[tmp]) - get(hash[bro[tmp]]));}else{scanf("%d", &tmp);if(oc[tmp]) t = -1;else t = 1;update(hash[tmp], t);oc[tmp] = !oc[tmp];}}return 0;}
- poj 3321 Apple Tree( 树状数组 )
- POJ 3321 apple tree 树状数组
- POJ 3321 Apple Tree(DFS+树状数组)
- POJ 3321 Apple Tree 树状数组
- poj 3321 apple tree 树状数组 水
- POJ 3321 Apple Tree(DFS+树状数组)
- POJ 3321 Apple Tree 树状数组
- POJ 3321 Apple Tree (树状数组)
- POJ 3321 Apple Tree (dfs + 树状数组)
- POJ 3321 Apple Tree (DFS + 树状数组)
- Poj 3321 Apple Tree - 树状数组
- [poj 3321]Apple Tree[树状数组]
- POJ 3321 Apple Tree DFS + 树状数组
- POJ 3321 Apple Tree(树状数组)
- POJ 3321 Apple Tree(dfs+树状数组)
- poj 3321 Apple Tree 树状数组
- poj-3321 Apple Tree(树状数组)
- POJ 3321 Apple Tree【树状数组】
- Spring Boot 入门
- Linux 线程浅析
- U
- 斯坦福大学机器学习课程笔记一但变量线性回归模型
- 关于循环语句的运用
- POJ 3321 Apple Tree (树状数组)
- 数组的运用
- 170721 misc-cctf(2)
- maven安装教程
- 导入Thymeleaf、正确设置URL的输入、相应请求、参数传递
- 数据结构及算法知识(二)
- μC/OS-II软件定时器的分析与测试
- 暑期集训之一般素数的判断
- 字符串的输入与输出