POJ 3321 Apple Tree （ DFS+BIT

Apple Tree

题目描述

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?

输入

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

输出

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

题意

模板题 被超时卡的不要不要的 好难受

AC代码

#include <vector>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

#define LL long long
const int MAXN= 1e5+10;
int n, m , dep, c[MAXN];
int L[MAXN], R[MAXN], arr[MAXN];
bool vis[MAXN];
//struct node {
//    int v, c;
//    node(int _v=0,int _c=0):v(_v),c(_c){}
//};
typedef vector<int> vv;
vector<vv> G(MAXN);
void dfs(int u) {
    vis[u] = true;
    L[u] = ++dep;
    for(int i = 0; i < G[u].size(); i++) {
        int v = G[u][i];
        if(!vis[v])
            dfs(v);
    }
    R[u] = dep;
}
int lowbit(int x) {
    return x&(-x);
}
int query(int x) {
    int res = 0;
    while(x) {
        res += c[x];
        x -= lowbit(x);
    }
    return res;
}
void add(int x, int d) {
    while(x <= n) {
        c[x] += d;
        x += lowbit(x);
    }
}


int main() {
    scanf("%d",&n);
    for(int i = 1; i < n; i++) {
        int u, v;
        scanf("%d%d",&u,&v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(1);
    for(int i = 1; i <= n; i++) {
        arr[i] = 1;
        add(i,1);
    }
    int q;
    scanf("%d",&q);
    while(q--) {
        char ch[10];
        int x;
        scanf("%s%d",ch,&x);
        if(ch[0] == 'Q') {
            printf("%d\n",query(R[x])-query(L[x]-1));
        }
        else {
            if(arr[x]) {
                add(L[x],-1);
            }
            else
                add(L[x],1);
            arr[x] = !arr[x];
        }
    }
return 0;
}