tarjan求LCA

tarjan求LCA

题意：LCA模板题，输入n和m，表示n个点m条边，下面m行是边的信息，两端点和权，后面的那个字母无视掉，没用的。接着k，下面k个询问lca，输出即可

//poj 1986
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
using namespace std;

const size_t MAXN = 100005, MAXQ = 100005;

int N, Q, M;

struct Edge
{
    int u, v, nxt, weight;
}edge[MAXN << 1];

struct Ask
{
    int u, v, lca, nxt;
}ask[MAXQ << 1];

int cntEdge, cntAsk, headEdge[MAXN], headAsk[MAXN];
int fa[MAXN], dir[MAXN];
bool vis[MAXN];

void addEdge(int u, int v, int w)
{
    edge[cntEdge].u = u;
    edge[cntEdge].v = v;
    edge[cntEdge].weight = w;
    edge[cntEdge].nxt = headEdge[u];
    headEdge[u] = cntEdge ++;
}

void addAsk(int u, int v)
{
    ask[cntAsk].u = u;
    ask[cntAsk].v = v;
    ask[cntAsk].nxt = headAsk[u];
    headAsk[u] = cntAsk ++;
}

int getfa(int u)
{
    return u == fa[u] ? fa[u] : fa[u] = getfa(fa[u]);
}

void init()
{
    dir[1] = cntAsk = cntEdge = 0;
    memset(headAsk, -1, sizeof(headAsk));
    memset(headEdge, -1, sizeof(headEdge));
    memset(vis, 0, sizeof(vis));
    for (int i = 0;i < M;i ++)
    {
        int u, v, w;
        char s[10];
        scanf("%d%d%d%s", &u, &v, &w, s);
        addEdge(u, v, w);
        addEdge(v, u, w);
    }
    scanf("%d", &Q);
    for (int i = 0;i < Q;i ++)
    {
        int u, v;
        scanf("%d%d", &u, &v);
        addAsk(u, v);
        addAsk(v, u);
    }
}

void tarjan(int u)
{
    //printf("in search %d.\n", u);
    vis[u] = 1;
    fa[u] = u;
    for (int i = headEdge[u];i != -1;i = edge[i].nxt)
        if (! vis[edge[i].v])
    {
        dir[edge[i].v] = dir[u] + edge[i].weight;
        tarjan(edge[i].v);
        fa[edge[i].v] = u;
    }
    for (int i = headAsk[u];i != -1;i = ask[i].nxt)
        if (vis[ask[i].v])
            ask[i].lca = ask[i ^ 1].lca = getfa(ask[i].v);
    //printf("end search %d.\n", u);
}

int main()
{
    while (scanf("%d%d", &N, &M) != EOF)
    {
        init();
        tarjan(1);
        for (int i = 0;i < Q;i ++)
            printf("%d\n", dir[ask[i << 1].u] + dir[ask[i << 1].v] - (dir[ask[i << 1].lca] << 1));
    }
    return 0;
}