【loj】#6011. 「网络流 24 题」运输问题(最小费用流)

记录一个菜逼的成长。。

题目链接

这题的建边比较直观。
分别要求最小和最大费用，只要把仓库到商店的费用变负就可求最大。

#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for( int i = l; i <= r; i++ )
#define rep0(i,l,r) for( int i = l; i < r; i++ )
#define ALL(v) (v).begin(),(v).end()
#define cl(a,b) memset(a,b,sizeof(a))
#define clr clear()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const int INF = 0x3f3f3f3f;
const int MAX_V = 1000 + 10;
struct edge{
    int to,cap,cost,rev;
    edge(){}
    edge(int _to,int _cap,int _cost,int _rev):to(_to),cap(_cap),cost(_cost),rev(_rev){}
};
int V;                  //顶点数
vector<edge>G[MAX_V];   //图的邻接表示
int prevv[MAX_V],preve[MAX_V];//最短路中的前驱节点和对应的边
int dist[MAX_V];        //最短距离
void add(int from,int to,int cap,int cost)
{
    G[from].push_back(edge(to,cap,cost,G[to].size()));
    G[to].push_back(edge(from,0,-cost,G[from].size() - 1));
}
//求解从s到t流量为f的最小费用流
//如果不能再增广则返回-1
int min_cost_flow(int s,int t,int f)
{
    int res = 0;
    while(f > 0){
        //利用Bellman-Ford算法求s到t的最短路
        fill(dist,dist+V,INF);
        dist[s] = 0;
        bool update = true;
        while(update){
            update = false;
            for( int v = 0; v < V; v++ ){
                if(dist[v] == INF)continue;
                for( int i = 0; i < G[v].size(); i++ ){
                    edge &e = G[v][i];
                    if(e.cap > 0 && dist[e.to] > dist[v] + e.cost){
                        dist[e.to] = dist[v] + e.cost;
                        prevv[e.to] = v;
                        preve[e.to] = i;
                        update = true;
                    }
                }
            }
        }
        if(dist[t] == INF){
            //不能再增广
            return -1;
        }
        //沿s到t的最短路尽量增广
        int d = f;
        for( int v = t; v != s; v = prevv[v] ){
            d = min(d,G[prevv[v]][preve[v]].cap);
        }
        f -= d;
        res += d * dist[t];
        for( int v = t; v != s; v = prevv[v]){
            edge &e = G[prevv[v]][preve[v]];
            e.cap -= d;
            G[v][e.rev].cap += d;
        }
    }
    return res;
}
int a[MAX_V],b[MAX_V],c[MAX_V][MAX_V],n,m;
void solve(int d)
{
  int s = 0,t = n + m + 1;
  int sum = 0;V = t + 1;
  rep(i,0,t)G[i].clr;
  rep(i,1,n){
    add(s,i,a[i],0);
    sum += a[i];
  }
  rep(i,1,m){
    add(i+n,t,b[i],0);
  }
  rep(i,1,n){
    rep(j,1,m){
      add(i,j+n,INF,d*c[i][j]);
    }
  }
  printf("%d\n",min_cost_flow(s,t,sum)*d);
}
int main()
{
  scanf("%d%d",&n,&m);
  rep(i,1,n){
    scanf("%d",&a[i]);
  }
  rep(i,1,m){
    scanf("%d",&b[i]);
  }
  rep(i,1,n){
    rep(j,1,m){
      scanf("%d",&c[i][j]);
    }
  }
  solve(1);
  solve(-1);
  return 0;
}