限制LIMIT,删除不超过LIMIT的边是的叶子节点和根节点不相连接。
解题思路:
枚举LIMIT,在LIMIT限制下进行计数,枚举使用二分枚举,不过这题数据有bug, LIMIT大部分存在于做区间。可直接循环枚举;
AC代码:
#include <cstring>
#include <cstdio>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 2000;
const ll inf = 0x3f3f3f3f3f3f3f3f;
struct node {
ll v, w, next;
}edge[maxn * 2];
ll tot;
ll head[maxn];
void addedge(int u, int v, int w) {
edge[tot].v = v;
edge[tot].w = w;
edge[tot].next = head[u];
head[u] = tot ++;
}
ll num[1100];
ll dp[1100];
int flag;
void DFS(int u, int fa, int limit) {
int flag = 0;
dp[u] = 0;
for (int i = head[u]; i != -1; i = edge[i].next) {
int v = edge[i].v;
if(v == fa) continue;
DFS(v, u, limit);
int w = edge[i].w;
flag = 1;
if(w <= limit) {
dp[u] += min((ll)w, dp[v]);
}
else {
dp[u] += dp[v];
}
}
if(!flag) {dp[u] = 1000000;}
}
int main() {
int n, m;
while(~scanf("%d%d", &n, &m) && (m||n) ) {
int max_ = -1;
memset(head, -1, sizeof(head));
tot = 0;
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n - 1; i++) {
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
addedge(u, v, w);
addedge(v, u, w);
max_ = max(max_, w);
}
int flag = 0;
for(int i = 1; i <= max_; i++) {
DFS(1, 1, i);
if(dp[1] <= m) {
printf("%d\n", i);
flag = 1;
break;
}
}
if(!flag) printf("-1\n");
}
}