网络流24题——17.运输问题

题目链接

https://www.luogu.org/problemnew/show/P4015

运输问题

S向仓库建容量为库存，费用为0的边，商店向T建容量为需求量，费用为0的边。
仓库向商店建容量为INF，费用为费用的边，跑费用流就行了。比较简单，不解释了。

#include<cstdio>
#include<algorithm>
#include<cctype>
#include<cstring>
#include<iostream>
#define LL long long
#define INF (2139062143)
#define N (205)
using namespace std;
template <typename T> void read(T&t) {
    t=0;
    bool fl=true;
    char p=getchar();
    while (!isdigit(p)) {
        if (p=='-') fl=false;
        p=getchar();
    }
    do {
        (t*=10)+=p-48;p=getchar();
    }while (isdigit(p));
    if (!fl) t=-t;
}
int n,m,S,T,x,tot,h,t,ans; 
int data[N],head[N],nxt[N*N],a[N*N],f[N*N],fare[N*N],q[N<<2],from[N],dis[N],data2[N],map[N][N];
bool vis[N];
inline void add(int x,int y,int z,int t){
    a[++tot]=y,f[tot]=z,fare[tot]=t,nxt[tot]=head[x],head[x]=tot;
}
inline int spfa(){
    h=t=0;
    memset(dis,127,sizeof(dis));
    q[++t]=S;
    vis[S]=1;
    dis[S]=0;
    while (h<t){
        int u=q[++h];
        for (int p=head[u];~p;p=nxt[p]){
            if (f[p]&&dis[u]+fare[p]<dis[a[p]]){
                dis[a[p]]=dis[u]+fare[p];
                from[a[p]]=p;
                if (!vis[a[p]]){
                    vis[a[p]]=1;
                    q[++t]=a[p];
                }
            }
        }
        vis[u]=0; 
    }
    return dis[T];
}
inline int spfa2(){
    h=t=0;
    memset(dis,-127,sizeof(dis));
    q[++t]=S;
    vis[S]=1;
    dis[S]=0;
    while (h<t){
        int u=q[++h];
        for (int p=head[u];~p;p=nxt[p]){
            if (f[p]&&dis[u]+fare[p]>dis[a[p]]){
                dis[a[p]]=dis[u]+fare[p];
                from[a[p]]=p;
                if (!vis[a[p]]){
                    vis[a[p]]=1;
                    q[++t]=a[p];
                }
            }
        }
        vis[u]=0; 
    }
    return dis[T];
}
int main(){
    read(n),read(m);
    S=n+m+1,T=n+m+2;
    tot=1;
    memset(head,-1,sizeof(head));
    for (int i=1;i<=n;i++){
        read(data[i]);
        add(S,i,data[i],0);
        add(i,S,0,0);
    }
    for (int i=1;i<=m;i++){
        read(data2[i]);
        add(i+n,T,data2[i],0);
        add(T,i+n,0,0);
    }
    for (int i=1;i<=n;i++){
        for (int j=n+1;j<=n+m;j++){
            read(map[i][j-n]);
            add(i,j,data[i],map[i][j-n]);
            add(j,i,0,-map[i][j-n]); 
        }
    }
    while (spfa()!=dis[0]){
        int maxflow=INF,now=T;
        while (now!=S){
            maxflow=min(maxflow,f[from[now]]);
            now=a[from[now]^1]; 
        } 
        ans+=maxflow*dis[T];
        now=T;
        while (now!=S){
            f[from[now]]-=maxflow;
            f[from[now]^1]+=maxflow;
            now=a[from[now]^1];
        }
    }
    printf("%d\n",ans);
    ans=0;
    tot=1;
    memset(head,-1,sizeof(head));
    for (int i=1;i<=n;i++){
        add(S,i,data[i],0);
        add(i,S,0,0);
    }
    for (int i=1;i<=m;i++){
        add(i+n,T,data2[i],0);
        add(T,i+n,0,0);
    }
    for (int i=1;i<=n;i++){
        for (int j=n+1;j<=n+m;j++){
            add(i,j,data[i],map[i][j-n]);
            add(j,i,0,-map[i][j-n]); 
        }
    }
    while (spfa2()!=dis[0]){
        int maxflow=INF,now=T;
        while (now!=S){
            maxflow=min(maxflow,f[from[now]]);
            now=a[from[now]^1]; 
        } 
        ans+=maxflow*dis[T];
        now=T;
        while (now!=S){
            f[from[now]]-=maxflow;
            f[from[now]^1]+=maxflow;
            now=a[from[now]^1];
        }
    }
    printf("%d",ans);
    return 0;
}