poj 2351 Farm Tour (最小费用最大流）

Farm Tour

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 17230		Accepted: 6647

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

Sample Output

Source

USACO 2003 February Green

题意：n个点 m条路每条路都有一个长度现在定义从1节点出发到n节点再从n节点回1节点

这两条路不能有重边问你最短路多少

其实这可以简化成一个求做小费用的网络流，每条边的流量设为1 长度为他们的费用

自己定义一个汇点和出发点答案就是求流量为2的最小费用最大流（这题目要主要这是无向边我也不知道为什么反正没建就错了）

套个板子就可以了

 #include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<cstdlib>

 #include<string.h>

 #include<set>

 #include<vector>

 #include<queue>

 #include<stack>

 #include<map>

 #include<cmath>

 typedef long long ll;

 typedef unsigned long long LL;

 using namespace std;

 const double PI=acos(-1.0);

 const double eps=0.0000000001;

 const int INF=0x3f3f3f3f;

 const int N=+;

 int head[N];

 int dis[N];

 int pre[N];

 int vis[N];

 int tot;

 int m,n;

 struct node{

     int from,to,next,flow,cost;

 }edge[N<<];

 void init(){

     memset(head,-,sizeof(head));

     tot=;

 }

 void add(int u,int v,int c,int cost){

     edge[tot].from=u;

     edge[tot].to=v;

     edge[tot].flow=c;

     edge[tot].cost=cost;

     edge[tot].next=head[u];

     head[u]=tot++;

     edge[tot].from=v;

     edge[tot].to=u;

     edge[tot].flow=;

     edge[tot].cost=-cost;

     edge[tot].next=head[v];

     head[v]=tot++;

 }

 int spfa(int s,int t){

     memset(pre,-,sizeof(pre));

     memset(dis,INF,sizeof(dis));

     memset(vis,,sizeof(vis));

     queue<int>q;

     dis[s]=;

     vis[s]=;

     q.push(s);

     while(!q.empty()){

         int x=q.front();

         q.pop();

         vis[x]=;

         for(int i=head[x];i!=-;i=edge[i].next){

             int v=edge[i].to;

             if(edge[i].flow&&dis[v]>dis[x]+edge[i].cost){

                 dis[v]=edge[i].cost+dis[x];

                 pre[v]=i;

                 if(vis[v]==){

                     vis[v]=;

                     q.push(v);

                 }

             }

         }

     }

     if(pre[t]==-)return ;

     return ;

 }

 int MCMF(int s,int t){

     int flow=;

     int cost=;

     while(spfa(s,t)){

         int minn=INF;

         //cout<<3<<endl;

         for(int i=pre[t];i!=-;i=pre[edge[i].from]){

             minn=min(minn,edge[i].flow);

         }

         for(int i=pre[t];i!=-;i=pre[edge[i].from]){

             edge[i].flow=edge[i].flow-minn;

             edge[i^].flow=edge[i^].flow+minn;

             cost=edge[i].cost+cost;

         }

         flow=flow+minn;

         if(flow==)return cost;

     }

     return cost;

 }

 int main(){

     while(scanf("%d%d",&n,&m)!=EOF){

         init();

         add(,,,);

         add(n,n+,,);

         for(int i=;i<=m;i++){

             int u,v,cost;

             scanf("%d%d%d",&u,&v,&cost);

             add(u,v,,cost);

             add(v,u,,cost);

         }

         cout<<MCMF(,n+)<<endl;

     }

 }

巴特西

poj 2351 Farm Tour (最小费用最大流）

最新文章

热门文章