Drainage Ditches
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 85181 | Accepted: 33138 |
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
最大流,水题,模板
邻接矩阵,
#include <iostream>
#include <cstring>
#include <algorithm>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
using namespace std;
const int inf=0x3f3f3f3f;
const int maxx=500;
int mapp[maxx][maxx];
int n,m;
int dep[maxx],q[maxx],h,r;//分层,队列,首,尾
int Bfs()
{
memset(dep,0,sizeof(dep));
dep[1]=1;
h=0,r=1;
q[1]=1;
while(h<r)
{
int j=q[++h];
for(int i=1;i<=n;i++)
{
if(dep[i]==0&&mapp[j][i]>0)
{
dep[i]=dep[j]+1;
q[++r]=i;
}
}
}
if(dep[n]>0)return 1;
else return 0;
}
/*Dfs代表一次增广,函数返回每次增广的流量,返回0表示无法增广*/
int Dfs(int x,int low)/*low是源点到最窄的(剩余流量最小)的边的剩余流量*/
{
int f=0;
if(x==n) return low;//到达汇点返回流量
for(int i=1;i<=n;i++)
{
if(
mapp[x][i]>0&&//判断连通
dep[i]==dep[x]+1//判断是不是下一层
&&(f=Dfs(i,min(low,mapp[x][i])))//判断能不能到汇点
)
{
mapp[x][i]-=f;
mapp[i][x]+=f;
return f;
}
}
return 0;
}
int main()
{
while(scanf("%d%d",&m,&n)!=EOF)
{
int u,v,f;
memset(mapp,0,sizeof(mapp));
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&u,&v,&f);
mapp[u][v]+=f;
}
int ans=0;
while(Bfs())//要不停的建立分层图,直到没有
{
int temp;
while(temp=Dfs(1,inf)) ans+=temp;
/*Dinic*/
}
cout<<ans<<endl;
}return 0;
}