首页 > 代码库 > BNUOJ 7697 Information Disturbing

BNUOJ 7697 Information Disturbing

2024-07-16 23:02:23   220人阅读

Information Disturbing

Time Limit: 3000ms
Memory Limit: 65536KB
This problem will be judged on HDU. Original ID: 3586
64-bit integer IO format: %I64d      Java class name: Main
 
In the battlefield , an effective way to defeat enemies is to break their communication system.
The information department told you that there are n enemy soldiers and their network which have n-1 communication routes can cover all of their soldiers. Information can exchange between any two soldiers by the communication routes. The number 1 soldier is the total commander and other soldiers who have only one neighbour is the frontline soldier.
Your boss zzn ordered you to cut off some routes to make any frontline soldiers in the network cannot reflect the information they collect from the battlefield to the total commander( number 1 soldier).
There is a kind of device who can choose some routes to cut off . But the cost (w) of any route you choose to cut off can’t be more than the device’s upper limit power. And the sum of the cost can’t be more than the device’s life m.
Now please minimize the upper limit power of your device to finish your task.
 

Input

The input consists of several test cases. 
The first line of each test case contains 2 integers: n(n<=1000）m(m<=1000000).
Each of the following N-1 lines is of the form:
ai bi wi
It means there’s one route from ai to bi(undirected) and it takes wi cost to cut off the route with the device.
(1<=ai,bi<=n,1<=wi<=1000)
The input ends with n=m=0.
 

Output

Each case should output one integer, the minimal possible upper limit power of your device to finish your task. 
If there is no way to finish the task, output -1.
 

Sample Input

5 51 3 21 4 33 5 54 2 60 0

Sample Output

3

Source

2010 ACM-ICPC Multi-University Training Contest（15）——Host by NUDT
 
 
解题：要求什么寿命之和不能达到最大的寿命值，还要使得那个什么最小。。。最小。。。二分+树形dp。dp[u]表示u节点子树的最小代价。
 
dp[u] += min(dp[g[u][i].to],g[u][i].w);  表示要么不剪g[u][i]这条边，由其子树中的剪，要么剪g[u][i]这条边，子树不减，故取min就是。
 
 
 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cmath> 5 #include <algorithm> 6 #include <climits> 7 #include <vector> 8 #include <queue> 9 #include <cstdlib>10 #include <string>11 #include <set>12 #include <stack>13 #define LL long long14 #define INF 100001015 using namespace std;16 const int maxn = 1001;17 struct arc{18     int to,w;19     arc(int x = 0,int y = 0):to(x),w(y){}20 };21 vector<arc>g[maxn];22 int n,m,dp[maxn];23 void dfs(int u,int fa,int limit){24     for(int i = 0; i < g[u].size(); i++){25         if(g[u][i].to == fa) continue;26         dfs(g[u][i].to,u,limit);27         if(g[u][i].w <= limit)28             dp[u] += min(dp[g[u][i].to],g[u][i].w);29         else dp[u] += dp[g[u][i].to];30     }31     if(g[u].size() == 1 && g[u][0].to == fa) dp[u] = INF;32 }33 int main() {34     int i,j,u,v,w,lt,rt,mid,ans;35     while(scanf("%d %d",&n,&m),n||m){36         for(i = 0; i <= n; i++)37             g[i].clear();38         for(lt = rt = 1,i = 1; i < n; i++){39             scanf("%d %d %d",&u,&v,&w);40             g[u].push_back(arc(v,w));41             g[v].push_back(arc(u,w));42             if(w > rt) rt = w;43         }44         ans = -1;45         while(lt <= rt){46             mid = (lt+rt)>>1;47             memset(dp,0,sizeof(dp));48             dfs(1,-1,mid);49             if(dp[1] <= m){50                 ans = mid;51                 rt = mid-1;52             }else lt = mid+1;53         }54         printf("%d\n",ans);55     }56     return 0;57 }
View Code

 

 


联系
我们