Drainage Ditches (poj 1273 && hdu 1532 网络流之Ford-Fulkerson)
来源:互联网 发布:魔兽世界for mac 国服 编辑:程序博客网 时间:2024/05/29 04:49
Language:
Drainage Ditches
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 59676 Accepted: 22909
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 41 2 401 4 202 4 202 3 303 4 10
Sample Output
50
Source
USACO 93
题意:N条边,M个点,求最大流。
代码:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <string>#include <map>#include <stack>#include <vector>#include <set>#include <queue>#pragma comment (linker,"/STACK:102400000,102400000")#define maxn 402#define MAXN 2005#define mod 1000000009#define INF 0x3f3f3f3f#define pi acos(-1.0)#define eps 1e-6#define lson rt<<1,l,mid#define rson rt<<1|1,mid+1,r#define FRE(i,a,b) for(i = a; i <= b; i++)#define FREE(i,a,b) for(i = a; i >= b; i--)#define FRL(i,a,b) for(i = a; i < b; i++)#define FRLL(i,a,b) for(i = a; i > b; i--)#define mem(t, v) memset ((t) , v, sizeof(t))#define sf(n) scanf("%d", &n)#define sff(a,b) scanf("%d %d", &a, &b)#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)#define pf printf#define DBG pf("Hi\n")typedef __int64 ll;using namespace std;struct Node{ int u,v,cap,next;//起点,终点,容量}edge[maxn];int n,m,num;int head[maxn];int vis[maxn];void init(){ num=0; mem(head,-1);}void addedge(int u,int v,int w,int rw=0){ edge[num].v=v; edge[num].cap=w; edge[num].next=head[u]; head[u]=num++; edge[num].v=u; edge[num].cap=rw;edge[num].next=head[v]; head[v]=num++;}int dfs(int to,int t,int f){ if (to==t) return f; vis[to]=true; for (int i=head[to];i!=-1;i=edge[i].next) { int v=edge[i].v; if (!vis[v]&&edge[i].cap>0) { int d=dfs(v,t,min(f,edge[i].cap)); if (d>0) { edge[i].cap-=d; edge[i^1].cap+=d; return d; } } } return 0;}int max_flow(int s,int t){ int flow=0; while (1) { mem(vis,false); int f=dfs(s,t,INF); if (f<=0) return flow; flow+=f; }}int main(){ int i,j,u,v,w; while (~sff(m,n)) { init(); FRE(i,1,m) { sfff(u,v,w); addedge(u,v,w); } pf("%d\n",max_flow(1,n)); } return 0;}
1 0
- Drainage Ditches (poj 1273 && hdu 1532 网络流之Ford-Fulkerson)
- [poj] 1273 Drainage Ditches[最大流][Ford-Fulkerson]
- poj 1273 Drainage Ditches 【图论-网络流-最大流-Ford-Fulkerson】
- poj 1273 Drainage Ditches 网络流最大流入门 ford-fulkerson
- HDU 1532-Drainage Ditches(网络最大流,EK,Ford-Fulkerson,dinic3种算法套模板)
- hdu 1532 Drainage Ditches(最大流之Ford-Fulkerson算法)
- Poj 1273 Drainage Ditches【最大流入门题----Ford-Fulkerson】
- NYOJ 323 && HDU 1532 && POJ 1273 Drainage Ditches (网络流之最大流入门)
- HDOJ 1532 Drainage Ditches (Ford-Fulkerson + EK + Dinic)
- USACO-Section 4.2 Drainage Ditches (最大流[Ford-Fulkerson])
- POJ 1273Drainage Ditches(网络流之最大流)
- poj 1273 Drainage Ditches(网络流入门之最大流)
- POJ 1273(HDU 1532) Drainage Ditches|HDU 3549 Flow Problem|很典型&&裸的网络流
- hdu 1532 Drainage Ditches 增广路 ford
- poj 1273 Drainage Ditches 网络最大流
- poj 1273 Drainage Ditches--网络流
- 【网络流】poj 1273 Drainage Ditches
- 网络流poj(1273)Drainage Ditches
- drivers_day11
- ios图片压缩
- 鼎泰移民向您介绍香港理工大学
- Web前端UI(含移动端)
- 第三章 文件 I/O
- Drainage Ditches (poj 1273 && hdu 1532 网络流之Ford-Fulkerson)
- 485自收发电路分析
- 【Spring】Spring&WEB整合原理及源码剖析
- drivers_day12
- 步步为营_Android开发课[8]_AsyncTask学习
- Android开发面试经——4.常见Android进阶笔试题
- Linux添加、删除和管理用户和用户组
- 玩转OpenStack网络Neutron(3)--配置多种不同类型网络
- drivers_day13