POJ2135 Farm Tour —— 最小费用最大流

题目链接：http://poj.org/problem?id=2135

Farm Tour

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17672 Accepted: 6851

Description

When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which contains the big barn. A total M (1 <= M <= 10000) paths that connect the fields in various ways. Each path connects two different fields and has a nonzero length smaller than 35,000. 

To show off his farm in the best way, he walks a tour that starts at his house, potentially travels through some fields, and ends at the barn. Later, he returns (potentially through some fields) back to his house again. 

He wants his tour to be as short as possible, however he doesn't want to walk on any given path more than once. Calculate the shortest tour possible. FJ is sure that some tour exists for any given farm.

Input

* Line 1: Two space-separated integers: N and M. 

* Lines 2..M+1: Three space-separated integers that define a path: The starting field, the end field, and the path's length. 

Output

A single line containing the length of the shortest tour. 

Sample Input

4 51 2 12 3 13 4 11 3 22 4 2

Sample Output

6

Source

USACO 2003 February Green

题解：

把问题转化为：最小费用最大流。

1.每一条边其容量为1， 其费用为距离。

2.可知题目要求两条不同的路径，那么对于这个网络流图，就是要求：在流量为2的状态下，1到n的最小费用。

3.那么怎么转化为最小费用最大流呢？设一个超级源点和一个超级汇点。且超级源点到1的容量为2，费用为0， n到超级汇点的容量为2，费用为0；且题目说明了必定有解，那么在这个条件下求超级源点到超级汇点的最小费用最大流，最大流就只能为2了。所以最小费用即为题目所求。

代码如下：

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <vector>#include <cmath>#include <queue>#include <stack>#include <map>#include <string>#include <set>#define ms(a,b) memset((a),(b),sizeof((a)))using namespace std;typedef long long LL;const int INF = 2e9;const LL LNF = 9e18;const int mod = 1e9+7;const int MAXN = 1e3+10;struct Edge{    int to, next, cap, flow, cost;}edge[10010<<2];int tot, head[MAXN];int pre[MAXN], dis[MAXN];bool vis[MAXN];int N;void init(int n){    N = n;    tot = 0;    memset(head, -1, sizeof(head));}void add(int u, int v, int cap, int cost){    edge[tot].to = v;    edge[tot].cap = cap;    edge[tot].cost = cost;    edge[tot].flow = 0;    edge[tot].next = head[u];    head[u] = tot++;    edge[tot].to = u;    edge[tot].cap = 0;    edge[tot].cost = -cost;    edge[tot].flow = 0;    edge[tot].next = head[v];    head[v] = tot++;}bool spfa(int s, int t){    queue<int>q;    for(int i = 0; i<N; i++)    {        dis[i] = INF;        vis[i] = false;        pre[i] = -1;    }    dis[s] = 0;    vis[s] = true;    q.push(s);    while(!q.empty())    {        int u  = q.front();        q.pop();        vis[u] = false;        for(int i = head[u]; i!=-1; i = edge[i].next)        {            int v = edge[i].to;            if(edge[i].cap>edge[i].flow && dis[v]>dis[u]+edge[i].cost)            {                dis[v] = dis[u]+edge[i].cost;                pre[v] = i;                if(!vis[v])                {                    vis[v] = true;                    q.push(v);                }            }        }    }    if(pre[t]==-1) return false;    return true;}int minCostMaxFlow(int s, int t, int &cost){    int flow = 0;    cost = 0;    while(spfa(s,t))    {        int Min = INF;        for(int i = pre[t]; i!=-1; i = pre[edge[i^1].to])        {            if(Min>edge[i].cap-edge[i].flow)                Min = edge[i].cap-edge[i].flow;        }        for(int i = pre[t]; i!=-1; i = pre[edge[i^1].to])        {            edge[i].flow += Min;            edge[i^1].flow -= Min;            cost += edge[i].cost*Min;        }        flow += Min;    }    return flow;}int main(){    int n, m;    scanf("%d%d",&n,&m);    init(n+2);    for(int i = 1; i<=m; i++)    {        int u, v, c;        scanf("%d%d%d",&u,&v,&c);        add(u,v,1,c);   //双向图，容量为1，花费即为距离c        add(v,u,1,c);    }    add(0,1,2,0);   //超级源点到1的边，单向。容量为2， 花费为0    add(n, n+1, 2,0);  //n到超级汇点的边，单向。容量为2， 花费为0    int ans;    minCostMaxFlow(0,n+1,ans);    printf("%d\n", ans);    return 0;}