hdu1532 Drainage Ditches（最大流）

题目：

Drainage Ditches

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12660    Accepted Submission(s): 6033

Problem 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

 

Recommend

lwg   |   We have carefully selected several similar problems for you:   1533  3338  1569  3572  3416 

题意：给了一个图，知道每条边的容量，求最大流。

思路：我的第一道最大流，模板题。

代码：

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include<climits>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;

#define PB push_back
#define MP make_pair

#define REP(i,x,n) for(int i=x;i<(n);++i)
#define FOR(i,l,h) for(int i=(l);i<=(h);++i)
#define FORD(i,h,l) for(int i=(h);i>=(l);--i)
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define OI(X) printf("%d",X);
#define RS(X) scanf("%s", (X))
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
#define Swap(a, b) (a ^= b, b ^= a, a ^= b)
#define Dpoint  strcut node{int x,y}
#define cmpd int cmp(const int &a,const int &b){return a>b;}

 /*#ifdef HOME
    freopen("in.txt","r",stdin);
    #endif*/
const int MOD = 1e9+7;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<double> VD;
typedef long long LL;
typedef pair<int,int> PII;
//#define HOME

int Scan()
{
	int res = 0, ch, flag = 0;

	if((ch = getchar()) == '-')				//判断正负
		flag = 1;

	else if(ch >= '0' && ch <= '9')			//得到完整的数
		res = ch - '0';
	while((ch = getchar()) >= '0' && ch <= '9' )
		res = res * 10 + ch - '0';

	return flag ? -res : res;
}
/*----------------PLEASE-----DO-----NOT-----HACK-----ME--------------------*/
#define MAXN 250


int cap[MAXN][MAXN];
int flow[MAXN];
int pre[MAXN];
queue<int>myqueue;
int n,m;
int bfs(int src,int des)
{
    int i,j;
    while(!myqueue.empty())
        myqueue.pop();
    for(i=1;i<m+1;i++)
        pre[i]=-1;
    pre[src]=0;
    flow[src]=INT_MAX;
    myqueue.push(src);
    while(!myqueue.empty())
    {int index=myqueue.front();
    myqueue.pop();
    if(index==des)
        break;
        for(i=1;i<m+1;i++)
    {
        if(i!=src&&cap[index][i]>0&&pre[i]==-1)
        {
            pre[i]=index;
            flow[i]=min(cap[index][i],flow[index]);
            myqueue.push(i);
        }
    }
    }
    if(pre[des]==-1)
        return -1;
   else
    return flow[des];
}
int maxflow(int src,int des)
{
    int increasment=0;
    int sumflow=0;
    while((increasment=bfs(src,des))!=-1)
          {
              int k=des;
              while(k!=src)
              {
                  int last=pre[k];
                  cap[last][k]-=increasment;
                  cap[k][last]+=increasment;
                  k=last;
              }
              sumflow+=increasment;
          }
          return sumflow;
}
int main()
{
while(RII(n,m)!=EOF)
{MS0(flow);
MS0(cap);
for(int i=0;i<n;i++)
{
    int s,e,c;
    RIII(s,e,c);
    cap[s][e]+=c;
}
printf("%d\n",maxflow(1,m));
}



        return 0;
}