POJ-1273 Drainage Ditches 最大流Dinic
来源:互联网 发布:淘宝怎么可以贷款 编辑:程序博客网 时间:2024/05/18 01:44
Drainage Ditches
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 65146 Accepted: 25112
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.
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
题目大意:草地排水。。。
多组数据,有源有汇。。。。
CODE:
#include<iostream>#include<cstdio>#include<cstring>#include<queue>#include<algorithm>using namespace std;#define maxn 300int dis[maxn]={0};int way[maxn][maxn]={0};int q[maxn*10],h,t;int n,m,ans;bool bfs(){ h=0;t=1; memset(dis,0xff,sizeof(dis)); dis[1]=0; q[1]=1; while (h<t) { int j=q[++h]; for (int i=1; i<=n; i++) { if (dis[i]<0 && way[j][i]>0) { dis[i]=dis[j]+1; q[++t]=i; } } } if (dis[n]>0) return true; else return false;}int dfs(int loc,int low){ int ans=0; if (loc==n) return low; for (int i=1; i<=n; i++) if (way[loc][i]>0 && dis[i]==dis[loc]+1 && (ans=dfs(i,min(loc,way[loc][i])))) { way[loc][i]-=ans; way[i][loc]+=ans; return ans; } return 0;}int main(){ while (~scanf("%d%d",&m,&n)) { memset(way,0,sizeof(way)); for (int i=1; i<=m; i++) { int s,e,water; scanf("%d%d%d",&s,&e,&water); way[s][e]+=water; } ans=0; while (bfs()) { int now; while (now=dfs(1,0x7fffffff)) ans+=now; } printf("%d\n",ans); } return 0;}
- poj 1273 Drainage Ditches--最大流--Dinic
- poj 1273 Drainage Ditches (最大流Dinic)
- POJ 1273 Drainage Ditches 最大流 dinic
- POJ-1273 Drainage Ditches 最大流Dinic
- poj 1273 Drainage Ditches【最大流 dinic】
- poj 1273 Drainage Ditches(最大流 dinic模版)
- 【最大流(dinic)】poj 1273 Drainage Ditches
- POJ 1273~Drainage Ditches(网络最大流ek,dinic)
- POJ 1273 --Drainage Ditches【最大流模板 && dinic】
- POJ 1273 && HDU 1532 Drainage Ditches(最大流-Dinic)
- 【poj 1273】Drainage Ditches 最大流dinic模板
- POj 1273 Drainage Ditches (最大流 Dinic + ISAP 模板)
- poj 1273 hdu 1532 Drainage Ditches 最大流dinic 算法
- POJ 1273 Drainage Ditches -dinic
- poj 1273 Drainage Ditches 【最大流入门 dinic算法】
- POJ 1273 Drainage Ditches—网络流,最大流模板题,Dinic算法
- POJ--1273--Drainage Ditches【Dinic模板】【isap模板】网络最大流
- poj 1273 Drainage Ditches(最大流E-K +dinic 模板)
- android性能优化
- Java 中4字节形式数据转换为float
- copy和mutableCopy
- 高性能分布式计算与存储设计概要
- 小心错误使用EasyUI 让网站性能减半
- POJ-1273 Drainage Ditches 最大流Dinic
- 解决NDK开发中Eclipse报错“Unresolved inclusion jni.h”的最终方法
- CV开发环境配置(Ubuntu)
- 获取短信按钮倒计时60秒
- vim ctags cscope 配置
- Ubuntu下使用MentoHUST搞定 锐捷校园网认证网络
- javascript 操作 cookie
- win7下安装配置zookeeper
- 【LVL1_7_c】【思考题】【7】以a+ r+ w+模式打开的文件都是可读可写的,哪种模式更适合用来改变文件已有内容?