hdu 3452 最小割 树形dp
来源:互联网 发布:淘宝领优惠券的网站 编辑:程序博客网 时间:2024/05/18 02:14
Bonsai
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 684 Accepted Submission(s): 347
Problem Description
After being assaulted in the parking lot by Mr. Miyagi following the "All Valley Karate Tournament", John Kreese has come to you for assistance. Help John in his quest for justice by chopping off all the leaves from Mr. Miyagi's bonsai tree!
You are given an undirected tree (i.e., a connected graph with no cycles), where each edge (i.e., branch) has a nonnegative weight (i.e., thickness). One vertex of the tree has been designated the root of the tree.The remaining vertices of the tree each have unique paths to the root; non-root vertices which are not the successors of any other vertex on a path to the root are known as leaves.Determine the minimum weight set of edges that must be removed so that none of the leaves in the original tree are connected by some path to the root.
You are given an undirected tree (i.e., a connected graph with no cycles), where each edge (i.e., branch) has a nonnegative weight (i.e., thickness). One vertex of the tree has been designated the root of the tree.The remaining vertices of the tree each have unique paths to the root; non-root vertices which are not the successors of any other vertex on a path to the root are known as leaves.Determine the minimum weight set of edges that must be removed so that none of the leaves in the original tree are connected by some path to the root.
Input
The input file will contain multiple test cases. Each test case will begin with a line containing a pair of integers n (where 1 <= n <= 1000) and r (where r ∈ {1,……, n}) indicating the number of vertices in the tree and the index of the root vertex, respectively. The next n-1 lines each contain three integers ui vi wi (where ui, vi ∈ {1,……, n} and 0 <= wi <= 1000) indicating that vertex ui is connected to vertex vi by an undirected edge with weight wi. The input file will not contain duplicate edges. The end-of-file is denoted by a single line containing "0 0".
Output
For each input test case, print a single integer indicating the minimum total weight of edges that must be deleted in order to ensure that there exists no path from one of the original leaves to the root.
Sample Input
15 151 2 12 3 22 5 35 6 74 6 56 7 45 15 615 10 1110 13 513 14 412 13 39 10 88 9 29 11 30 0
Sample Output
16
Source
2009 Stanford Local ACM Programming Contest
给定一棵树,求最小花费使得根节点与叶子节点断开。
两种思路:树形dp,dp[u]表示切断以u为子树的代价,
代码:
/* ***********************************************Author :rabbitCreated Time :2014/3/9 21:30:26File Name :A.cpp************************************************ */#pragma comment(linker, "/STACK:102400000,102400000")#include <stdio.h>#include <iostream>#include <algorithm>#include <sstream>#include <stdlib.h>#include <string.h>#include <limits.h>#include <string>#include <time.h>#include <math.h>#include <queue>#include <stack>#include <set>#include <map>using namespace std;#define INF 0x3f3f3f3f#define eps 1e-8#define pi acos(-1.0)typedef long long ll;const int maxn=2020;int head[maxn],tol;struct Edge{ int next,to,val;}edge[10*maxn];void add(int u,int v,int w){ edge[tol].to=v; edge[tol].next=head[u]; edge[tol].val=w; head[u]=tol++;}int dp[maxn];void dfs(int u,int fa){ int d=0; for(int i=head[u];i!=-1;i=edge[i].next){ int v=edge[i].to; if(v==fa)continue; dfs(v,u); d+=min(dp[v],edge[i].val); } if(d)dp[u]=d;}int main(){ //freopen("data.in","r",stdin); //freopen("data.out","w",stdout); int n,r; while(~scanf("%d%d",&n,&r)&&(n||r)){ memset(head,-1,sizeof(head));tol=0; for(int i=1;i<n;i++){ int j,k,m; scanf("%d%d%d",&j,&k,&m); add(j,k,m); add(k,j,m); } memset(dp,0x3f,sizeof(dp)); dfs(r,-1); if(n==1)puts("0"); else cout<<dp[r]<<endl; } return 0;}
第二种思路:最小割,源点向根节点连边,容量inf,叶节点向汇点连边,容量inf,把剩下的边连双向,根据最小割最大流定理,最大流等于最小割。
代码:
/* ***********************************************Author :rabbitCreated Time :2014/3/9 22:00:26File Name :A.cpp************************************************ */#pragma comment(linker, "/STACK:102400000,102400000")#include <stdio.h>#include <iostream>#include <algorithm>#include <sstream>#include <stdlib.h>#include <string.h>#include <limits.h>#include <string>#include <time.h>#include <math.h>#include <queue>#include <stack>#include <set>#include <map>using namespace std;#define INF 10000000#define eps 1e-8#define pi acos(-1.0)typedef long long ll;const int maxn=2010;const int maxm=1002000;struct Edge{int next,to,cap;Edge(){};Edge(int _next,int _to,int _cap){next=_next;to=_to;cap=_cap;}}edge[maxm];int head[maxn],tol,dep[maxn],gap[maxn];void addedge(int u,int v,int flow){ edge[tol]=Edge(head[u],v,flow);head[u]=tol++; edge[tol]=Edge(head[v],u,0);head[v]=tol++;}void bfs(int start,int end){ memset(dep,-1,sizeof(dep)); memset(gap,0,sizeof(gap)); gap[0]++;int front=0,rear=0,Q[maxn]; dep[end]=0;Q[rear++]=end; while(front!=rear){ int u=Q[front++]; for(int i=head[u];i!=-1;i=edge[i].next){ int v=edge[i].to;if(dep[v]==-1) Q[rear++]=v,dep[v]=dep[u]+1,gap[dep[v]]++; } }}int sap(int s,int t,int N){int res=0;bfs(s,t);int cur[maxn],S[maxn],top=0,u=s,i;memcpy(cur,head,sizeof(head));while(dep[s]<N){if(u==t){int temp=INF,id; for( i=0;i<top;i++) if(temp>edge[S[i]].cap) temp=edge[S[i]].cap,id=i; for( i=0;i<top;i++) edge[S[i]].cap-=temp,edge[S[i]^1].cap+=temp; res+=temp;top=id;u=edge[S[top]^1].to;}if(u!=t&&gap[dep[u]-1]==0)break;for( i=cur[u];i!=-1;i=edge[i].next)if(edge[i].cap&&dep[u]==dep[edge[i].to]+1)break;if(i!=-1)cur[u]=i,S[top++]=i,u=edge[i].to;else{int MIN=N;for( i=head[u];i!=-1;i=edge[i].next)if(edge[i].cap&&MIN>dep[edge[i].to])MIN=dep[edge[i].to],cur[u]=i;--gap[dep[u]];++gap[dep[u]=MIN+1];if(u!=s)u=edge[S[--top]^1].to;}}return res;}int in[maxn];int main(){ //freopen("data.in","r",stdin); //freopen("data.out","w",stdout); int n,r; while(~scanf("%d%d",&n,&r)&&(n||r)){ memset(head,-1,sizeof(head));tol=0; int sum=0; memset(in,0,sizeof(in)); for(int i=1;i<n;i++){ int j,k,m; scanf("%d%d%d",&j,&k,&m); addedge(j,k,m); addedge(k,j,m); sum+=m;in[j]++;in[k]++; }// for(int i=1;i<=n;i++)cout<<in[i]<<" ";cout<<endl; for(int i=1;i<=n;i++){ if(i==r)addedge(0,r,INF); else if(in[i]==1)addedge(i,n+1,INF); } int ans=sap(0,n+1,3*n); cout<<ans<<endl; } return 0;}
0 0
- hdu 3452 最小割 树形dp
- HDU 3452 最小割 (树形dp)
- hdu 3452 最小割
- 51nod 1299 监狱逃离 树形dp/最小割
- hdu 3452 Bonsai 最小割
- hdu 3452 Bonsai(最小割)
- hdu 3452(最小割)
- HDU 3452 Bonsai | 最小割
- hdu 3452 Bonsai 最小割
- 【HDU】3452 Bonsai 最小割模板题
- HDU 3452 Bonsai(最小割)
- hdu 3996 最小割
- HDU 3491 最小割
- HDU 3251 最小割
- hdu 3987 最小割
- HDU 4859 最小割
- hdu 3046 最小割
- HDU 3491 最小割
- 以太网端口技术(2)
- 最大连续子序列相乘
- 骨骼蒙皮动画(Skinned Mesh)的原理解析
- java的一些程序!
- gdb 多线程调试
- hdu 3452 最小割 树形dp
- Hibernate内置的
- 处理java.lang.IllegalMonitorStateException
- 贝叶斯统计
- java的一些情节!
- 今天学习编写DTD文件
- Python中的格式化字符串
- AJAX showHint()函数
- PHP 单例模式解析和实战