百练+最大流+EK算法模版

点击打开链接

//把n m弄反了，是n条边, m个顶点。
//  main.cpp
//  test
//  Created by 吴有堃 on 2017/9/11
//  Copyright © 2017年 吴有堃. All rights reserved
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <cstring>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
using namespace std;
const int N=205;
LL cap[N][N],flow[N][N],rest[N];
int snode,tnode,pre[N],vis[N];
bool BFS_Path(int m)//augmenting path
{
    memset(vis, 0, sizeof(vis));
    queue<int>Q;
    int u=0,v=0;
    u=snode; pre[u]=u;
    rest[u]=inf;vis[u]=1;
    Q.push(u);
    while (!Q.empty()) {
        u=Q.front(); Q.pop();
        for(v=1;v<=m;v++){
            if(!vis[v]&&flow[u][v]<cap[u][v]){
                pre[v]=u;vis[v]=1;
                rest[v]=min(rest[u],cap[u][v]-flow[u][v]);
                if(v==tnode) return true; // find augment path
                Q.push(v);
            }
        }
    }
    return false;
}
LL max_flow(int s, int t, int m)
{
    snode=s;tnode=t;
    LL ans=0;
    while (BFS_Path(m)) {
        ans+=rest[t];
        int v=t;
        while (v!=s) {
            int u=pre[v];
            flow[u][v]+=rest[t];
            flow[v][u]-=rest[t];
            v=u;
        }
    }
    return ans;
}
int main()
{
    int n=0,m=0,u=0,v=0;
    LL c=0;
    while (scanf("%d %d",&n,&m)!=EOF) {
        memset(cap, 0, sizeof(cap));
        memset(flow, 0, sizeof(flow));
        memset(pre, 0, sizeof(pre));
        memset(rest, 0, sizeof(rest));
        for(int i=0;i<n;i++){
            cin>>u>>v>>c;
            cap[u][v]+=c;
        }
        cout<<max_flow(1,m,m)<<endl;
    }
    return 0;
}