网络流模板-(EdmondsKarp)-HDU-1532-Drainage Ditches
来源:互联网 发布:python 交易平台 编辑:程序博客网 时间:2024/06/12 01:06
HDU - 1532 Drainage Ditches
Status
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
#include <cstdio>#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <queue>#include <map>#include <set>#include <vector>#include <string>#include <time.h>#define mem(a) memset(a,0,sizeof(a))#define mem2(a) memset(a,-1,sizeof(a))#define memf(a) memset(a,0x3f,sizeof(a))#define mod 1000000007#define mx 30000000#define LL long long#define INF 0x3f3f3f3fusing namespace std;LL mp[205][205];LL pre[205];LL visited[205];LL m,n;//n是节点的标号最大数void update_residual_network(int u,int flow){ while(pre[u]!=-1) { mp[pre[u]][u]-=flow; mp[u][pre[u]]+=flow; u=pre[u]; }}int find_path_bfs(int s,int t){ memset(visited,0,sizeof(visited)); memset(pre,-1,sizeof(pre)); visited[s]=1; int min=INF; queue<int> q;// while(!q.empty())q.pop(); q.push(s); while(!q.empty()) { int cur=q.front(); q.pop(); if(cur==t) break; for(int i=1; i<=n; ++i) if( visited[i] == 0 && mp[cur][i] != 0) { q.push(i); min=(min<mp[cur][i]?min:mp[cur][i]) ; pre[i]=cur; visited[i]=1; } } if(pre[t]==-1) return 0; return min;}int edmonds_karp(int s,int t){ int new_flow=0; int max_flow=0; do { new_flow = find_path_bfs(s,t); update_residual_network(t,new_flow); max_flow += new_flow; } while( new_flow != 0 ); return max_flow;}int main(){ int x,y,z; while(cin>>m>>n) { mem(mp); for(int i=0; i<m; ++i) { cin>>x>>y>>z; if(x==y)continue; mp[x][y]==z; } cout<<edmonds_karp(1,n)<<endl; } return 0;}
- 网络流模板-(EdmondsKarp)-HDU-1532-Drainage Ditches
- hdu 1532 Drainage Ditches(网络流之最大流EdmondsKarp)
- HDU 1532 Drainage Ditches 网络流模板
- hdu 1532 Drainage Ditches(网络流dinic模板)
- HDU1532 Drainage Ditches(网络流EdmondsKarp)
- HDU1532 Drainage Ditches(网络流、EdmondsKarp)
- HDU 1532 Drainage Ditches 网络流 模板题
- HDU 1532 Drainage Ditches 网络流模板题(Dinic)
- Drainage Ditches(网络流_EK模板)
- HDU 1532 Drainage Ditches (最大流模板)
- hdu 1532/poj 1273 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
- 【网络流基础】hdu 1532 Drainage Ditches
- pat 1002 写出这个数
- curl携带jsession方式请求,获取cookie等
- 二叉树基本概念——二叉树(概念、性质、顺序存储,链式存储)、满二叉树与完全二叉树、二叉链表,三叉链表,双亲链表
- 【js小工具】去除所有空格
- 1009. Product of Polynomials (25) 多项式求解_单链表的运用
- 网络流模板-(EdmondsKarp)-HDU-1532-Drainage Ditches
- 终结篇:MyBatis原理深入解析(一)
- Java Exception异常
- 九九乘法表
- Java配置----JDK开发环境搭建及环境变量配置
- 【想法】codeforces.com/contest/884/problem/C Bertown Subway
- 每日一练_05
- uvalive 4725
- 用python爬取豆瓣小说