杭电（oj）ACM 2586 简单LCA

How far away ？

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

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
  
  
  
  


  
  
  
  

   
   http://acm.hdu.edu.cn/typeclass.php中的LCA例题 其实就是个简单深搜

  
  
  
  


  
  
  
  

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


struct adress
{

   
   	int pos;

   
   	int val;
}S; 


int T;
int n,m,a,b,d;
int book[40005];
int f;


vector<struct adress> vv[40005];


void dfs(int B,int ans)
{

   
   	int len;                     //注意len不能设成全局变量 用全局变量要谨慎 

   
   	if(book[B] || f) return;

   
   	if(B==b) {f=1;cout<<ans<<endl; return;}  //及时return 

   
   	

   
   	len=vv[B].size();

   
   	for(int i=0;i<len;i++)

   
   	{

   
   		book[B]=1;

   
   		dfs(vv[B][i].pos,ans+vv[B][i].val);

   
   		

   
   	}

   
   	book[B]=0;  //注意 该点不走了 要归0 

   
   	return;
}


int main()
{

   
   	while(cin>>T)

   
   	{

   
   		while(T--)

   
   		{

   
   			for(int i=0;i<=40000;i++)  //vector清空 

   
   			vv[i].clear();

   
   			

   
   			

   
   			cin>>n>>m;

   
   			

   
   			for(int i=0;i<n-1;i++)

   
   			{

   
   				scanf("%d%d%d",&a,&b,&d);

   
   				S.pos=b;S.val=d;

   
   				vv[a].push_back(S);

   
   				

   
   				S.pos=a;S.val=d;

   
   				vv[b].push_back(S);

   
   			}

   
   			

   
   			for(int i=0;i<m;i++)

   
   			{

   
   				memset(book,0,sizeof(book));

   
   				f=0;

   
   				scanf("%d%d",&a,&b);

   
   				dfs(a,0);

   
   			}

   
   			

   
   			//cout<<endl;

   
   		}

   
   	}
}