【Vijos】lxhgww的奇思妙想（长链剖分求k次祖先）

Description

给定一棵树，每次询问一个点的$k$次祖先。

---

Solution

$k$次祖先可以用长链剖分做到$O(n\log n)$预处理$O(1)$查询。

我们预处理出每个点向上$2^k$次祖先$fa[k][u]$，每一条重链的链顶向上、向下重链长度个点。（储存在std::vector中，由于重链长度和不超过$n$，所以空间、时间都是$O(n)$的）
对于询问求$u$的$k$次祖先，我们可以拆成$r+(k-r)$次祖先，其中$r$是$k$的最高二进制位，$r$次祖先$u'$可以用$fa[k][u]$得到。由于长链剖分有个性质：$k$次祖先所在重链长度不小于$k$。所以我们可以在$top[u']$处的vector中查询。

---

Code

/************************************************
 * Au: Hany01
 * Date: Aug 16th, 2018
 * Prob: Vijos lxhgww的奇思妙想
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 3e5 + 5;

int n, beg[maxn], v[maxn << 1], nex[maxn << 1], e = 1, dep[maxn], son[maxn], fa[19][maxn], top[maxn], hb[maxn], mxdep[maxn];
vector<int> up[maxn], down[maxn];

inline void add(int uu, int vv) { v[++ e] = vv, nex[e] = beg[uu], beg[uu] = e; }

void DFS1(int u, int pa) {
    fa[0][u] = pa, dep[u] = mxdep[u] = dep[pa] + 1, son[u] = u;
    For(i, 1, 18) fa[i][u] = fa[i - 1][fa[i - 1][u]];
    for (register int i = beg[u]; i; i = nex[i]) if (v[i] != pa) {
        DFS1(v[i], u);
        if (chkmax(mxdep[u], mxdep[v[i]])) son[u] = v[i];
    }
}

void DFS2(int u) {
    if (son[u] != u) top[son[u]] = top[u], DFS2(son[u]);
    for (register int i = beg[u]; i; i = nex[i])
        if (v[i] != fa[0][u] && v[i] != son[u]) top[v[i]] = v[i], DFS2(v[i]);
}

inline int query(int u, int k) {
    if (!k) return u;
    if (k >= dep[u]) return 0;
    u = fa[hb[k]][u], k ^= (1 << hb[k]);
    if (dep[u] - dep[top[u]] >= k) return down[top[u]][dep[u] - dep[top[u]] - k];
    return up[top[u]][k - (dep[u] - dep[top[u]])];
}

int main()
{
#ifdef hany01
    freopen("a.in", "r", stdin);
    freopen("a.out", "w", stdout);
#endif

    static int uu, vv, m, ans;

    n = read();
    For(i, 2, n) uu = read(), vv = read(), add(uu, vv), add(vv, uu);
    DFS1(1, 0), top[1] = 1, DFS2(1);

    For(i, 1, n) if (top[i] == i) {
        register int u = i;
        For(j, 0, mxdep[i] - dep[i]) up[i].pb(u), u = fa[0][u];
        u = i;
        For(j, 0, mxdep[i] - dep[i]) down[i].pb(u), u = son[u];
    }
    hb[1] = 0;
    For(i, 2, n) hb[i] = hb[i - 1] + (i >> (hb[i - 1] + 1) & 1);

    for (m = read(); m --; )
        uu = read() ^ ans, vv = read() ^ ans, printf("%d\n", ans = query(uu, vv));

    return 0;
}