POJ-1273-Drainage Ditches
来源:互联网 发布:mysql 视图 union all 编辑:程序博客网 时间:2024/06/16 13:18
Drainage Ditches
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 48933 Accepted: 18478
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
简单的最大流问题
用EK
AC代码:
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<cstdlib>#include<algorithm>#include<iomanip>#include<queue>const int MAX=401;const int INF=999999999;int max_flow[MAX][MAX];int mark[MAX];int Queue[MAX];using namespace std;int EK(int n){ int ans,Min,end; queue<int>que; ans=0; while(true) { int head,tail,i; int temp; head=0; tail=0; que.push(1); //Queue[++tail]=1; memset(mark,0,sizeof(mark)); mark[1]=1; while(!que.empty()) { //temp=Queue[++head]; temp=que.front(); que.pop(); if(temp==n) break; for(i=1;i<=n;i++) { if(!mark[i]&&max_flow[temp][i]) { mark[i]=temp; //Queue[++tail]=i; que.push(i); } } } if(mark[n]==0) break; Min=INF; for(end=n;end!=1;end=mark[end]) { if(Min>max_flow[mark[end]][end]) Min=max_flow[mark[end]][end]; } ans+=Min; for(end=n;end!=1;end=mark[end]) { max_flow[mark[end]][end]-=Min; max_flow[end][mark[end]]+=Min; } while(!que.empty())//每次使用完后清空队列 que.pop(); } return ans;}int main(){ int n,m,a,b,c,i; while(cin>>n>>m) { memset(max_flow,0,sizeof(max_flow)); for(i=1;i<=n;i++) { cin>>a>>b>>c; max_flow[a][b]+=c; } cout<<EK(m)<<endl; } return 0;}
- POJ 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- poj 1273 Drainage Ditches
- poj 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- POJ-1273-Drainage Ditches
- poj 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- poj 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- POJ-1273-Drainage Ditches
- poj 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- poj 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- POJ 1273 Drainage Ditches
- COM 组件设计与应用----起源及复合文件
- 01背包-poj3624
- poj 2516 Minimum Cost(最小费用最大流)
- 截取指定长度
- 重温面向对象——单一功能原则
- POJ-1273-Drainage Ditches
- 一个c++中计算算法运行时间的程序
- IIS音频格式了解
- hdu 1394 Minimum Inversion Number
- 一个Python中的闭包问题
- .NET框架设计—常被忽视的框架设计技巧
- 老师说 要坚持写博客。。
- Poj 2411 Mondriaan's Dream(压缩矩阵DP)
- STL之Vector