poj--1237--Drainage Ditches（最大流）

Drainage Ditches

Time Limit: 1000MS

Memory Limit: 10000KB

64bit IO Format: %I64d & %I64u

Submit
Status

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



开始做图论！！！

#include<stdio.h>
#include<string.h>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
#define MAX 210
#define INF 10000000+10
int head[MAX],cur[MAX];
int dis[MAX],vis[MAX];
int m,n,top;
struct node
{
	int u,v,cap,flow,next;
}edge[MAX*10];
void init()
{
	top=0;
	memset(head,-1,sizeof(head));
}
void add(int a,int b,int c)
{
	node E1={a,b,c,0,head[a]};
	edge[top]=E1;
	head[a]=top++;
	node E2={b,a,0,0,head[b]};
	edge[top]=E2;
	head[b]=top++;
}
void getmap()
{
	int a,b,c;
	while(n--)
	{
		scanf("%d%d%d",&a,&b,&c);
		add(a,b,c);
	}
}
bool bfs(int s,int e)
{
	queue<int>q;
	memset(dis,-1,sizeof(dis));
	memset(vis,0,sizeof(vis));
	vis[s]=1;
	dis[s]=0;
	while(!q.empty()) q.pop();
	q.push(s);
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		for(int i=head[u];i!=-1;i=edge[i].next)
		{
			node E=edge[i];
			if(!vis[E.v]&&E.cap>E.flow)
			//如果最大容量大于实际流量，就可以参与增广
			{
				vis[E.v]=1;
				dis[E.v]=dis[E.u]+1;
				if(E.v==e)
				return true;
				q.push(E.v);
			}
		}
	}
	return false;
}
int dfs(int x,int a,int e)
{
	if(x==e||a==0)
	return a;//通过深搜找到最小残量
	int flow=0,f;
	for(int i=cur[x];i!=-1;i=edge[i].next)
	{
		node& E=edge[i];
		if(dis[x]+1==dis[E.v]&&(f=dfs(E.v,min(a,E.cap-E.flow),e))>0)
		{
			E.flow+=f;
			edge[i^1].flow-=f;//反向边实际流量减最小残量
			flow+=f;
			a-=f;
			if(a==0) break;
		}
	}
	return flow;
}
int MAXflow(int s,int e)
{
	int flow=0;
	while(bfs(s,e))// 如果可以增广
	{
		memcpy(cur,head,sizeof(cur));
		flow+=dfs(s,INF,e);
	}
	return flow;
}
int main()
{
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		init();
		getmap();
		printf("%d\n",MAXflow(1,m));
	}
	return 0;
}