大意:从1到n然后再返回到1,每条路都只能走一次,最短路是多少。
思路1:可以用费用流建图,因为起始点和终点可以走两次所以源汇点流量为2.如果能返回的话肯定flow是>=2的,才能构成回路。
思路2:我们可以先找到最短路,然后将路径上的正向权值改为inf,反向权值为原来的相反数。
#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#define inf 0x3f3f3f3f
#define LL __int64
using namespace std;
const int N = 6000;
int sum,head[N],cost,flow,cnt;
struct node{
int to,c,w,next;
}q[N];
int mp[55][55],cur[N],f[N],dis[N],a1[N/50],a2[N/50];
int st,ed,n;
bool vis[N];
void Add(int u,int v,int cap,int cost){
q[sum].to=v;
q[sum].w=cap;
q[sum].c=cost;
q[sum].next=head[u];
head[u]=sum++;
q[sum].to=u;
q[sum].w=0;
q[sum].c=-cost;
q[sum].next=head[v];
head[v]=sum++;
}
int SPFA(){
memset(vis,false,sizeof(vis));
memset(dis,inf,sizeof(dis));
queue<int>Q;
while(!Q.empty())
Q.pop();
Q.push(st);
cur[st] = -1;
f[st] = inf;
dis[st] = 0;
while(!Q.empty()){
int u = Q.front();
Q.pop();
vis[u] = false;
for(int i = head[u];~i;i=q[i].next ){
int v = q[i].to;
if(dis[v] > dis[u] + q[i].c&&q[i].w ){
dis[v] = dis[u] + q[i].c;
cur[v] = i;
f[v] = min(f[u],q[i].w);
if(!vis[v]){
vis[v] = true;
Q.push(v);
}
}
}
}
if(dis[ed] == inf)
return 0;
flow += f[ed];
cost += f[ed]*dis[ed];
for(int i = cur[ed];~i;i = cur[q[i^1].to ]){
q[i].w -= f[ed];
q[i^1].w += f[ed];
}
return 1;
}
void init(){
memset(head,-1,sizeof(head));
sum = cost = flow = cnt = 0;
}
int main(){
int m,i,j,k,cla,a,b,c;
while(~scanf("%d",&n)&&n){
init();
scanf("%d",&m);
for(i = 1;i <= m;++ i){
scanf("%d%d%d",&a,&b,&c);
Add(a,b,1,c);
Add(b,a,1,c);
}
st = 0;ed = n+1;
Add(st,1,2,0);
Add(n,ed,2,0);
while(SPFA());
if(flow < 2)
puts("Back to jail");
else
printf("%d\n",cost);
}
return 0;
}