zoukankan      html  css  js  c++  java
  • 最大流模版

    Drainage Ditches
    Time Limit: 1000MS   Memory Limit: 10000K
         

    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 <stdio.h>
    #include <queue>
    #include <stdio.h>
    #include <string.h>
    #include <vector>
    #include <queue>
    #include <set>
    #include <algorithm>
    #include <map>
    #include <stack>
    #include <math.h>
    #define Max(a,b) ((a)>(b)?(a):(b))
    #define Min(a,b) ((a)<(b)?(a):(b))
    #include <cstdio>
    #include <cstring>
    #include <iostream>
    using namespace std;
    
    typedef long long ll;
    typedef unsigned long long ull;
    
    const int MAXN = 208; //
    const int MAXM = 408;  //
    const int INF = 1e9;
    
    int vec[MAXN],tol;
    int gap[MAXN],dis[MAXN],arc[MAXN],pre[MAXN],cur[MAXN];
    int vs ;  //起点
    int vt ;  //终点
    int N ; //顶点个数
    
    struct Edge{
        int y,f,next;
    }edge[MAXM];
    
    void Add(int x,int y,int f){
        edge[++tol].y = y;
        edge[tol].f = f;
        edge[tol].next = vec[x];
        vec[x] = tol;
    }
    
    void add_edge(int x,int y,int f){  //无向边
        Add(x,y,f);
        Add(y,x,0);
    }
    
    int sap(){
        memset(dis,0,sizeof(dis));
        memset(gap,0,sizeof(gap));
        gap[0] = N;
        for(int i=1;i<=vt;i++)
            arc[i] = vec[i];
    
        int ans = 0;
        int aug = INF;
        int x = vs;
    
        while(dis[vs]<N){
            bool ok = false;
            cur[x] = aug;
            for(int i=arc[x];i;i=edge[i].next){
                int y = edge[i].y;
                if(edge[i].f>0&&dis[y]+1==dis[x]){
                    ok = true;
                    pre[y] = arc[x] = i;
                    aug = Min(aug,edge[i].f);
                    x = y;
                    if(x==vt){
                        ans += aug;
                        while(x!=vs){
                            edge[pre[x]].f -= aug;
                            edge[pre[x]^1].f += aug;
                            x = edge[pre[x]^1].y;
                        }
                        aug = INF;
                    }
                    break;
                }
            }
            if(ok)
                continue;
            int MIN = N -1;
            for(int i=vec[x];i;i=edge[i].next){
                if(edge[i].f>0&&dis[edge[i].y]<MIN){
                    MIN = dis[edge[i].y];
                    arc[x] = i;
                }
            }
            if(--gap[dis[x]]==0)
                break;
            dis[x] = ++ MIN;
            ++ gap[dis[x]];
            if(x!=vs){
                x = edge[pre[x]^1].y;
                aug = cur[x];
            }
        }
        return ans;
    }
    
    int main(){
           int n , m ,u ,v ,w;
           while(scanf("%d%d",&m,&n)!=EOF){
              memset(vec,0,sizeof(vec)) ;
              tol=1 ;
              N=n ;
              vs=1 ;
              vt=n ;
              while(m--){
                  scanf("%d%d%d",&u,&v,&w) ;
                  add_edge(u,v,w) ;
              }
              printf("%d
    ",sap()) ;
           }
       return 0 ;
    }
  • 相关阅读:
    自动化单元测试
    Exadata是什么?
    Exadata的独门武器卸载(Offloading)
    Exadata中最有用的功能存储索引
    面向对象分析与设计(第3版)
    代码质量(权威精选植根于开发实践的最佳读物)
    温昱谈程序员向架构师转型的规律
    sql语句大全
    一个弹出层的代码
    ASP.NET 2.0 实现伪静态网页方法 (转载 ————续)
  • 原文地址:https://www.cnblogs.com/liyangtianmen/p/3386944.html
Copyright © 2011-2022 走看看