CC On The Tree
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 194 Accepted Submission(s): 70
Problem Description
CC lives on the tree which has N nodes.On every leaf of the tree there is an apple(leaf means there is only one branch connect this node ) .Now CC wants to get two apple ,CC can choose any node to start and the speed of CC is one meter per second.
now she wants to know the shortest time to get two apples;
now she wants to know the shortest time to get two apples;
Input
Thers are many cases;
The first line of every case there is a number N(2<=N<=10000)
if n is 0 means the end of input.
Next there is n-1 lines,on the i+1 line there is three number ai,bi,ci
which means there is a branch connect node ai and node bi.
(1<=ai, bi<=N , 1<=ci<=2000)
ci means the len of the branch is ci meters ;
The first line of every case there is a number N(2<=N<=10000)
if n is 0 means the end of input.
Next there is n-1 lines,on the i+1 line there is three number ai,bi,ci
which means there is a branch connect node ai and node bi.
(1<=ai, bi<=N , 1<=ci<=2000)
ci means the len of the branch is ci meters ;
Output
print the mininum time to get only two apple;
Sample Input
7 1 2 1 2 3 2 3 4 1 4 5 1 3 6 3 6 7 4 0
Sample Output
5
Source
好吧,这题咩,求叶子节点之间距离最短的距离。比赛的时候被无语用bfs瞬秒了,后来看了一下,也能用树形dp做,其实思路很简单,就是dfs一遍,每个节点保存两个值,一个是叶子节点到该点距离最近的点的距离,一个是叶子节点到该点距离第二近的距离,所以扫一遍就可以了。
代码
#include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
#define INF 99999999
typedef struct
{
int v;
int len;
}node;
int p[10005];
int pt[10005];
vector <node> edge[10005];
void dfs(int t,int q)
{
if (edge[t].size()==1)
{
p[t]=0;
return;
}
for (int i=0;i<edge[t].size();i++)
{
if (edge[t][i].v==q) continue;
dfs(edge[t][i].v,t);
if (p[edge[t][i].v]+edge[t][i].len<p[t])
{
pt[t]=p[t];
p[t]=p[edge[t][i].v]+edge[t][i].len;
}
else if (pt[t]>p[edge[t][i].v]+edge[t][i].len)
{
pt[t]=p[edge[t][i].v]+edge[t][i].len;
}
}
}
int main()
{
int i,j,x,y,c,n,m;
node tag;
while(1)
{
scanf("%d",&n);
if (n==0) break;
for (i=0;i<=n;i++)
{
edge[i].clear();
p[i]=INF;
pt[i]=INF;
}
for (i=0;i<n-1;i++)
{
scanf("%d%d%d",&x,&y,&c);
x--;
y--;
tag.v=y;
tag.len=c;
edge[x].push_back(tag);
tag.v=x;
edge[y].push_back(tag);
}
if (n==2)
{
printf("%d\n",c);
continue;
}
for (i=0;i<n;i++)
{
if (edge[i].size()>1) break;
}
dfs(i,-1);
m=INF;
for (i=0;i<n;i++)
{
m=min(p[i]+pt[i],m);
// printf("%d...%d...%d\n",i,p[i],pt[i]);
}
printf("%d\n",m);
}
return 0;
}