UVA 10888 - Warehouse（最小费用流）

题目链接：点击打开链接

思路：

乍看该题， 很明显是个匹配问题， 但是难点在于， 你把一个箱子移动到仓库的路径上有可能存在其他箱子。

但是再仔细一想， 假设A到B的路上有个C， 那么我们可以看作是A移动到C， 然后把C移动到B， 所以这种情况是不影响答案的。

细节参见代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <ctime>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
using namespace std;
typedef long long ll;
typedef long double ld;
const double eps = 1e-6;
const double PI = acos(-1);
const int mod = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
// & 0x7FFFFFFF
const int seed = 131;
const ll INF64 = ll(1e18);
const int maxn = 1600 + 10;
struct Edge {
  int from, to, cap, flow, cost;
};
struct MCMF {
  int n, m, s, t;
  vector<Edge> edges;
  vector<int> G[maxn];
  int inq[maxn];         // 是否在队列中
  int d[maxn];           // Bellman-Ford
  int p[maxn];           // 上一条弧
  int a[maxn];           // 可改进量

  void init(int n) {
    this->n = n;
    for(int i = 0; i < n; i++) G[i].clear();
    edges.clear();
  }

  void AddEdge(int from, int to, int cap, int cost) {
    edges.push_back((Edge){from, to, cap, 0, cost});
    edges.push_back((Edge){to, from, 0, 0, -cost});
    m = edges.size();
    G[from].push_back(m-2);
    G[to].push_back(m-1);
  }

  bool BellmanFord(int s, int t, int& flow, int& cost) {
    for(int i = 0; i < n; i++) d[i] = INF;
    memset(inq, 0, sizeof(inq));
    d[s] = 0; inq[s] = 1; p[s] = 0; a[s] = INF;

    queue<int> Q;
    Q.push(s);
    while(!Q.empty()) {
      int u = Q.front(); Q.pop();
      inq[u] = 0;
      for(int i = 0; i < G[u].size(); i++) {
        Edge& e = edges[G[u][i]];
        if(e.cap > e.flow && d[e.to] > d[u] + e.cost) {
          d[e.to] = d[u] + e.cost;
          p[e.to] = G[u][i];
          a[e.to] = min(a[u], e.cap - e.flow);
          if(!inq[e.to]) { Q.push(e.to); inq[e.to] = 1; }
        }
      }
    }
    if(d[t] == INF) return false;
    flow += a[t];
    cost += d[t] * a[t];
    int u = t;
    while(u != s) {
      edges[p[u]].flow += a[t];
      edges[p[u]^1].flow -= a[t];
      u = edges[p[u]].from;
    }
    return true;
  }
  // 需要保证初始网络中没有负权圈
  int Mincost(int s, int t) {
    int cost = 0, flow = 0;
    while(BellmanFord(s, t, flow, cost));
    return cost;
  }

};
struct node {
    int x, y;
    node(int x=0, int y=0):x(x), y(y) {}
};
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
MCMF g;
int d[44][44];
int n, m, T;
char s[44][44];
void BFS(int r, int c) {
    memset(d, -1, sizeof(d));
    d[r][c] = 0;
    queue<node> q;
    q.push(node(r, c));
    while(!q.empty()) {
        node u = q.front(); q.pop();
        for(int i = 0; i < 4; i++) {
            int x = u.x + dx[i];
            int y = u.y + dy[i];
            if(x < 1 || x > n || y < 1 || y > m || s[x][y] == '#') continue;
            if(d[x][y] == -1) {
                d[x][y] = d[u.x][u.y] + 1;
                q.push(node(x, y));
            }
        }
    }
}
inline int get_id(int r, int c) {
    return (r-1)*m + c;
}
int main() {
    scanf("%d",&T);
    while(T--) {
        scanf("%d%d",&n,&m);
        for(int i = 1; i <= n; i++) {
            scanf("%s", s[i]+1);
        }
        g.init(n*m + 5);
        int sor = 0, toa = n*m+1;
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= m; j++) {
                if(s[i][j] == 'B') {
                    BFS(i, j);
                    int id1 = get_id(i, j);
                    g.AddEdge(0, id1, 1, 0);
                    for(int l = 1; l <= n; l++) {
                        for(int r = 1; r <= m; r++) {
                            if(s[l][r] == 'X') {
                                int id2 = get_id(l, r);
                                if(d[l][r] == -1) d[l][r] = INF;
                                g.AddEdge(id1, id2, 1, d[l][r]);
                            }
                        }
                    }
                }
                else if(s[i][j] == 'X') {
                    int id1 = get_id(i, j);
                    g.AddEdge(id1, toa, 1, 0);
                }
            }
        }
        int ans = g.Mincost(sor, toa);
        cout<<ans<<endl;
    }
    return 0;
}