zoukankan      html  css  js  c++  java
  • HDU 1532 基础EK Drainage Ditches

    Drainage Ditches

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


    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
     
    Recommend
    lwg   |   We have carefully selected several similar problems for you:  1533 3338 1569 3572 3416 
     
     
     
    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<algorithm>
    #include<queue>
    using namespace std;
    int dp[400][400],pre[400];
    const int tmin=999999999;
    int maxflow;
    void EK(int start,int end,int n){
        while(1){
            queue<int>q;
            q.push(1);
           int  minflow=tmin;
            memset(pre,0,sizeof(pre));
            while(!q.empty()){
                int u=q.front();
                q.pop();
                for(int i=1;i<=n;i++){
                    if(dp[u][i]>0&&!pre[i]){
                        pre[i]=u;
                        q.push(i);
                    }
                }
            }
            if(pre[end]==0)
                break;
            for(int i=end;i!=start;i=pre[i]){
                minflow=min(dp[pre[i]][i],minflow);
            }
            for(int i=end;i!=start;i=pre[i]){
                dp[pre[i]][i]-=minflow;
                dp[i][pre[i]]+=minflow;
            }
            maxflow+=minflow;
        }
    }
    int main(){
      
       int n,m;
       while(scanf("%d%d",&m,&n)!=EOF){
           memset(dp,0,sizeof(dp));
           memset(pre,0,sizeof(pre));
           int u,v,w;
           for(int i=1;i<=m;i++){
               scanf("%d%d%d",&u,&v,&w);
               dp[u][v]+=w;
           }
           maxflow=0;
           EK(1,n,n);
           printf("%d
    ",maxflow);
       }
       return 0;
    }
  • 相关阅读:
    HTML5触屏版多线程渲染模板技术分享
    Yii2使用驼峰命名的形式访问控制器
    记一次MySQL中Waiting for table metadata lock问题的处理
    Mac下安装配置NMP环境
    Mac安装PHP(Homebrew/php弃用、其他第三方tap也已经弃用或者迁移后的安装配置方案)
    PHPStorm等编辑器debug调试(包括使用postman、soapUI)
    NoSQL数据库浅析
    PHP的抽象类和抽象方法以及接口总结
    Yii2中使用Soap WebSerivce
    Yii2之发送电子邮件
  • 原文地址:https://www.cnblogs.com/13224ACMer/p/4679501.html
Copyright © 2011-2022 走看看