POJ 1273 Drainage Ditches

最新推荐文章于 2017-12-27 21:12:54 发布

Orion_Rigel

最新推荐文章于 2017-12-27 21:12:54 发布

阅读量409

点赞数

分类专栏：网络流文章标签： poj 网络流

本文链接：https://blog.csdn.net/Orion_Rigel/article/details/51297176

版权

网络流专栏收录该内容

15 篇文章 0 订阅

订阅专栏

Language:

Drainage Ditches

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 67387		Accepted: 26035

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

【题目分析】

简单地网络流的模板题目。主要是感受一下网络流的算法。

#include <cstdio>
#include <iostream>
#include <cstring>
#define INF 1000000
using namespace std;
int u[501],v[501],h[501],ne[501],map[501],f[501];
int n,m,en=0,S,T;
void add(int a,int b,int r)  //正向存一个r的边，反向为0（无法退流）
{
	u[en]=a;v[en]=b;ne[en]=h[a];f[en]=r;h[a]=en++;
	u[en]=b;v[en]=a;ne[en]=h[b];f[en]=0;h[b]=en++;
}
bool tell()//一边bfs，既能判断是否可以进行增广，又可以增加网络流的效率
{
	memset(map,-1,sizeof map);
	int que[501];
	int head=0,tail=0;
	que[tail++]=S;
	map[S]=0;
	while (head<tail){
		int u=que[head++];
		for (int i=h[u];i!=-1;i=ne[i]){
			if (map[v[i]]==-1&&f[i]){
				map[v[i]]=map[u]+1;
				que[tail++]=v[i];
			}
		}
	}
	if (map[T]!=-1) return true;
	else return false;
}
int zeng (int k,int now)//进行增广路
{
	if (k==T) return now;
	int r=0;
	for (int i=h[k];i!=-1&&now>r;i=ne[i]){
		if (map[k]+1==map[v[i]]&&f[i]!=0){
			int t=zeng(v[i],min(now-r,f[i]));
			f[i]-=t;f[i^1]+=t;r+=t;
		}
	}
	if (!r) map[k]=-1;
	return r;
}
int dinic()//主体算法
{
	int r=0,t;
	while (tell()) while (t=zeng(S,INF)) r+=t;
	return r; 
}
int main()
{
	while(cin>>n>>m)
{	memset(u,-1,sizeof u);
	memset(v,-1,sizeof v);
	memset(h,-1,sizeof h);
	memset(ne,-1,sizeof ne);
	en=0;S=1;T=m;
	for (int i=1;i<=n;++i){
		int u,v,r;
		cin>>u>>v>>r;
		add(u,v,r);
	}
	cout<<dinic()<<endl;
}
}