【lca】hdu2586 How far away ？

How far away ？

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 36072    Accepted Submission(s): 14721

 

Problem Description

There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this "How far is it if I want to go from house A to house B"? Usually it hard to answer. But luckily int this village the answer is always unique, since the roads are built in the way that there is a unique simple path("simple" means you can't visit a place twice) between every two houses. Yout task is to answer all these curious people.

 

 

Input

First line is a single integer T(T<=10), indicating the number of test cases.
  For each test case,in the first line there are two numbers n(2<=n<=40000) and m (1<=m<=200),the number of houses and the number of queries. The following n-1 lines each consisting three numbers i,j,k, separated bu a single space, meaning that there is a road connecting house i and house j,with length k(0<k<=40000).The houses are labeled from 1 to n.
  Next m lines each has distinct integers i and j, you areato answer the distance between house i and house j.

 

 

Output

For each test case,output m lines. Each line represents the answer of the query. Output a bland line after each test case.

 

 

Sample Input

2 3 2 1 2 10 3 1 15 1 2 2 3 2 2 1 2 100 1 2 2 1

 

 

Sample Output

10 25 100 100

 

 

Source

ECJTU 2009 Spring Contest

 

 

直接倍增lca板子

 

 

代码

#include<queue>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=4e4+5;
int n,m,cnt,head[maxn],dis[maxn],dep[maxn],fa[maxn][17];
struct edge
{
	int to,nxt,v;
}e[maxn<<1];
void add(int x,int y,int z)
{
	e[++cnt].to=y;
	e[cnt].nxt=head[x];
	e[cnt].v=z;
	head[x]=cnt;
}
void dfs(int u,int f)
{
	fa[u][0]=f; dep[u]=dep[f]+1;
	for(int i=head[u];i;i=e[i].nxt)
	{
		int to=e[i].to;
		int v=e[i].v;
		if(to==f) continue;
		dis[to]=dis[u]+v;
		dfs(to,u);
	}
}
int LCA(int x,int y)
{
	if(dep[x]<dep[y]) swap(x,y);
	for(int i=16;i>=0;i--)
		if(dep[fa[x][i]]>=dep[y])
			x=fa[x][i];
	if(x==y) return x;
	for(int i=16;i>=0;i--)
		if(fa[x][i]!=fa[y][i])
			x=fa[x][i],y=fa[y][i];
	return fa[x][0];
}
int main()
{
	freopen("a.in","r",stdin);
	freopen("a.out","w",stdout);
	int t; scanf("%d",&t);
	int x,y,z;
	while(t--)
	{
		scanf("%d%d",&n,&m);
		memset(head,0,sizeof(head));
		cnt=0;
		for(int i=1;i<n;i++) scanf("%d%d%d",&x,&y,&z),add(x,y,z),add(y,x,z);
		dep[1]=1; dis[1]=0;
		dfs(1,0);		
		for(int i=1;i<=16;i++)
			for(int j=1;j<=n;j++)
				fa[j][i]=fa[fa[j][i-1]][i-1];
		for(int i=1;i<=m;i++)
		{
			scanf("%d%d",&x,&y);
			int lca=LCA(x,y);
			printf("%d\n",dis[x]+dis[y]-2*dis[lca]);
		}
	}
	return 0;
}