POJ - 1470 Closest Common Ancestors(LCA离线)

题目大意：给出一棵N个结点的树，M个询问，询问的内容是两个结点的最近公共祖先
现在问每个结点作为询问的最近公共祖先结点出现了多少次

解题思路：就是LCA离线的裸题了

#include <cstdio>
#include <cstring>

const int MAXNODE = 10010;
const int MAXEDGE = 1000010;

struct Edge {
    int u, v, next;
    Edge() {}
    Edge(int u, int v, int next): u(u), v(v), next(next) {}
}E[MAXEDGE];

struct Question{
    int u, v, next;
    bool ok;
    Question() {}
    Question(int u, int v, int next): u(u), v(v), next(next), ok(false) {}
}Ques[MAXEDGE];

bool vis[MAXNODE];
int headEdge[MAXNODE], headQues[MAXNODE], cnt[MAXNODE], f[MAXNODE];
int n, totEdge, totQues;

void AddEdge(int u, int v) {
    E[totEdge] = Edge(u, v, headEdge[u]);
    headEdge[u] = totEdge++;
}

void AddQues(int u, int v) {
    Ques[totQues] = Question(u, v, headQues[u]);
    headQues[u] = totQues++;
}

void init() {
    memset(vis, 0, sizeof(vis));
    memset(cnt, 0, sizeof(cnt));
    memset(headEdge, -1, sizeof(headEdge));
    memset(headQues, -1, sizeof(headQues));
    totEdge = totQues = 0;

    char c1[2], c2[2], c3[2];
    int u, t, v;
    for (int i = 0; i < n; i++) {
        scanf("%d:(%d)", &u, &t);
        for (int j = 0; j < t; j++) {
            scanf("%d", &v);
            AddEdge(u, v);
            vis[v] = true;
        }
    }

    int q;
    scanf("%d", &q);
    for (int i = 0; i < q; i++) {
        scanf(" (%d %d)", &u, &v);
        AddQues(u, v);
        AddQues(v ,u);
    }
}

int find(int x) {
    return x == f[x] ? x : f[x] = find(f[x]);
}

void dfs(int u) {
    f[u] = u;
    vis[u] = true;
    for (int i = headEdge[u]; ~i; i = E[i].next) {
        int v = E[i].v;
        if (!vis[v]) {
            dfs(v);
            f[v] = u;
        }
    }

    for (int i = headQues[u]; ~i; i = Ques[i].next) {
        if (Ques[i].ok) continue;
        int v = Ques[i].v;
        if (vis[v]) {
            cnt[find(v)]++;
            Ques[i].ok = Ques[i ^ 1].ok = true;
        }
    }
}

void solve() {
    for (int i = 1; i <= n; i++) {
        if (!vis[i]) {
            memset(vis, 0, sizeof(vis));
            dfs(i);
            break;
        }
    }
    for (int i = 1; i <= n; i++)
        if (cnt[i]) printf("%d:%d\n", i, cnt[i]);
}

int main() {
    while (~scanf("%d" ,&n)) {
        init();
        solve();
    }
    return 0;
}