AC通道:http://www.lydsy.com/JudgeOnline/problem.php?id=2599
【题解】
直接调用黄学长的题解:
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
using namespace std;
#define FILE "read"
#define MAXN 200010
#define INF 1000000000
#define up(i,j,n) for(int i=j;i<=n;++i)
#define dn(i,j,n) for(int i=j;i>=n;--i)
#define cmax(a,b) a=max(a,b)
#define cmin(a,b) a=min(a,b)
namespace INIT{
char buf[1<<15],*fs,*ft;
inline char getc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
inline int read(){
int x=0,f=1; char ch=getc();
while(!isdigit(ch)) {if(ch=='-') f=-1; ch=getc();}
while(isdigit(ch)) {x=x*10+ch-'0'; ch=getc();}
return x*f;
}
}using namespace INIT;
struct node{int y,next,v;}e[MAXN*2];
int n,m,len,root,sum,ans(INF),Link[MAXN],vis[MAXN],dis[MAXN],deep[MAXN],f[MAXN],size[MAXN],t[1000010];
void insert(int x,int y,int v){e[++len].next=Link[x];Link[x]=len;e[len].y=y;e[len].v=v;}
void getroot(int x,int fa){
size[x]=1; f[x]=0;
for(int i=Link[x];i;i=e[i].next){
if(vis[e[i].y]||e[i].y==fa) continue;
getroot(e[i].y,x); size[x]+=size[e[i].y];
cmax(f[x],size[e[i].y]);
}
cmax(f[x],sum-size[x]);
if(f[x]<f[root]) root=x;
}
void cal(int x,int fa){
if(dis[x]<=m) cmin(ans,deep[x]+t[m-dis[x]]);
for(int i=Link[x];i;i=e[i].next){
if(vis[e[i].y]||e[i].y==fa) continue;
deep[e[i].y]=deep[x]+1; dis[e[i].y]=dis[x]+e[i].v;
cal(e[i].y,x);
}
}
void add(int x,int fa,int flag){
if(dis[x]<=m) t[dis[x]]=(flag?min(t[dis[x]],deep[x]):INF);
for(int i=Link[x];i;i=e[i].next)
if(e[i].y!=fa&&!vis[e[i].y]) add(e[i].y,x,flag);
}
void solve(int x){
vis[x]=1; t[0]=0;
for(int i=Link[x];i;i=e[i].next){
if(vis[e[i].y]) continue;
deep[e[i].y]=1; dis[e[i].y]=e[i].v;
cal(e[i].y,0); add(e[i].y,0,1);
}
for(int i=Link[x];i;i=e[i].next)if(!vis[e[i].y])add(e[i].y,0,0);
for(int i=Link[x];i;i=e[i].next){
if(vis[e[i].y]) continue;
sum=size[e[i].y]; root=0;
getroot(e[i].y,0); solve(root);
}
}
int main(){
freopen(FILE".in","r",stdin);
freopen(FILE".out","w",stdout);
n=sum=read(); m=read(); f[0]=INF;
up(i,1,m) t[i]=INF;
up(i,1,n-1) {int x=read()+1,y=read()+1,v=read();insert(x,y,v);insert(y,x,v);}
getroot(1,0); solve(root);
if(ans==INF) printf("-1\n");
else printf("%d\n",ans);
return 0;
}