POJ 1273 两种基本最大流算法

Drainage Ditches
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 69903 Accepted: 27110
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

http://poj.org/problem?id=1273


//Edmonds-Karp算法: O(点数*边数*边数)

#include <stdio.h>
#include <string>
#include <cstring>
#include <queue>
#include <algorithm>
#include <functional>
#include <vector>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <sstream>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
const int MAX=205;
int Dis[MAX][MAX],Pre[MAX],N,M;
bool Visited[MAX];
int Augment()
{
    deque<int> que;
    bool FindPath=false;
    memset(Pre,0,sizeof(Pre));
    memset(Visited,false,sizeof(Visited));
    Pre[1]=0,Visited[1]=true;
    que.push_back(1);
    while (!que.empty())
    {
        int u=que.front();
        que.pop_front();
        for (int i=1;i<=M;i++)
        {
            if (Dis[u][i]>0&&!Visited[i])
            {
                Pre[i]=u,Visited[i]=true;
                if (i==M)
                {
                    FindPath=true;
                    que.clear();
                    break;
                }
                else
                    que.push_back(i);
            }
        }
    }
    if (!FindPath)
        return 0;
    int MinFlow=999999999;
    int u=M;
    while (Pre[u])
    {
        MinFlow=min(MinFlow,Dis[Pre[u]][u]);
        u=Pre[u];
    }
    u=M;
    while (Pre[u])
    {
        Dis[Pre[u]][u]-=MinFlow;
        Dis[u][Pre[u]]+=MinFlow;
        u=Pre[u];
    }
    return MinFlow;
}
int main()
{
    int a,b,c;
    cin.sync_with_stdio(false);
    while (cin>>N>>M)
    {
        memset(Dis,0,sizeof(Dis));
        for (int i=0;i<N;i++)
        {
            cin>>a>>b>>c;
            Dis[a][b]+=c;
        }
        int Ans=0,temp=0;
        while (temp=Augment())
            Ans+=temp;
        cout<<Ans<<endl;
    }
    return 0;
}




//Dinic算法: O(点数*点数*边数)



#include <stdio.h>
#include <string>
#include <cstring>
#include <queue>
#include <algorithm>
#include <functional>
#include <vector>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <sstream>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
const int MAX=205;
int Dis[MAX][MAX],Layer[MAX],N,M;
bool Visited[MAX];
bool CountLayer()
{
    deque<int> que;
    memset(Layer,-1,sizeof(Layer));
    Layer[1]=0;
    que.push_back(1);
    while (!que.empty())
    {
        int u=que.front();
        que.pop_front();
        for (int i=1; i<=M; i++)
            if (Dis[u][i]>0&&Layer[i]==-1)
            {
                Layer[i]=Layer[u]+1;
                if (i==M)
                    return true;
                else
                    que.push_back(i);
            }
    }
    return false;
}
int Dinic()
{
    int Ans=0;
    deque<int> que;
    while (CountLayer())
    {
        que.push_back(1);
        memset(Visited,false,sizeof(Visited));
        Visited[1]=true;
        while (!que.empty())
        {
            int u=que.back();
            if (u==M)
            {
                int MinFlow=999999999,MinFlowStart;
                for (int i=1; i<(int)que.size(); i++)
                {
                    int S=que[i-1],E=que[i];
                    if (Dis[S][E]>0)
                        if (MinFlow>Dis[S][E])
                            MinFlow=Dis[S][E],MinFlowStart=S;
                }
                Ans+=MinFlow;
                for (int i=1; i<(int)que.size(); i++)
                {
                    int S=que[i-1],E=que[i];
                    Dis[S][E]-=MinFlow,Dis[E][S]+=MinFlow;
                }
                while (!que.empty()&&que.back()!=MinFlowStart)
                {
                    Visited[que.back()]=false;
                    que.pop_back();
                }
            }
            else
            {
                int i;
                for (i=1; i<=M; i++)
                    if (Dis[u][i]>0&&Layer[i]==Layer[u]+1&&!Visited[i])
                    {
                        Visited[i]=true;
                        que.push_back(i);
                        break;
                    }
                if (i>M)
                    que.pop_back();
            }
        }
    }
    return Ans;
}
int main()
{
    int a,b,c;
    cin.sync_with_stdio(false);
    while (cin>>N>>M)
    {
        memset(Dis,0,sizeof(Dis));
        for (int i=0; i<N; i++)
        {
            cin>>a>>b>>c;
            Dis[a][b]+=c;
        }
        cout<<Dinic()<<endl;
    }
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值