[ACM] POJ 1273 Drainage Ditches (最大流)
2014-09-25 08:57
288 查看
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
Sample Output
Source
USACO 93
解题思路:
模板题,复习昨天的最大流。
代码:
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <queue>
#include <string.h>
using namespace std;
const int maxn=202;
const int inf=0x3f3f3f3f;
int mp[maxn][maxn];
bool vis[maxn];
int pre[maxn];
int n,m;
int s,e;
bool bfs()
{
queue<int>q;
memset(vis,0,sizeof(vis));
vis[s]=1;
q.push(s);
while(!q.empty())
{
int first=q.front();
if(first==e)
return true;
q.pop();
for(int i=1;i<=n;i++)
{
if(!vis[i]&&mp[first][i])
{
q.push(i);
vis[i]=1;
pre[i]=first;
}
}
}
return false;
}
int max_flow()
{
int ans=0;
while(1)
{
if(!bfs())
return ans;
int Min=inf;
for(int i=e;i!=s;i=pre[i])
Min=min(Min,mp[pre[i]][i]);
for(int i=e;i!=s;i=pre[i])
{
mp[pre[i]][i]-=Min;
mp[i][pre[i]]+=Min;
}
ans+=Min;
}
}
int main()
{
while(scanf("%d%d",&m,&n)!=EOF)
{
memset(mp,0,sizeof(mp));
int u,v,c;
while(m--)
{
scanf("%d%d%d",&u,&v,&c);
mp[u][v]+=c;
}
s=1,e=n;
printf("%d\n",max_flow());
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 56869 | Accepted: 21862 |
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
解题思路:
模板题,复习昨天的最大流。
代码:
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <queue>
#include <string.h>
using namespace std;
const int maxn=202;
const int inf=0x3f3f3f3f;
int mp[maxn][maxn];
bool vis[maxn];
int pre[maxn];
int n,m;
int s,e;
bool bfs()
{
queue<int>q;
memset(vis,0,sizeof(vis));
vis[s]=1;
q.push(s);
while(!q.empty())
{
int first=q.front();
if(first==e)
return true;
q.pop();
for(int i=1;i<=n;i++)
{
if(!vis[i]&&mp[first][i])
{
q.push(i);
vis[i]=1;
pre[i]=first;
}
}
}
return false;
}
int max_flow()
{
int ans=0;
while(1)
{
if(!bfs())
return ans;
int Min=inf;
for(int i=e;i!=s;i=pre[i])
Min=min(Min,mp[pre[i]][i]);
for(int i=e;i!=s;i=pre[i])
{
mp[pre[i]][i]-=Min;
mp[i][pre[i]]+=Min;
}
ans+=Min;
}
}
int main()
{
while(scanf("%d%d",&m,&n)!=EOF)
{
memset(mp,0,sizeof(mp));
int u,v,c;
while(m--)
{
scanf("%d%d%d",&u,&v,&c);
mp[u][v]+=c;
}
s=1,e=n;
printf("%d\n",max_flow());
}
return 0;
}
相关文章推荐
- POJ 3436 ACM Computer Factory (拆点+最大流)
- (最大流-简单题) poj 1273 Drainage Ditches
- poj1273 Drainage Ditches (最大流)
- HDOJ---1532||POJ---1273 Drainage Ditches[最大流-模版]
- poj 1273 EK 最大流
- POJ 1273 Drainage Ditches(网络流——最大流)
- POJ---1273 Drainage Ditches[最大流Dinic()]
- poj 1273 Drainage Ditches--最大流--Dinic
- poj 1273 最大流 基础题 (内有最详细的最大流分析,很好入门)
- POJ 1273 Drainage Ditches【最大流EK算法模板题】
- poj 1273 Drainage Ditches 最大流
- POJ-1273 朴素的最大流
- poj1273最大流
- poj 1273Drainage Ditches 最大流
- POJ-1273(最大流-Augment Path,EK,BFS)
- poj1273——最大流
- POJ1273 Drainage Ditches——最大流
- 【最大流】北大 poj 1273 Drainage Ditches
- POJ 1273 最大流
- 网络流 最大流 poj 1273