1468: Tree
Time Limit:10 Sec Memory Limit:64 MBSubmit: 1441 Solved: 771
[Submit][Status][Discuss]
Description
给你一棵TREE,以及这棵树上边的距离.问有多少对点它们两者间的距离小于等于K
Input
N(n<=40000)接下来n-1行边描述管道,按照题目中写的输入接下来是k
Output
一行,有多少对点之间的距离小于等于k
Sample Input
7
1 6 13
6 3 9
3 5 7
4 1 3
2 4 20
4 7 2
10
1 6 13
6 3 9
3 5 7
4 1 3
2 4 20
4 7 2
10
Sample Output
5
HINT
Source
#include<cmath>
#include<ctime>
#include<cstdio>
#include<climits>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<queue>
#include<map>
#include<set>
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'|ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
return f*x;
}
const int N=40010;const int inf=0X7f7f7f7f;
int n,k,ecnt,root,sum,ans,last[N],f[N],son[N],dis[N],t[N];
bool vis[N];
struct EDGE{int to,nt,val;}e[N<<1];
inline void add(int u,int v,int val)
{e[++ecnt]=(EDGE){v,last[u],val};last[u]=ecnt;}
inline void getroot(int u,int fa)
{
son[u]=1;f[u]=0;
for(int i=last[u];i;i=e[i].nt)
if(e[i].to!=fa&&!vis[e[i].to])
{
getroot(e[i].to,u);
son[u]+=son[e[i].to];
f[u]=max(f[u],son[e[i].to]);
}
f[u]=max(f[u],sum-son[u]);
if(f[root]>f[u])root=u;
}
inline void seek(int u,int fa)
{
t[++t[0]]=dis[u];
for(int i=last[u];i;i=e[i].nt)
if(e[i].to!=fa&&!vis[e[i].to])
{dis[e[i].to]=dis[u]+e[i].val;seek(e[i].to,u);}
}
inline int cal(int u,int val)
{
dis[u]=val;t[0]=0;int tmp=0;
seek(u,0);sort(t+1,t+1+t[0]);
int l=1,r=t[0];
while(l<r)
{
if(t[r]+t[l]<=k)tmp+=(r-l),l++;
else r--;
}
return tmp;
}
inline void solve(int u)
{
ans+=cal(u,0);vis[u]=1;
for(int i=last[u];i;i=e[i].nt)
if(!vis[e[i].to])
{
sum=son[e[i].to];root=0;getroot(e[i].to,0);
ans-=cal(e[i].to,e[i].val);solve(e[i].to);
}
}
int main()
{
n=read();int u,v,val;f[0]=inf;sum=n;
for(int i=1;i<n;i++){u=read();v=read();val=read();add(u,v,val);add(v,u,val);}
k=read();getroot(1,0);solve(root);
printf("%d\n",ans);
}