POJ - 3321 Apple Tree (线段树 + 建树 + 思维转换)
来源:互联网 发布:ipad淘宝怎么收藏店铺 编辑:程序博客网 时间:2024/05/17 07:03
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
/*Author: 2486Memory: 10004 KBTime: 766 MSLanguage: G++Result: Accepted*/#include <cstdio>#include <algorithm>#include <cstring>#include <vector>#include <queue>using namespace std;#define lson rt << 1, l, mid#define rson rt << 1|1, mid + 1, r#define root 1, 1, Nconst int MAXN = 2e5 + 5;int sum[MAXN << 2], LU[MAXN], RU[MAXN], N, M, A, B, tot, K;char op[10];/***********加边模板***************/int Head[MAXN], Next[MAXN], rear;struct edge { int u,v;} es[MAXN];void Edge_Init() { rear = 0; memset(Head, -1, sizeof(Head));}void Edge_Add(int u,int v) { es[rear].u = u; es[rear].v = v; Next[rear] = Head[u]; Head[u] = rear ++;}void DFS(int to, int from) { LU[to] = ++ tot;//用来标记属于它的子树的序列 for(int i = Head[to] ; ~ i; i = Next[i]) { int v = es[i].v; if(v == from) continue; DFS(v, to); } RU[to] = tot;}/**********************************/void pushup(int rt) { sum[rt] = sum[rt << 1] + sum[rt << 1|1];}void build(int rt, int l, int r) { if(l == r) { sum[rt] = 1; return ; } int mid = (l + r) >> 1; build(lson); build(rson); pushup(rt);}void update(int p,int rt,int l, int r) { if(l == r) { sum[rt] ^= 1; return; } int mid = (l + r) >> 1; if(p <= mid) update(p, lson); else update(p, rson); pushup(rt);}int query(int L, int R,int rt, int l, int r) { if(L <= l && r <= R) { return sum[rt]; } int mid = (l + r) >> 1; int res = 0; if(L <= mid) res += query(L, R, lson); if(R > mid) res += query(L, R, rson); return res;}int main() { //freopen("D://imput.txt","r",stdin); while(~ scanf("%d", &N)) { tot = 0; build(root); Edge_Init(); for(int i = 1; i < N ; i ++) { scanf("%d%d", &A, &B); Edge_Add(A, B); Edge_Add(B, A); } DFS(1, -1); scanf("%d", &M); while(M --) { scanf("%s %d", op, &K); if(op[0] == 'C') { update(LU[K],root); } else { printf("%d\n", query(LU[K],RU[K],root)); } } } return 0;}
- POJ - 3321 Apple Tree (线段树 + 建树 + 思维转换)
- 线段树 POJ 3321 Apple Tree
- 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 线段树
- poj 3321 Apple Tree(树状数组)(区间建树)
- poj 3321 Apple Tree 线段树
- [poj 3321]Apple Tree[模拟DFS][时间戳][线段树]
- poj - 3321 - Apple Tree(dfs+线段树)
- POJ 3321 Apple Tree (dfs+线段树)
- POJ 题目3321 Apple Tree(线段树)
- poj 3321 Apple Tree(dfs序+线段树)
- POJ 3321 Apple Tree(dfs序+线段树)
- POJ 3321 Apple Tree dfs序+线段树
- poj 3321 Apple Tree(dfs序+线段树)
- 四元数
- LeetCode之Binary Tree Zigzag Level Order Traversal
- Rotate Image
- hdu1272并查集的实现
- 11. Xcode连接git@osc
- POJ - 3321 Apple Tree (线段树 + 建树 + 思维转换)
- 量子电池充电更快量子系统的热力学优势创新促发展 深耕电池行业
- LintCode-k数和
- [ios] UI Delegate
- 黑马程序员——反射2:应用
- 错误解决error while loading shared libraries: libXXX.so.X: cannot open shared object file: No such file
- Android Studio 入门整理
- 线性表的存储
- Intent简要介绍