CF519E - A and B and Lecture Rooms

题意： 给出一颗n个节点的树，有m次查询，每次查询求有多少个点到a、b的距离相等（1<=n,m<=10^5）

思路： 树链剖分，可以看出有答案就是这条链的节点个数为奇数(链的长度为偶数)

主要就是找到a和b的LCA，还有a到b路径上的中点（mid），及中点偏向a的节点(midA)和中点偏向b的节点(midB) 这3个节点，分3种情况即可

size[i] 表示子节点和本身的节点数 dep[i]表示离根结点的距离

1.dep[midA]=dep[midB](LCA == mid) 这样的话就是 n-size[midA]-size[midB]

2.dep[midA]>dep[midB]  那样答案就是 size[mid]-size[midA]

3.dep[midA]<dep[midB]  那样答案就是 size[mid]-size[midB]

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
#define LL int
const int maxn = 1e5+10;
struct ED
{
    int v,c,next;
} e[maxn * 2];
int T, n, z, EN, root, a, b, c, q;
int head[maxn], dep[maxn], w[maxn], fa[maxn], top[maxn], son[maxn], siz[maxn];
int p[maxn];
char ch[10];

void addedge(int u, int v)
{
    e[++EN].v = v;
    e[EN].next = head[u];
    head[u] = EN;
}

void dfs(int u)
{
    siz[u] = 1;son[u] = 0;
    for (int i = head[u]; i > 0; i = e[i].next)
        if (e[i].v != fa[u])
        {
            fa[e[i].v] = u;
            dep[e[i].v] = dep[u]+1;
            dfs(e[i].v);
            if (siz[e[i].v] > siz[son[u]]) son[u] = e[i].v;
            siz[u] += siz[e[i].v];
        }
}

void build_tree(int u, int tp)
{
    w[u] = ++ z; p[z] = u;
    top[u] = tp;
    if (son[u] != 0)
        build_tree(son[u], top[u]);
    for (int i = head[u]; i > 0; i = e[i].next)
        if (e[i].v != son[u] && e[i].v != fa[u])
            build_tree(e[i].v, e[i].v);
}

int LCA(int ua, int ub)
{
    int f1 = top[ua], f2 = top[ub];
    while (f1 != f2)
    {
        if (dep[f1] < dep[f2])
            swap(f1, f2),swap(ua, ub);
        ua = fa[f1];
        f1 = top[ua];
    }
    return dep[ua]<dep[ub]?ua:ub;
}

int Findkth(int u,int ub,int k)
{
    int lca = LCA(u, ub);
    int lon = dep[u]+dep[ub]-2*dep[lca];
    if(k<0 || k>lon) return 0;
    if(dep[u]-dep[lca]<k) k=lon-k,u=ub;
    while (u != lca && k > 0)
    {
        int t = top[u];
        if(w[u]-w[t]+1>k)
            return p[w[u]-k];
        k -= w[u]-w[t]+1;
        u = fa[t];
    }
    return u;
}

void init()
{
    scanf("%d",&n);
    root = 1;
    fa[root] = z = dep[root] = EN = 0;
    memset(siz, 0, sizeof(siz));
    memset(head, 0, sizeof(head));
    for (int i = 1; i < n; i++)
    {
        scanf("%d%d", &a, &b);
        addedge(a, b);
        addedge(b, a);
    }
    dfs(root);
    build_tree(root, root);
}

int main()
{
    init();
    scanf("%d",&q);
    while(q--)
    {
        scanf("%d%d",&a,&b);
        int lca = LCA(a,b);
        int lon = dep[a] + dep[b] - 2*dep[lca];
        if(lon%2==0)
        {
            int z = lon/2;
            int mid = Findkth(a,b,z);
            int midA = Findkth(a,b,z-1);
            int midB = Findkth(a,b,z+1);
            if(mid==lca)                printf("%d\n",n-siz[midA]-siz[midB]);
            else
            {
                if(dep[midA]>dep[midA]) printf("%d\n",siz[mid]-siz[midA]);
                else                    printf("%d\n",siz[mid]-siz[midB]);
            }
        }
        else  printf("0\n");
    }
    return 0;
}