POJ 2135 最小费用流

可以把每个点都当作一个节点，去一次再回来一次可以等价为从完全不同（没有共用边）的两条路径上走过去，所以如果两点之间有一条路的话，我们就为他添加两条边，一条正向一条反向（因为是无向图，即使只考虑去的情况也要加两条边，保证正反都可以走，但是事实上只会走一条边，因为如果这条边正反都要走一遍的话，那一定是不走路程最小），容量设为1（只能走一遍），权值设为路的长度，然后从起点s到点1连一条边，容量为2，再从n节点到终点t连一条边，容量也为2，然后求最小费用流。

#include<iostream>
#include<math.h>
#include<iomanip>
#include <string>
#include <cstdio>
#include<stdio.h>
#include <cstring>
#include <algorithm>
#include <queue>
#include<vector>
#define INF 0x3f3f3f3f
#define N 1010
#define ll long long
using namespace std;int stop;
struct Edge{
    int from,to,cap,flow,cost;
    Edge(int a=0,int b=0,int c=0, int d=0,int e = 0){
        from = a,to = b,cap = c,flow = d,cost = e;
    }
};
vector<Edge>edges;
vector<int>G[N];
int n,m,s,t;
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));
    int m = edges.size();
    G[from].push_back(m-2);
    G[to].push_back(m-1);
}
bool inq[N];
int dis[N],pre[N],a[N];

void init(){
    for(int i=s;i<=t;i++){
        G[i].clear();
    }
    edges.clear();
}

bool spfa(int &flow,ll &cost){
    memset(dis,0x3f,sizeof(dis));
    memset(inq,0,sizeof(inq));
    dis[s] = 0;inq[s] = 1;pre[s] = 0;a[s] = INF;//pre用来保存到达该节点的弧
    queue<int>Q;
    Q.push(s);
    int u;
    while (!Q.empty())
    {
        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 && dis[e.to] > dis[u] + e.cost){
                dis[e.to] = dis[u] + e.cost;
                pre[e.to] = G[u][i];
                a[e.to] = min(a[u],e.cap - e.flow);
                if(!inq[e.to]){
                    inq[e.to] = 1;
                    Q.push(e.to);
                }
            }
        }
    }
    if(dis[t] == INF){
        return 0;
    }
    u = t;
    flow += a[t];
    cost += dis[t]*a[t];
    while (u != s)
    {
        edges[pre[u]].flow += a[t];
        edges[pre[u]^1].flow -= a[t];
        u = edges[pre[u]].from;
    }
    return true;
}

ll Mincost(){
    int flow = 0;
    ll cost = 0;
    while (spfa(flow,cost));
    return cost;
}
int main()
{
    int i,j,k,x,y,z;
    scanf("%d%d",&n,&m);
    s=0,t = n+1;
    init();
    for(i=1;i<=m;i++){
        scanf("%d%d%d",&x,&y,&z);
        addedge(x,y,1,z);
        addedge(y,x,1,z);
    }
    addedge(0,1,2,0);
    addedge(n,n+1,2,0);
    ll p = Mincost();
    printf("%lld\n",p);
    return 0;
}