zoukankan      html  css  js  c++  java
  • POJ 1273 Drainage Ditches 网络流 FF

    Drainage Ditches
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 74480   Accepted: 28953

    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

    代码:

    #include<iostream>
    #include<string>
    #include<algorithm>
    #include<map>
    #include<vector>
    #include<queue>
    #include<cstdlib>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    using namespace std;
    const int maxn=1005;
    const int INF=0x3f3f3f3f;
    int capacity[maxn][maxn],flow[maxn][maxn];
    int v;
    int networkflow(int source, int sink) {
        int totalflow=0;
        memset(flow,0,sizeof(flow));
        while(true) {
            vector<int> parent(maxn,-1);
            queue<int> q;
            parent[source]=source;
            q.push(source);
            while(!q.empty()) {
                int here=q.front();q.pop();
                for(int there=0;there<v;++there) {
                    if(capacity[here][there]-flow[here][there]>0&&parent[there]==-1) {
                        parent[there]=here;
                        q.push(there);
                    }
                }
            }
            if(parent[sink]==-1) break;
            int amount=INF;
            for(int p=sink;p!=source;p=parent[p]) {
                amount=min(amount,capacity[parent[p]][p]-flow[parent[p]][p]);
            }
            for(int p=sink;p!=source;p=parent[p]) {
                flow[parent[p]][p]+=amount;
                flow[p][parent[p]]-=amount;
            }
            totalflow+=amount;
        }
        return totalflow;
    }
    int main() {
        int m,n;
        while(~scanf("%d%d",&m,&n)) {
            v=n;
            memset(capacity,0,sizeof(capacity));
            for(int i=0;i<m;++i) {
                int x,y,c;
                scanf("%d%d%d",&x,&y,&c);
                capacity[x-1][y-1]+=c;
            }
            printf("%d
    ",networkflow(0,n-1));
        }
        return 0;
    }
    


  • 相关阅读:
    Python-数据结构
    优化算法-BFGS
    Sparse AutoEncoder简介
    Sparse Filtering简介
    基于受限玻尔兹曼机(RBM)的协同过滤
    Grep学习笔记
    【深度学习篇】--Windows 64下tensorflow-gpu安装到应用
    【自然语言处理篇】--聊天机器人从初始到应用
    【深度学习】--DCGAN从入门到实例应用
    【深度学习】--GAN从入门到初始
  • 原文地址:https://www.cnblogs.com/lemonbiscuit/p/7775981.html
Copyright © 2011-2022 走看看