https://vjudge.net/problem/HDU-6769
题目大意:给你n个点,有n-1条边,每条边有a,b两个权值,给你一个k,恰好有k条边的权值取a,其余取b的时候,树的直径的最小值。
思路:答案具有单调性直接二分直径(在比赛的时候我压根想不到),然后用这个直径对树形dp做一个限制,如果链权值相加大于mid的时候则不转移状态。dp【i】【j】代表i的子树中选择了j条边取a权值的情况下,从i出发能达到最远就距离。(类似树上背包吧)
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <cstdlib>
#define INF 0x3f3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define FILL(a,b) (memset(a,b,sizeof(a)))
#define lson rt<<1
#define rson rt<<1|1
#define lowbit(a) ((a)&-(a))
#define ios std::ios::sync_with_stdio(false);std::cin.tie(0);std::cout.tie(0);
#define fi first
#define sc second
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define ac cout<<ans<<"\n"
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pii;
int dx[4]= {-1,1,0,0},dy[4]= {0,0,1,-1};
const ll mod=998244353;
const ll N =5e5+10;
const ll M =250000;
const double eps = 1e-4;
//const double pi=acos(-1);
ll re(){
ll x;
scanf("%lld",&x);
return x;
}
int n,k;
struct p{
int to,nex;
pii w;
}e[N];
int h[N];
ll dp[20010][21],temp[100];
int siz[20010];
int idx;
void add(int u,int v,ll a,ll b){
e[idx]={v,h[u],{a,b}};
h[u]=idx++;
}
void dfs(int u,int fa,ll mid){
siz[u]=dp[u][0]=0;
for(int i=h[u];~i;i=e[i].nex){
int v=e[i].to;
if(v==fa) continue;
dfs(v,u,mid);
int num=min(siz[u]+siz[v]+1,k);
for(int j=0;j<=num;j++) temp[j]=mid+1;
for(int j=0;j<=min(siz[u],num);j++){
for(int p=0;p<=min(siz[v],num)&&j+p<=num;p++){
if(p+j+1<=num&&dp[u][j]+dp[v][p]+e[i].w.fi<=mid)
temp[j+p+1]=min(temp[j+p+1],max(dp[u][j],dp[v][p]+e[i].w.fi));
if(dp[u][j]+dp[v][p]+e[i].w.sc<=mid)
temp[j+p]=min(temp[j+p],max(dp[u][j],dp[v][p]+e[i].w.sc));
}
}
siz[u]+=siz[v]+1;
for(int j=0;j<=num;j++) dp[u][j]=temp[j];
}
}
void slove(){
n=re(),k=re();
for(int i=1;i<=n;i++) h[i]=-1;
idx=0;ll l=0,r=0;
for(int i=1;i<n;i++){
ll u=re(),v=re(),a=re(),b=re();
add(u,v,a,b);
add(v,u,a,b);
r+=max(a,b);
}
ll ans=0;
while(l<=r){
ll mid=(l+r)/2;
dfs(1,0,mid);
if(dp[1][k]<=mid){
ans=mid;
r=mid-1;
}else l=mid+1;
}
cout<<ans<<endl;
}
int main(){
int t;
t=re();
while(t--) slove();
return 0;
}