POJ 1273 Drainage Ditches 【费用流】

题面:

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

题目大意:

有一个有向图有n条路,m个点。每一条路都有最大承载能力。

问最多能从第一个点传递多少东西到最后一个点

大致思路:

最大流模板题,通过这个题可以较好的理解最大流算法和实现过程

关于最大流的思想参见kuangbin神犇的博客:http://www.cnblogs.com/kuangbin/archive/2011/07/26/2117636.html

代码:

#include<iostream>
#include<cstdlib>
#include<queue>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=250;
const int INF=1<<29;
int n,m,start,tar;
int g[maxn][maxn];
int path[maxn],flow[maxn];
queue<int> q;
int bfs()
{
    int u;
    while(!q.empty()) q.pop();//记得将队列清空
    memset(path,-1,sizeof(path));
    path[start]=0;
    flow[start]=INF;
    q.push(start);
    while(!q.empty())
    {
        u=q.front();
        q.pop();
        if(u==tar)
            break;
        for(int i=1;i<=m;++i){
            if(i!=start && path[i]==-1 && g[u][i]){
                //flow[i]= flow[u]<g[u][i]?flow[u]:g[u][i];
                flow[i]=min(flow[u],g[u][i]);
                q.push(i);
                path[i]=u;
            }
        }
    }
    if(path[tar]==-1)//若path[tar]未更新,则代表增广路径不存在
        return -1;
    return flow[tar];
}
int Edmonds_Karp()
{
    int max_flow=0,step,now,pre;
    while(1)
    {
        step=bfs();//每次寻找是否还有增广路径
        if(step==-1)
            break;
        max_flow+=step;
        now=tar;
        while(now!=start)
        {
            pre=path[now];
            g[pre][now]-=step;
            g[now][pre]+=step;//增加反向边
            now=pre;
        }
    }
    return max_flow;
}
int main()
{
    ios::sync_with_stdio(false);
    int u,v,l;
    //freopen("in.txt","r",stdin);
    while(cin>>n>>m)
    {
        memset(g,0,sizeof(g));
        for(int i=0;i<n;++i){
            cin>>u>>v>>l;
            g[u][v]+=l;
        }
        start=1;
        tar=m;
        cout<<Edmonds_Karp()<<endl;
    }

    return 0;
}
时间: 2024-10-06 01:35:22

POJ 1273 Drainage Ditches 【费用流】的相关文章

POJ 1273 Drainage Ditches 最大流

很裸的最大流问题,不过注意会有重边,o(╯□╰)o,被阴了WA了一发 还有就是要用long long #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <climits> #include <string> #include <iostream> #include <map> #include

poj 1273 Drainage Ditches (最大流入门)

1 /****************************************************************** 2 题目: Drainage Ditches(POJ 1273) 3 链接: http://poj.org/problem?id=1273 4 题意: 现在有m个池塘(从1到m开始编号,1为源点,m为汇点),及n条 5 水渠,给出这n条水渠所连接的池塘和所能流过的水量,求水 6 渠中所能流过的水的最大容量.水流是单向的. 7 算法: 最大流之增广路(入门)

poj 1273 Drainage Ditches 最大流入门题

题目链接:http://poj.org/problem?id=1273 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

Poj 1273 Drainage Ditches(最大流 Edmonds-Karp )

题目链接:poj1273 Drainage Ditches 呜呜,今天自学网络流,看了EK算法,学的晕晕的,留个简单模板题来作纪念... 1 #include<cstdio> 2 #include<vector> 3 #include<queue> 4 #include<cstring> 5 #include<set> 6 #include<algorithm> 7 #define CLR(a,b) memset((a),(b),si

[POJ 1273] Drainage Ditches &amp; 最大流Dinic模板

Drainage Ditches 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

poj 1273 Drainage Ditches(最大流入门)

题意:n个池塘,m条水渠,求从第一个池塘到第m个池塘能运送的最大流量: 思路:裸最大流dicnic算法.建分层图并不断找增广路,直到找不到增广路即为最大流. 邻接表实现: #include <cstdio> #include <cstring> #include <queue> using namespace std; #define MAXN 210 #define INF 0x3f3f3f3f struct Edge { int st, ed; int c; int

POJ 1273 Drainage Ditches | 最大流模板

1 #include<cstdio> 2 #include<algorithm> 3 #include<cstring> 4 #include<queue> 5 #define N 210 6 #define INF 1234567897 7 using namespace std; 8 int cnt=2,head[N],n,m,ans,lev[N]; 9 queue <int> q; 10 struct edge 11 { 12 int u,

POJ 1273 Drainage Ditches(网络流 最大流)

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

POJ 1273 Drainage Ditches (网络最大流)

http://poj.org/problem?id=1273 Drainage Ditches Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 55235   Accepted: 21104 Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means

hdu 1532 poj 1273 Drainage Ditches (最大流)

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