最大流与费用流模板

最大流

loj101 题目链接
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int mxn=20010;
int N,M,S,T,m,head[mxn],cur[mxn],gap[mxn],dep[mxn],q[mxn];
struct ed{int to,nxt,val;}edge[mxn];
void addedge(int u,int v,int w){
    edge[++M]=(ed){v,head[u],w},head[u]=M;
    edge[++M]=(ed){u,head[v],0},head[v]=M;
}
int dfs(int u,int mx){
    if (u==T) return mx;
    int num=0;
    for (int &i=cur[u],v;i;i=edge[i].nxt)
        if (dep[v=edge[i].to]==dep[u]-1&&edge[i].val){
            int f=dfs(v,min(edge[i].val,mx-num));
            edge[i].val-=f,edge[i^1].val+=f,num+=f;
            if (num==mx) return num;
        }
    if (!--gap[dep[u]++]) dep[S]=N+1;
    return ++gap[dep[u]],cur[u]=head[u],num;
}
long long solve(){
    q[1]=T,dep[T]=gap[1]=1;
    for (int hd=0,tl=1;hd<tl;){
        int u=q[++hd];
        for (int i=head[u],v;i;i=edge[i].nxt)
            if (!dep[v=edge[i].to]) dep[v]=dep[u]+1,++gap[dep[v]],q[++tl]=v;
    }
    for (int i=1;i<=N;++i) cur[i]=head[i];
    long long ans=0;
    for (;dep[S]<=N;ans+=dfs(S,0x7fffffff));
    return ans;
}
int main()
{
    scanf("%d%d%d%d",&N,&m,&S,&T),M=1;
    for (int i=1,x,y,z;i<=m;++i)
        scanf("%d%d%d",&x,&y,&z),addedge(x,y,z);
    printf("%lld\n",solve());
    return 0;
}

费用流

loj102 题目链接
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int mxn=40010,inf=2147483647;
int N,M,S,T,m,flw,sum,dst,head[mxn],vis[mxn],q[mxn];
long long dis[mxn];
struct ed{int to,nxt,val,fee;}edge[mxn];
void addedge(int u,int v,int w,int f){
    edge[++M]=(ed){v,head[u],w,f},head[u]=M;
    edge[++M]=(ed){u,head[v],0,-f},head[v]=M;
}
int dfs(int u,int mx){
    if (u==T) return sum+=dst*mx,mx;
    int num=0;
    vis[u]=1;
    for (int i=head[u],v;i;i=edge[i].nxt)
        if (edge[i].val&&!edge[i].fee&&!vis[v=edge[i].to]){
            int f=dfs(v,min(mx-num,edge[i].val));
            edge[i].val-=f,edge[i^1].val+=f,num+=f;
            if (num==mx) return vis[u]=0,num;
        }
    return num;
}
bool mdf(){
    memset(dis,0x3f,sizeof(dis));
    memset(vis,0,sizeof(vis));
    q[1]=T,dis[T]=0;
    for (int hd=0,tl=1;hd!=tl;){
        int u=q[hd=hd%N+1];
        vis[u]=0;
        for (int i=head[u],v;i;i=edge[i].nxt)
            if (edge[i^1].val&&dis[v=edge[i].to]>dis[u]-edge[i].fee){
                dis[v]=dis[u]-edge[i].fee;
                if (!vis[v]){
                    vis[v]=1;
                    if (hd!=tl&&dis[q[hd+1]]>dis[v]) q[hd]=v,hd=hd+(hd<2)*N-1;
                    else q[tl=tl%N+1]=v;
                }
            }
    }
    for (int u=1;u<=N;++u)
        for (int i=head[u];i;i=edge[i].nxt)
            edge[i].fee+=dis[edge[i].to]-dis[u];
    dst+=dis[S];
    return dis[S]<=inf;
}
void solve(){
    for (;mdf();flw+=dfs(S,inf));
}
int main()
{
    scanf("%d%d",&N,&m),S=1,T=N,M=1;
    for (int i=1,x,y,z,w;i<=m;++i)
        scanf("%d%d%d%d",&x,&y,&z,&w),addedge(x,y,z,w);
    solve();
    printf("%d %d\n",flw,sum);
    return 0;
}

转载于:https://www.cnblogs.com/zzqtxdy/p/11263745.html