POJ 2135 Farm Tour | 费用流

最小费用流

题意：

从点1出发到点n，再从点n回到点1。 边为无向边，并且走过的边不能再走。

输出最短路径的和。

思路：

与HDU 2686一样，把回程反过来想。再从点1发出一点流量到达点n，结果就变成找出两条从点1到达点n的最小路径。

流量固定为两点。

建图：

点与点：费用根据输入，容量为1（注意：无向边）

源汇细节自行思考。

AC代码：

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;

#define debug cout<<"??"<<endl;
const int MAXN = 1005;
const int MAXEDGE= 1e5 + 5;
const int INF = 0x3f3f3f3f;
int n, m;
struct CEdge
{
        int from, to, cap, flow, cost, next;
}edge[MAXEDGE];
struct CMCMF
{
        int s, t, pp;
        int head[MAXN], a[MAXN], d[MAXN], p[MAXN];
        bool inq[MAXN];
        CMCMF(int ss, int tt)
        {
                s = ss, t = tt;
                pp = 0;
                memset(head, -1, sizeof(head));
        }
        void addEdge(int u, int v, int cap, int cost)
        {
                edge[pp] = (CEdge){u, v, cap, 0, cost, head[u]};
                head[u] = pp++;
                edge[pp] = (CEdge){v, u, 0, 0, -cost, head[v]};
                head[v] = pp++;
        }
        bool bellmanFord(int &flow, int &cost)
        {
                memset(d, INF, sizeof(d));
                memset(inq, false, sizeof(inq));
                queue <int> q;
                q.push(s), inq[s] = true;
                a[s] = INF, d[s] = 0, p[s] = -1;
                while(!q.empty())
                {
                        int u = q.front();
                        q.pop(), inq[u] = false;
                        int next = head[u];
                        while(next != -1)
                        {
                                CEdge &e = edge[next];
                                if(e.cap > e.flow && d[e.to] > d[u] + e.cost)
                                {
                                        d[e.to] = d[u] + e.cost;
                                        a[e.to] = min(a[u], e.cap - e.flow);
                                        p[e.to] = next;
                                        if(!inq[e.to])  inq[e.to] = true, q.push(e.to);
                                }
                                next = e.next;
                        }
                }
                if(d[t] == INF) return false;
                cost += d[t] * a[t];
                flow += a[t];
                int u = t;
                while(u != s)
                {
                        edge[p[u]].flow += a[t];
                        edge[p[u]^1].flow -= a[t];
                        u = edge[p[u]].from;
                }
                return true;
        }
};
int main()
{
        while(scanf("%d%d",&n, &m) != EOF)
        {
                int s = 1, t = n+1;
                CMCMF mcmf(s, t);
                {
                        int u, v, cost;
                for(int i = 0;i < m; i++)
                {
                        scanf("%d%d%d", &u, &v, &cost);
                        mcmf.addEdge(u, v, 1, cost);
                        mcmf.addEdge(v, u, 1, cost);
                }
                }
                mcmf.addEdge(n, n+1, 2, 0);
                int flow = 0, cost = 0;
                while(mcmf.bellmanFord(flow, cost));
                cout<<cost<<endl;
        }
        return 0;
}