一本通1557：祖孙询问

最新推荐文章于 2024-07-14 19:56:17 发布

我是小蒟蒻

最新推荐文章于 2024-07-14 19:56:17 发布

阅读量101

点赞数 3

文章标签：算法 c++

本文链接：https://blog.csdn.net/liu12345635/article/details/136922607

版权

#include <bits/stdc++.h>
const int NN = 4e4 + 4;
using namespace std;
vector<int> G[NN];
int N, TI[NN], TO[NN], timer = 0;
void dfs(int u, int fa = -1) {
    TI[u] = ++timer;

    for (int v : G[u])
        if (v != fa)
            dfs(v, u);

    TO[u] = ++timer;
}
bool isAncestor(int u, int v) {
    return TI[u] < TI[v] && TO[v] < TO[u];
}
int solve(int u, int v) {
    if (isAncestor(u, v))
        return 1;

    if (isAncestor(v, u))
        return 2;

    return 0;
}
int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int N, M, root;
    cin >> N;

    for (int i = 1, u, v; i <= N; i++) {
        cin >> u >> v;

        if (v == -1)
            root = u;
        else
            G[u].push_back(v), G[v].push_back(u);
    }

    dfs(root);
    cin >> M;

    for (int i = 1, u, v; i <= M; i++)
        cin >> u >> v, printf("%d\n", solve(u, v));

    return 0;
}