题意:给出N个白点和N个黑点,要求用N条不相交的线段把它们连接起来,其中每条线段恰好连接一个白点和一个黑点,每个点恰好连接到一条线段。
真的没想到还能转化为最大权匹配来做的,,太神奇了。。。
#include<iostream>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<math.h>
#define MX 310
#define eps 0.00001
#define INF 1111111111
#define mem(x,y) memset(x,y,sizeof(x))
#define FIN freopen("input.txt","r",stdin)
using namespace std;
int n;
double G[MX][MX],lx[MX],ly[MX],slack[MX];
int nx,ny,match[MX];
bool visx[MX],visy[MX];
bool isok(double a,double b)
{
return fabs(a-b)<eps;
}
bool KM_dfs(int u)
{
visx[u]=1;
for(int i=1; i<=nx; i++)
{
if(isok(lx[u]+ly[i],G[u][i])&&!visy[i])
{
visy[i]=1;
if(match[i]==-1||KM_dfs(match[i]))
{
match[i]=u;
return 1;
}
}
else if(!isok(lx[u]+ly[i],G[u][i]))slack[i]=min(slack[i],lx[u]+ly[i]-G[u][i]);
}
return 0;
}
double KM()
{
mem(ly,0);
mem(match,-1);
for(int i=1; i<=nx; i++)
{
lx[i]=-INF;
for(int j=1; j<=ny; j++)lx[i]=max(lx[i],G[i][j]);
}
for(int i=1; i<=nx; i++)
{
for(int j=1; j<=ny; j++) slack[j]=INF;
while(1)
{
mem(visx,0);
mem(visy,0);
if(KM_dfs(i)) break;
else
{
double d=INF;
for(int i=1; i<=ny; i++) if(!visy[i]) d=min(d,slack[i]);
for(int i=1; i<=nx; i++) if(visx[i])lx[i]-=d;
for(int i=1; i<=ny; i++) if(visy[i])ly[i]+=d;
else slack[i]-=d;
}
}
}
double ans=0;
for(int i=1; i<=ny; i++) ans+=match[i]==-1?0:G[match[i]][i];
return ans;
}
int xb[MX],yb[MX],xw[MX],yw[MX];
int main()
{
//FIN;
while(~scanf("%d",&n))
{
for(int i=1; i<=n; i++) scanf("%d%d",&xw[i],&yw[i]);
for(int i=1; i<=n; i++) scanf("%d%d",&xb[i],&yb[i]);
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++) G[i][j]=-sqrt(1.0*(xw[j]-xb[i])*(xw[j]-xb[i])+(yw[j]-yb[i])*(yw[j]-yb[i]));
nx=ny=n;
KM();
for(int i=1; i<=ny; i++) printf("%d\n",match[i]);
}
return 0;
}