题意:给出一个有向图,现在要选出一个或多个没有交集的环,使得所有的顶点都在这些环中,且仅出现一次,并令选中的边的权值和最小。
思路:按要求看的话, 最后选完以后,每个顶点的入度和出度都为1,也就是说每个顶点只关联两条边。把顶点拆成两个u和u‘,那么其实就是做二分匹配,并且要求完美匹配,并且权值和最小。可以用最小费用流或者KM算法求解,用最小费用流的话直接按给出的图在拆开的两组点中建边,容量为1,费用为边权,然后从源点S向每个u点添加弧,容量为1,费用为0,然后从每个u’点向汇点T添加弧,容量为1,费用为0,做最小费用流即可得到答案。。。KM算法的话要用一个比较大的数减去边权,然后再求最大权匹配。
费用流代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cmath>
#include<vector>
#define inf 0x3f3f3f3f
#define Inf 0x3FFFFFFFFFFFFFFFLL
#define eps 1e-9
#define pi acos(-1.0)
using namespace std;
typedef long long ll;
const int maxn=400+10;
const int maxm=30000+10;
struct Edge
{
int from,to,cap,flow,cost,next;
Edge(){};
Edge(int ff,int tt,int cc,int fl,int co,int nx)
{from=ff;to=tt;cap=cc;flow=fl;cost=co;next=nx;}
}edges[maxm<<1];
int head[maxn],nEdge;
int d[maxn],p[maxn],a[maxn];
bool inq[maxn];
void AddEdges(int from,int to,int cap,int cost)
{
edges[++nEdge]=Edge(from,to,cap,0,cost,head[from]);
head[from]=nEdge;
edges[++nEdge]=Edge(to,from,0,0,-cost,head[to]);
head[to]=nEdge;
}
bool spfa(int s,int t,int &flow,int &cost)
{
memset(d,0x3f,sizeof(d));
memset(inq,0,sizeof(inq));
queue<int>q;
q.push(s);
d[s]=0;a[s]=inf;p[s]=0;
while(!q.empty())
{
int u=q.front();q.pop();
inq[u]=false;
for(int k=head[u];k!=-1;k=edges[k].next)
{
Edge e=edges[k];
if(e.cap>e.flow&&d[e.to]>d[u]+e.cost)
{
d[e.to]=d[u]+e.cost;
p[e.to]=k;
a[e.to]=min(a[u],e.cap-e.flow);
if(!inq[e.to]){inq[e.to]=true;q.push(e.to);}
}
}
}
if(d[t]==inf) return false;
flow+=a[t];
cost+=a[t]*d[t];
int u=t;
while(u!=s)
{
edges[p[u]].flow+=a[t];
edges[p[u]^1].flow-=a[t];
u=edges[p[u]].from;
}
return true;
}
void mincost(int s,int t,int &flow,int &cost)
{
flow=0,cost=0;
while(spfa(s,t,flow,cost));
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t,n,m;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
memset(head,0xff,sizeof(head));
nEdge=-1;
int u,v,w;
for(int i=0;i<m;++i)
{
scanf("%d%d%d",&u,&v,&w);
AddEdges(u,v+n,1,w);
}
int S=0,T=n*2+1;
for(int i=1;i<=n;++i)
{
AddEdges(S,i,1,0);
AddEdges(i+n,T,1,0);
}
int flow,cost;
mincost(S,T,flow,cost);
printf("%d\n",cost);
}
return 0;
}
KM算法:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cmath>
#include<vector>
#define inf 0x3f3f3f3f
#define Inf 0x3FFFFFFFFFFFFFFFLL
#define eps 1e-9
#define pi acos(-1.0)
using namespace std;
typedef long long ll;
const int maxn=200+10;
const int maxv=11000;
int w[maxn][maxn],g[maxn][maxn],n,m;
int lx[maxn],ly[maxn],links[maxn],slack;
bool S[maxn],T[maxn];
bool dfs(int u)
{
S[u]=true;
int tmp,v;
for(int i=1;i<=g[u][0];++i)
{
v=g[u][i];
if(!w[u][v]) continue;
tmp=lx[u]+ly[v]-w[u][v];
if(tmp==0)
{
if(!T[v])
{
T[v]=true;
if(!links[v]||dfs(links[v]))
{
links[v]=u;
return true;
}
}
}
else slack=min(slack,tmp);
}
return false;
}
void update()
{
for(int i=1;i<=n;++i)
{
if(S[i]) lx[i]-=slack;
if(T[i]) ly[i]+=slack;
}
}
void KM()
{
memset(lx,0,sizeof(lx));
memset(ly,0,sizeof(ly));
memset(links,0,sizeof(links));
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
lx[i]=max(lx[i],w[i][j]);
for(int i=1;i<=n;++i)
{
slack=inf;
while(true)
{
memset(S,0,sizeof(S));
memset(T,0,sizeof(T));
if(dfs(i)) break;
else update();
}
}
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
memset(w,0,sizeof(w));
int a,b,c;
for(int i=0;i<m;++i)
{
scanf("%d%d%d",&a,&b,&c);
w[a][b]=max(w[a][b],maxv-c);
}
for(int i=1;i<=n;++i)
{
g[i][0]=0;
for(int j=1;j<=n;++j)
if(w[i][j]) g[i][++g[i][0]]=j;
}
KM();
int sum=0;
for(int i=1;i<=n;++i)
{
b=links[i];
sum+=(maxv-w[b][i]);
}
printf("%d\n",sum);
}
return 0;
}