Poj 1273 Drainage Ditches【最大流入门题----Ford-Fulkerson】
2016-07-03 20:53
429 查看
Drainage Ditches
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
Source
USACO 93
记录网络流属于自己的板子!
AC代码:
#include<stdio.h>
#include<queue>
#include<string.h>
using namespace std;
int map[305][305];
int vis[305];
int pre[305];
int ss,tt,maxflow;
int n,m;
int Bfs()
{
memset(vis,0,sizeof(vis));
memset(pre,-1,sizeof(pre));
queue<int >s;
s.push(ss);
vis[ss]=1;
while(!s.empty())
{
int u=s.front();
if(u==tt)return 1;
s.pop();
for(int v=1;v<=n;v++)
{
if(vis[v]==0&&map[u][v]!=0)
{
pre[v]=u;
vis[v]=1;
s.push(v);
}
}
}
return 0;
}
void Ford_Fulkerson()
{
maxflow=0;
while(1)
{
if(Bfs()==1)
{
int Min=0x3f3f3f3f;
for(int i=tt;i!=ss;i=pre[i])
{
Min=min(Min,map[pre[i]][i]);
}
for(int i=tt;i!=ss;i=pre[i])
{
map[pre[i]][i]-=Min;
map[i][pre[i]]+=Min;
}
maxflow+=Min;
}
else break;
}
printf("%d\n",maxflow);
}
int main()
{
while(~scanf("%d%d",&m,&n))
{
ss=1;tt=n;
memset(map,0,sizeof(map));
for(int i=0;i<m;i++)
{
int x,y,w;
scanf("%d%d%d",&x,&y,&w);
map[x][y]+=w;
}
Ford_Fulkerson();
}
}
Time Limit: 1000MS | | Memory Limit: 10000K |
Total Submissions: 68229 | | Accepted: 26399 |
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
Source
USACO 93
记录网络流属于自己的板子!
AC代码:
#include<stdio.h>
#include<queue>
#include<string.h>
using namespace std;
int map[305][305];
int vis[305];
int pre[305];
int ss,tt,maxflow;
int n,m;
int Bfs()
{
memset(vis,0,sizeof(vis));
memset(pre,-1,sizeof(pre));
queue<int >s;
s.push(ss);
vis[ss]=1;
while(!s.empty())
{
int u=s.front();
if(u==tt)return 1;
s.pop();
for(int v=1;v<=n;v++)
{
if(vis[v]==0&&map[u][v]!=0)
{
pre[v]=u;
vis[v]=1;
s.push(v);
}
}
}
return 0;
}
void Ford_Fulkerson()
{
maxflow=0;
while(1)
{
if(Bfs()==1)
{
int Min=0x3f3f3f3f;
for(int i=tt;i!=ss;i=pre[i])
{
Min=min(Min,map[pre[i]][i]);
}
for(int i=tt;i!=ss;i=pre[i])
{
map[pre[i]][i]-=Min;
map[i][pre[i]]+=Min;
}
maxflow+=Min;
}
else break;
}
printf("%d\n",maxflow);
}
int main()
{
while(~scanf("%d%d",&m,&n))
{
ss=1;tt=n;
memset(map,0,sizeof(map));
for(int i=0;i<m;i++)
{
int x,y,w;
scanf("%d%d%d",&x,&y,&w);
map[x][y]+=w;
}
Ford_Fulkerson();
}
}
相关文章推荐
- 最大流入门 之 poj 1273
- POJ 1273 Drainage Ditches 我的第一道网络流——最大流问题
- poj 1273 hdu 1532 网络流最大流 Dinic算法
- POJ 1273-Drainage Ditches(最大流-Edmond-Karp算法/模板)
- POJ1995 Raising Modulo Numbers
- hdu 1039 Easier Done Than Said?
- Paint的效果研究
- web.xml中<security-constraint>和四种认证类型
- 博弈论基础知识: 巴什博奕+威佐夫博奕+尼姆博弈(及Staircase)
- RAID各级别及其特性
- Design Pattern - Behavioral Patterns - Chain of Responsibility Pattern
- LightOJ 1090 Trailing Zeroes (II) [分解]【数论】
- 使用mailto连接email邮件
- poj 1995 Raising Modulo Numbers 题解
- poj1995 Raising Modulo Numbers
- POJ 3714 Raid
- BIO NIO AIO
- 人工智能之人机博弈(1)
- 1014. Waiting in Line (30)
- hdu 1839 Delay Constrained Maximum Capacity Path【二分+SPFA】