How far away ?
来源:互联网 发布:windows版本怎么更换 编辑:程序博客网 时间:2024/06/03 18:08
How far away ?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19131 Accepted Submission(s): 7485
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.
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
23 21 2 103 1 151 22 32 21 2 1001 22 1
Sample Output
1025100100
给你一幅图有n个点,共有n-1条边,问你任意两条边的距离
思路:
递归深搜刚开始用栈超时
如果与st点连接的点没有搜过就先记录length,在递归调用dfs,
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int inf = 4e4+10;
struct node{
int v;
int length;
}th[inf];
vector<struct node>s[inf];
bool vis[inf];
int ans;
int n,m;
int st,ed;
bool dfs(int st)
{
vis[st]=true;
for(int i = 0;i < s[st].size(); i++){
if(vis[s[st][i].v]==false){
ans+=s[st][i].length;
if(s[st][i].v == ed){
printf("%d\n",ans);
return true;
}
if(dfs(s[st][i].v)==false){
ans-=s[st][i].length;
}
}
}
return false;
}
int main()
{
int num;
scanf("%d",&num);
int a = 10;
while(num--){
scanf("%d %d",&n,&m);
for(int i = 0; i < n-1 ;i++){
int u,v;
scanf("%d %d %d",&u,&v,&th[i].length);
th[i].v=v;
s[u].push_back(th[i]);
th[i].v=u;
s[v].push_back(th[i]);
}
for(int i = 0;i < m; i++){
scanf("%d %d",&st,&ed);
memset(vis,false,sizeof(vis));
ans=0;
dfs(st);
}
}
return 0;
}
阅读全文
0 0
- How far away ?
- 2586 How far away ?
- HDU2586 How far away ?
- HDU How far away ?
- How far away ?(DFS)
- HDU2586 How far away ?
- How far away ?
- A - How far away ?
- How far away ?
- hdu2586【How far away ?】
- How far away ?--LCA
- HDU2586 How far away ?
- How far away ? HDU
- hdu2586 How far away
- How far away?
- How far away ? HDU
- How far away ? HDU
- How far away ? HDU
- Linux下安装MySQL 5.7.11版本数据库
- Softmax 回归 vs. k 个二元分类器
- Android jni开发-0(用javah方式编译jni)
- js_note
- Python3与OpenCV3.3 图像处理(十三)--反射投影
- How far away ?
- 数据结构与算法之Collection和Map综述
- 将一个字符串转换成一个整数,要求不能使用字符串转换整数的库函数。 数值为0或者字符串不是一个合法的数值则返回0
- MySQL数据库——检索数据(一)
- jQuery事件
- JavaEE 中JSTL EL的应用
- 扩展版扫雷小游戏
- 12.4-12.8课堂作业-临摹米家有品
- 学习OpenCV2——绘制基本图形及文字