hdu 1532 Drainage Ditches【最大流】
来源:互联网 发布:grub命令启动windows 编辑:程序博客网 时间:2024/05/20 19:33
Drainage Ditches
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13890 Accepted Submission(s): 6574
Problem Description
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.
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
5 4
1 2 40
1 4 20
2 4 20
2 3 30
3 4 10
Sample Output
50
Source
USACO 93
思路:裸的最大流问题。
AC代码:
#include <stdio.h>#include <iostream>#include <string.h>#include <queue>using namespace std;const int N=1005;int pre[N]; //保存增广路径上的点的前驱顶点bool vis[N];int map[N][N];int s,t; //s为源点,t为汇点int n,m;bool bfs(){ int i,cur; queue<int >q; memset(pre,0,sizeof(pre)); memset(vis,0,sizeof(vis)); vis[s]=true; q.push(s); while(!q.empty()) { cur=q.front(); q.pop(); if(cur==t)return true; for(int i=1;i<=n;i++) { if(vis[i]==0&&map[cur][i]) { q.push(i); pre[i]=cur; vis[i]=true; } } } return false;}int Max_Flow(){ int ans=0; while(1) { if(!bfs())return ans; int Min=0x3f3f3f3f; for(int i=t;i!=s;i=pre[i]) { Min=min(Min,map[pre[i]][i]); } for(int i=t;i!=s;i=pre[i]) { map[pre[i]][i]-=Min; map[i][pre[i]]+=Min; } ans+=Min; }}int main(){ int T,k=1; int u,v,c; while(~scanf("%d%d",&m,&n)) { s=1; t=n; memset(map,0,sizeof(map)); for(int i=0;i<m;i++) { scanf("%d%d%d",&u,&v,&c); map[u][v]+=c; } printf("%d\n",Max_Flow()); }}
0 0
- HDU 1532 Drainage Ditches (最大网络流)
- HDU 1532 Drainage Ditches (最大网络流)
- hdu 1532 Drainage Ditches(最大网络流)
- hdu 1532 Drainage Ditches 基础最大流
- hdu 1532 Drainage Ditches 最大流
- hdu 1532 Drainage Ditches (最大流)
- [hdu 1532] Drainage Ditches(最大流dinic)
- hdu 1532 Drainage Ditches(最大流)
- hdu 1532 Drainage Ditches 最大流 水题
- hdu 1532 最大网络流 Drainage Ditches
- HDU 1532 Drainage Ditches 最大流
- HDU 1532 Drainage Ditches(最大流)
- Drainage Ditches - HDU 1532 最大流
- HDU 1532--Drainage Ditches【最大流】
- hdu 1532 Drainage Ditches(最大流)
- HDU 1532 Drainage Ditches(最大流)
- hdu 1532 Drainage Ditches【最大流】
- HDU 1532 Drainage Ditches (最大流模板)
- 【ztree系列】节点拖拽
- 如何实现Oracle的监听(listener)多个IP地址
- 栈
- my_printf的实现小例子
- 简单的几个 T-SQL 操作 XML 的小例子
- hdu 1532 Drainage Ditches【最大流】
- MS SQL修改数据库名称
- 程序关联文件 获取双击文件路径 MFC/VC
- opencv中的FileStorage类使用注意事项
- Burp Suite使用介绍(一)
- ArrayList中调用set()方法,没有插入数据的问题
- 15数字排序 最后一个最小
- CodeForces 17B Hierarchy
- Master-Master架构