该题可转化为流量为2的最小费用流
#include<stdio.h>
#include<string.h>
#include<vector>
using namespace std;
#define MAX 1<<31-1
struct Edge
{
int to;
int cost;
int rev;
int cap;
};
vector<Edge>g[1010];
int dis[1010],n,prev[1010],pree[1010];
void addEdge(int from,int cost,int to,int cap)
{
g[from].push_back((Edge){to,cost,g[to].size(),cap});
g[to].push_back((Edge){from,-cost,g[from].size()-1,0});
}
int min_cost_flow(int s,int t,int f)
{
int u,i,v,d,res=0;
while(f>0)
{
bool update=true;
for(i=1;i<=n;i++)
dis[i]=MAX;
dis[s]=0;
while(update)
{
update=false;
for(u=1;u<=n;u++)
{
if(dis[u]==MAX)
continue;
for(i=0;i<g[u].size();i++)
{
Edge &e=g[u][i];
if(e.cap>0&&dis[e.to]>dis[u]+e.cost)
{
dis[e.to]=dis[u]+e.cost;
prev[e.to]=u;
pree[e.to]=i;
update=true;
}
}
}
}
if(dis[t]==MAX)
break;
d=MAX;
for(u=t;u!=s;u=prev[u])
{
Edge e=g[prev[u]][pree[u]];
d=min(e.cap,d);
}
for(u=t;u!=s;u=prev[u])
{
Edge &e=g[prev[u]][pree[u]];
e.cap-=d;
g[e.to][e.rev].cap+=d;
}
res+=dis[t];
f-=d;
}
return res;
}
int main()
{
int m,i,from,to,cost;
while(scanf("%d%d",&n,&m)!=EOF)
{
for(i=1;i<=n;i++)
{
g[i].clear();
}
for(i=0;i<m;i++)
{
scanf("%d%d%d",&from,&to,&cost);
addEdge(from,cost,to,1);
addEdge(to,cost,from,1);
}
int res=min_cost_flow(1,n,2);
printf("%d\n",res);
}
return 0;
}