UVa 1658 Admiral （最小费用最大流、拆点法）

题目链接：http://vjudge.net/problem/UVA-1658

题意：给出n个点m条边，求1-n的两条不相交的路径（除1和n外，每个点仅经过一次），使得路径总权值最小。

思路：除起点终点外，每个点仅经过一次，这就限制了结点的经过次数。为了达到这个效果，我们把除起点终点外每个点u拆成u和u'，中间连一条容量为1、费用为0的弧，这样原来u-v的弧就变成了u-u'-v，由于每条弧的容量为1，这就限制了结点的经过次数。最后，求从1-n的流量为2的最小费用最大流即可，怎样让流量为2呢，可以建一个源点，向起点连一条弧，容量为2，费用为0，再求从源点到n的最小费用最大流即可。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<vector>
#include<map>
#include<queue>
using namespace std;
struct Edge {
   int from, to, cap, flow, cost;
   Edge(int u, int v, int c, int f, int w):from(u),to(v),cap(c),flow(f),cost(w){}
};

const int maxn = 2000 + 10;
const int INF = 1e8 + 10;

struct MCMF {
   int n, m;
   vector<Edge> edges;
   vector<int> G[maxn];
   int inq[maxn];
   int d[maxn], p[maxn], 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, long long& 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 += (long long)d[t] * (long long)a[t];
      for(int u = t; u != s; u = edges[p[u]].from) {
         edges[p[u]].flow += a[t];
         edges[p[u]^1].flow -= a[t];
      }
      return true;
   }
   int MincostMaxflow(int s, int t, long long& cost) {
      int flow = 0; cost = 0;
      while(BellmanFord(s, t, flow, cost));
      return flow;
   }
}My;

int main()
{
    int n, m;
    while(scanf("%d%d",&n,&m) == 2) {
       My.init(2*n+1);
       for(int i = 1; i <= m; i++) {
          int u, v, c;
          scanf("%d%d%d",&u, &v, &c);
          //偶数代表u，奇数代表u'
          int u_ = ((u == 1 || u == n) ? 2*u :2*u+1);
          int v_ = 2*v;
          My.AddEdge(u_, v_, 1, c);
       }
       for(int i = 2; i <= n-1; i++) My.AddEdge(2*i, 2*i+1, 1, 0);
       My.AddEdge(0, 2, 2, 0);
       long long cost;
       My.MincostMaxflow(0, 2*n, cost);
       printf("%lld\n", cost);
    }
    return 0;
}