Ural 1471. Tree

PRO IS HERE

离线最近公共祖先；

LCA；

d[u,v] = d[root,u]+d[root,v] - 2*d[root,ancestor(u,v)];

CODE:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<sstream>
#include<iostream>
using namespace std;

#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define DOR(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define bug puts("Fuck");
#define LL long long
#define pb push_back
#define mp make_pair

#define nMax 100010
#define eps 1e-8
#define inf 0x7fffffff
#define F first
#define S second

int d[nMax],fa[nMax],ancestor[nMax],ans[nMax],W[nMax],first[nMax],nxt[nMax],to[nMax],vis[nMax],e,n,m;
vector<pair<int,int> > que[nMax];
void addadge(int u,int v,int w){
	to[e]=v;W[e]=w;nxt[e]=first[u];first[u]=e;e++;
}
int find(int x) { return fa[x]=(x==fa[x]?fa[x]:find(fa[x])); }
void Union(int u,int v) {
	int x=find(u),y=find(v);
	if(x!=y) fa[y]=x;
	return ;
}
void LCA(int u,int fa){
	ancestor[find(u)]=u;
	for(int i=first[u],v;i!=-1;i=nxt[i]) if((v=to[i]) != fa){
		LCA(v,u);//cout<<"sdsafd"<<v<<endl;
//		fa[v]=u;
		Union(u,v);
		ancestor[find(u)]=u;
	}
	vis[u]=1;
	for(int i=0,v,w;i<que[u].size();i++) {
		v=que[u][i].F;
		w=que[u][i].S;
		if(vis[v]){
			int tmp=ancestor[find(v)];
			ans[w]=d[u]+d[v]-2*d[tmp];
		}
	}
}
void dfs(int u,int fa){
//	vis[u]=1;
	for(int i=first[u],v;i!=-1;i=nxt[i]) if((v=to[i]) != fa){
		d[v]=d[u]+W[i];
		dfs(v,u);
	}
}
int read(){
	if(scanf("%d",&n)==EOF) return 0;
	FOR(i,0,n-1) que[i].clear(),first[i]=-1,fa[i]=i,vis[i]=0,ans[i]=-1;
	e=0;
	int u,v,w;
	FOR(i,1,n-1) {
		scanf("%d%d%d",&u,&v,&w);
		addadge(u,v,w);addadge(v,u,w);
	}
	scanf("%d",&m);
	FOR(i,1,m) {
		scanf("%d%d",&u,&v);
		que[u].pb(mp(v,i));
		que[v].pb(mp(u,i));
	}
	dfs(0,0);
	FOR(i,0,n-1) vis[i]=0;
	LCA(0,0);
	FOR(i,1,m) printf("%d\n",ans[i]);
	return 1;
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("input.txt","r",stdin);
//	freopen("output.txt","w",stdout);
#endif
	while(read());

	return 0;
}