POJ 1273 Drainage Ditches 最大流
2013-12-06 17:52
344 查看
Drainage Ditches
Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built a set of drainage ditches so that Bessie's clover patch is never covered in water. Instead, the water is drained to a nearby stream. Being an ace engineer, Farmer John has also installed regulators at the beginning of each ditch, so he can control at what rate water flows into that ditch. Farmer John knows not only how many gallons of water each ditch can transport per minute but also the exact layout of the ditches, which feed out of the pond and into each other and stream in a potentially complex network. Given all this information, determine the maximum rate at which water can be transported out of the pond and into the stream. For any given ditch, water flows in only one direction, but there might be a way that water can flow in a circle. Input The input includes several cases. For each case, the first line contains two space-separated integers, N (0 <= N <= 200) and M (2 <= M <= 200). N is the number of ditches that Farmer John has dug. M is the number of intersections points for those ditches. Intersection 1 is the pond. Intersection point M is the stream. Each of the following N lines contains three integers, Si, Ei, and Ci. Si and Ei (1 <= Si, Ei <= M) designate the intersections between which this ditch flows. Water will flow through this ditch from Si to Ei. Ci (0 <= Ci <= 10,000,000) is the maximum rate at which water will flow through the ditch. Output For each case, output a single integer, the maximum rate at which water may emptied from the pond. Sample Input 5 4 1 2 40 1 4 20 2 4 20 2 3 30 3 4 10 Sample Output 50 Source USACO 93 |
[Discuss]
最大流简单例题 Dinic算法
#include <iostream> #include <string.h> #include <stdio.h> using namespace std; const int INF=2e9; const int mm=999; const int mn=999; int node,s,t,edge; int ver[mm],flow[mm],next[mm]; int head[mn],work[mn],dis[mn],q[mn]; void init(int _node,int _s,int _t) { node=_node, s=_s, t=_t; for(int i=0;i<node;++i) head[i]=-1; edge=0; } void addedge(int u,int v,int c) { ver[edge]=v,flow[edge]=c,next[edge]=head[u],head[u]=edge++; ver[edge]=u,flow[edge]=0,next[edge]=head[v],head[v]=edge++; } bool Dinic_bfs() { int i,u,v,l,r=0; for(i=0;i<node;++i) dis[i]=-1; dis[ q[r++]=s ] = 0; for(l=0;l<r;l++) { for(i=head[ u=q[l] ]; ~i ;i=next[i]) if(flow[i] && dis[ v=ver[i] ]<0) { dis[ q[r++]=v ]=dis[u]+1; if(v==t) return 1; } } return 0; } int Dinic_dfs(int u,int exp) { if(u==t) return exp; for(int &i=work[u],v,temp; ~i ;i=next[i]) { if(flow[i] && dis[ v=ver[i] ]==dis[u]+1 && ( temp=Dinic_dfs(v,min(exp,flow[i])) )>0) { flow[i]-=temp; flow[i^1]+=temp; return temp; } } return 0; } int Dinic_flow() { int ans=0,res,i; while(Dinic_bfs()) { for(i=0;i<node;++i) work[i]=head[i]; while( res=Dinic_dfs(s,INF) ) ans+=res; } return ans; } int main() { int n,m,u,v,c; while(scanf("%d%d",&m,&n)!=EOF) { init(n+1,1,n); while(m--) { scanf("%d%d%d",&u,&v,&c); addedge(u,v,c); } printf("%d\n",Dinic_flow()); } return 0; }
相关文章推荐
- isap算法模板poj 1273gap+弧优化 最大流
- poj 1273 Drainage Ditches(最大流)
- POJ1273 Drainage Ditches——最大流
- poj 1273 Drainage Ditches (网络流 最大流)
- POJ 1273 Drainage Ditches (最大流 :Dinic | EK)
- poj 1273 Drainage Ditches (最大流Dinic)
- poj 1273 Drainage Ditches---EK求最大流
- Drainage Ditches poj 1273 最大流
- POJ 1273 Drainage Ditches dinic 最大流
- [POJ 1273] Drainage Ditches 最大流 模板题
- POJ 1273 Drainage Ditches (最大流,线性规划)
- POJ1273 Drainage Ditches(最大流)
- poj 1273 EK 最大流
- 【最大流-ISAP】POJ-1273-网络流模板!!
- POJ_1273_Drainage-Ditchs_图论_最大流
- isap算法模板poj 1273gap+弧优化 最大流
- poj 1273 最大流(三种方法)
- POJ 1273 Drainage Ditches (最大流入门~)
- POJ 1273 Drainage Ditches 最大流
- POJ1273——最大流之Edmonds-Karp——Drainage Ditches