题意:给你N个城市,M条路,问怎么走,可以走完所有的城市并且费用最少,每条路必须是环路才能走。
思路:这道题可以说是KM算法的入门题了。我用费用流来实现了一下。速度比KM慢了不只一点点。。
建图:将每个人拆成两点,S -> i -> i + n -> T 。
S -> i ,费用0 ,容量1 .
i -> i + n ,费用为输入值,容量1 .
i + n -> T ,费用0,容量1.
//NetWork Flows
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <stack>
#include <map>
#include <iomanip>
#define PI acos(-1.0)
#define Max 2505
#define inf 1<<28
#define LL(x) (x<<1)
#define RR(x) (x<<1|1)
#define REP(i,s,t) for(int i=(s);i<=(t);++i)
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
#define mp(a,b) make_pair(a,b)
using namespace std;
struct kdq
{
int s , e , l ,next ;
int c ;
} ed[Max * 100] ;
int head[Max] ,num ;
int deep[Max] ;
int S,T ;
int qe[Max * 100] ;
/***Insert Edge***/
void add(int s ,int e ,int l,int c)
{
ed[num].s = s ;
ed[num].e = e ;
ed[num].l = l ;
ed[num].c = c ;
ed[num].next = head[s] ;
head[s] = num ++ ;
ed[num].s = e ;
ed[num].e = s ;
ed[num].l = 0 ;
ed[num].c = -c ;
ed[num].next = head[e] ;
head[e] = num ++ ;
}
/***Init***/
void init()
{
mem(head,-1) ;
num = 0 ;
}
/***InPut***/
inline void readint(int &ret)
{
char c;
do
{
c = getchar();
}
while(c < '0' || c > '9');
ret = c - '0';
while((c=getchar()) >= '0' && c <= '9')
ret = ret * 10 + ( c - '0' );
}
int dis[Max] ;
bool vis[Max] ;
int pre[Max] ;
int path[Max] ;
/***SPFA***/
int spfa(int n)
{
REP(i,0,2 * n + 1)dis[i] = inf ,vis[i] = 0 ,pre[i] = -1 ;
dis[S] = 0 ;
vis[S] = 1 ;
int h = 0 ,t = 0 ;
qe[ h ++ ] = S ;
while( h > t )
{
int tt = qe[t ++ ] ;
vis[tt] = 0 ;
for (int i = head[tt] ; ~i ; i = ed[i].next )
{
int e = ed[i].e ;
int l = ed[i].l ;
int c = ed[i].c ;
if(l > 0 && dis[e] > dis[tt] + c )
{
pre[e] = tt ;
path[e] = i ;
dis[e] = dis[tt] + c ;
if(!vis[e])
{
vis[e] = 1 ;
qe[h ++ ] = e ;
}
}
}
}
return dis[T] != inf ;
}
/***MFMC***/
int MFMC(int n)
{
int mincost = 0 ;
while(spfa(n))
{
int flow = inf ;
for (int i = T ; i != S ;i = pre[i])
flow = min(flow , ed[path[i]].l) ;
for (int i = T ; i != S ;i = pre[i])
ed[path[i]].l -= flow ,ed[path[i] ^ 1].l += flow ;
mincost += dis[T] ;
}
return mincost ;
}
int main()
{
int t ;
readint(t) ;
while( t -- )
{
init() ;
int n , m ;
readint(n) ;
readint(m) ;
S = 0 ,T = 2 * n + 1 ;
while( m -- )
{
int a , b , c ;
readint(a) ;
readint(b) ;
readint(c) ;
add(a,b + n ,1 ,c) ;
}
REP(i,1,n)add(S,i,1,0),add(i + n,T,1,0) ;
printf("%d\n",MFMC(n)) ;
}
return 0;
}