P4015 运输问题

题目链接

---

题解：
简单的费用流，设置超级源点连接仓库，边权为a[i]，费用为0，超级汇点连接商店，边权为b[i]，费用为0，然后中间的仓库和商店直接连就行，边权INF，费用Cij，跑两次费用流就OK了

---

AC代码：

#pragma GCC optimize(2)
#include<bits/stdc++.h>
#include<ext/rope>
using namespace std;
using namespace __gnu_cxx;
#define LL long long
const int MAXN = 2000+50;
const int MAXM = 2e6+50;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
int m,n,s,t,tot=1,head[MAXN],to[MAXM],w[MAXM],nxt[MAXM],co[MAXM];
int pre[MAXN],dis[MAXN],vis[MAXN],flow[MAXN],a[MAXN],b[MAXN];
inline void ade(int u,int v,int ww,int cost){
    to[++tot]=v; w[tot]=ww; co[tot]=cost; nxt[tot]=head[u]; head[u]=tot;
}
inline void add(int u,int v,int w,int cost){ ade(u,v,w,cost); ade(v,u,0,-cost); }
inline int spfa_min(){
    for(int i=0;i<=t;i++) dis[i]=INF;
    queue<int> que; que.push(s); dis[s]=0; vis[s]=1; flow[s]=INF;
    while(!que.empty()){
        int u=que.front(); que.pop(); vis[u]=0;
        for(int i=head[u];i;i=nxt[i]){
            if(w[i] && dis[to[i]]>dis[u]+co[i]){
                dis[to[i]]=dis[u]+co[i]; pre[to[i]]=i;
                flow[to[i]]=min(flow[u],w[i]);
                if(!vis[to[i]]) vis[to[i]]=1,que.push(to[i]);
            }
        }
    }
    return dis[t]!=INF;
}
inline int spfa_max(){
    for(int i=0;i<=t;i++) dis[i]=-INF;
    queue<int> que; que.push(s); dis[s]=0; vis[s]=1; flow[s]=INF;
    while(!que.empty()){
        int u=que.front(); que.pop(); vis[u]=0;
        for(int i=head[u];i;i=nxt[i]){
            if(w[i] && dis[to[i]]<dis[u]+co[i]){
                dis[to[i]]=dis[u]+co[i]; pre[to[i]]=i;
                flow[to[i]]=min(flow[u],w[i]);
                if(!vis[to[i]]) vis[to[i]]=1,que.push(to[i]);
            }
        }
    }
    return dis[t]!=-INF;
}
signed main(){
#ifndef ONLINE_JUDGE
    freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin);
#endif // ONLINE_JUDGE
    scanf("%d%d",&m,&n); s=0,t=n+m+1;
    for(int i=1;i<=m;i++) scanf("%d",&a[i]);
    for(int i=1;i<=n;i++) scanf("%d",&b[i]);
    for(int i=1;i<=m;i++) add(s,i,a[i],0);
    for(int i=1;i<=n;i++) add(i+m,t,b[i],0);
    for(int i=1;i<=m;i++){
        for(int j=1,x;j<=n;j++){
            scanf("%d",&x),add(i,j+m,INF,x);
        }
    }
    int res_min=0,res_max=0;
    while(spfa_min()){
        res_min+=flow[t]*dis[t]; int x=t;
        while(x!=s){
            int i=pre[x];
            w[i]-=flow[t]; w[i^1]+=flow[t]; x=to[i^1];
        }
    }
    for(int i=2;i<=tot;i+=2) w[i]+=w[i^1],w[i^1]=0;
    while(spfa_max()){
        res_max+=flow[t]*dis[t]; int x=t;
        while(x!=s){
            int i=pre[x];
            w[i]-=flow[t]; w[i^1]+=flow[t]; x=to[i^1];
        }
    }
    printf("%d\n%d\n",res_min,res_max);
    return 0;
}