HDU 2586 LCA

有边权的LCA,好吧,其实就是裸的最近公共祖先,用离线算法就好了

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=4e4+10;

int T,n,m,fa[N],ans[N],dis[N];
bool vis[N];
struct Node{
    int to,idw;
    Node(int to,int idw):to(to),idw(idw){}
};
vector<Node>e[N];
vector<Node>q[N];
int Find(int x) {
    return x==fa[x]?fa[x]:fa[x]=Find(fa[x]);
}
void LCA(int u) {
    for(int i=0;i<e[u].size();i++) {
        int v=e[u][i].to;
        if(vis[v]) continue;
        vis[v]=1;
        dis[v]=dis[u]+e[u][i].idw;
        LCA(v);
        fa[v]=u;

        for(int j=0;j<q[v].size();j++) {
            int c=q[v][j].to;
            if(vis[c]&&ans[q[v][j].idw]==-1) {
                if(c==v) ans[q[v][j].idw]=0; 
                else ans[q[v][j].idw]=dis[v]+dis[c]-2*dis[Find(c)];
            }
        }
    }
}
int main() {
    scanf("%d",&T);
    while(T--) {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++) {
            int u,v,w;
            e[i].clear();
            q[i].clear();
            fa[i]=i;
            vis[i]=0;

            if(i<n) {
                scanf("%d%d%d",&u,&v,&w);
                e[u].push_back(Node(v,w));
                e[v].push_back(Node(u,w));
            }
        }
        for(int i=1;i<=m;i++) {
            int u,v;
            ans[i]=-1;
            scanf("%d%d",&u,&v);
            q[u].push_back(Node(v,i));
            q[v].push_back(Node(u,i));
        }
        dis[1]=0;
        vis[1]=1;
        LCA(1);
        fo(i,1,m) {
            printf("%d\n",ans[i]);
        }
    }
}