双重祖先【树链剖分】

题目链接 51nod 2553 双重祖先

---

给定两棵有根树，两棵树均有​𝑛n个节点，且根均为​11号点。

问有多少对​(𝑢,𝑣)(u,v)满足：在给定的两棵树中𝑢u均为𝑣v的祖先。

数据范围：

1≤𝑛≤105,1≤𝑢,𝑣≤𝑛

---

  首先，我们可以考虑第一棵树，向下dfs的过程中，我们可以提前的将结点给予“+1”，这样，对第二棵树的时候，我们遍历到结点的时候，实际上就是前面有多少个结点被“+1”了，所以，对第二棵树进行树链剖分，第一棵树dfs检索。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f3f3f3f3f
#define eps 1e-8
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e5 + 7;
int N;
struct Graph
{
    int head[maxN], cnt;
    struct Eddge
    {
        int nex, to;
        Eddge(int a=-1, int b=0):nex(a), to(b) {}
    }edge[maxN << 1];
    inline void addEddge(int u, int v)
    {
        edge[cnt] = Eddge(head[u], v);
        head[u] = cnt++;
    }
    inline void _add(int u, int v) { addEddge(u, v); addEddge(v, u); }
    inline void clear() { cnt = 0; for(int i=1; i<=N; i++) head[i] = -1; }
} Old, Now;
int siz[maxN], Wson[maxN] = {0}, deep[maxN] = {0}, fa[maxN];
void dfs_1(int u, int father)
{
    siz[u] = 1; Wson[u] = 0; deep[u] = deep[father] + 1; fa[u] = father;
    for(int i=Now.head[u], v; ~i; i=Now.edge[i].nex)
    {
        v = Now.edge[i].to;
        if(v == father) continue;
        dfs_1(v, u);
        siz[u] += siz[v];
        if(siz[v] > siz[Wson[u]]) Wson[u] = v;
    }
}
int id[maxN], tot, top[maxN];
void dfs_2(int u, int topy)
{
    id[u] = ++tot; top[u] = topy;
    if(Wson[u])
    {
        dfs_2(Wson[u], topy);
    }
    for(int i=Now.head[u], v; ~i; i=Now.edge[i].nex)
    {
        v = Now.edge[i].to;
        if(v == fa[u] || v == Wson[u]) continue;
        dfs_2(v, v);
    }
}
ll tree[maxN << 2] = {0};
void update(int rt, int l, int r, int qx, int val)
{
    tree[rt] += val;
    if(l == r) return;
    int mid = HalF;
    if(qx <= mid) update(Lson, qx, val);
    else update(Rson, qx, val);
}
ll query(int rt, int l, int r, int ql, int qr)
{
    if(ql <= l && qr >= r) return tree[rt];
    int mid = HalF;
    if(qr <= mid) return query(QL);
    else if(ql > mid) return query(QR);
    else return query(QL) + query(QR);
}
ll ans;
inline void Range_check(int u)
{
    while(top[u] ^ 1)
    {
        ans += query(1, 1, N, id[top[u]], id[u]);
        u = fa[top[u]];
    }
    ans += query(1, 1, N, id[1], id[u]);
}
void dfs_solve(int u, int fa)
{
    Range_check(u);
    update(1, 1, N, id[u], 1);
    for(int i=Old.head[u], v; ~i; i=Old.edge[i].nex)
    {
        v = Old.edge[i].to;
        if(v == fa) continue;
        dfs_solve(v, u);
    }
    update(1, 1, N, id[u], -1);
}
inline void init()
{
    tot = 0; ans = 0;
    Old.clear(); Now.clear();
}
int main()
{
    scanf("%d", &N);
    init();
    for(int i=1, u, v; i<N; i++)
    {
        scanf("%d%d", &u, &v);
        Old._add(u, v);
    }
    for(int i=1, u, v; i<N; i++)
    {
        scanf("%d%d", &u, &v);
        Now._add(u, v);
    }
    dfs_1(1, 0);
    dfs_2(1, 1);
    dfs_solve(1, 0);
    printf("%lld\n", ans);
    return 0;
}