SPOJ：Ada and Orange Tree (LCA+Bitset)

Ada the Ladybug lives near an orange tree. Instead of reading books, she investigates the oranges. The oranges on orange tree can be in up to 5*50 Shades of Orange. She walks from orange to orange, examining different properties of orange tree. The oranges are connected by branches. There is more oranges then branches, yet it is still possible to get from any orange to any other orange [through branches]. The tree is rooted.

Ada has many questions in following form: She goes from orange A to orange B (by shortest path) and is interested in total number different Shades of Orange among all subtrees of all edges on shortest path.

Input

The first line of input consists of 1 ≤ T ≤ 100, the number of test-cases.

The first line of each test case contains three integers 1 ≤ N, Q ≤ 4.5*10⁵, 0 ≤ R < N, the number of oranges, the number of questions and number of root.

Next line contains N integers 1 ≤ S_i ≤ 250, the shade of orange of orange i.

Next N-1 lines contains two integers 0 ≤ I, J < N, I ≠ J , the numbers of oranges which are connected by branch.

Next Q lines contains two integers 0 ≤ A, B < N, the path Ada is interested about.

The sum of all N and all Q among all test-cases won't exceed 10⁶

Output

For each question answer the number of shades in all subtrees of all nodes on shortest path from A to B.

Example Input

1

10 7 1

1 2 1 4 5 6 6 8 9 9

0 9

9 3

3 4

4 6

4 5

4 8

1 3

1 2

2 7

4 4

8 6

0 6

7 0

7 2

0 0

2 3

Example Output

题意：给定一棵树，每个节点有一种颜色的橘子；Q次询问，每次询问，给出u、v，回答u到v的最短路径上的节点的子树一共有多少种颜色的橘子。

思路：其实就是问最小公共祖先LCA的子树的颜色种类。因为颜色只有250种，我们DFS时就用Bitset记录子树的颜色种类数。

#include<bitset>

#include<cstdio>

#include<cstdlib>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

const int maxn=;

int Laxt[maxn],Next[maxn<<],To[maxn<<];

int fa[maxn][],dep[maxn],N,Q,rt,cnt;

bitset<>S[maxn];

void init()

{

    for(int i=;i<=N;i++) S[i].reset();

    for(int i=;i<=N;i++) Laxt[i]=;

    memset(Laxt,,sizeof(Laxt));

    cnt=;

}

void add(int u,int v){

    Next[++cnt]=Laxt[u];

    Laxt[u]=cnt;

    To[cnt]=v;

}

void dfs(int u,int f){

    fa[u][]=f; dep[u]=dep[f]+;

    for(int i=Laxt[u];i;i=Next[i]){

        if(To[i]!=f){

          dfs(To[i],u);

          S[u]|=S[To[i]];

        }

    }

}

void RMQ()

{

    for(int i=;i<;i++)

     for(int j=;j<=N;j++)

      fa[j][i]=fa[fa[j][i-]][i-];

}

int LCA(int u,int v){

    if(dep[u]<dep[v]) swap(u,v);

    for(int i=;i>=;i--)

      if(dep[fa[u][i]]>=dep[v])

        u=fa[u][i];

    if(u==v) return u;

    for(int i=;i>=;i--)

      if(fa[u][i]!=fa[v][i])

        u=fa[u][i],v=fa[v][i];

    return fa[u][];

}

int main()

{

    int T,x,u,v,lca;

    scanf("%d",&T);

    while(T--){

        scanf("%d%d%d",&N,&Q,&rt);

        rt++; init();

        for(int i=;i<=N;i++){

            scanf("%d",&x);

            S[i][x]=;

        }

        for(int i=;i<N;i++){

            scanf("%d%d",&u,&v);

            u++; v++;

            add(u,v); add(v,u);

        }

        dfs(rt,); RMQ();

        while(Q--){

            scanf("%d%d",&u,&v);

            u++; v++;

            lca=LCA(u,v);

            printf("%d\n",S[lca].count());

        }

    }

    return ;

}