[BZOJ2539][Ctsc2000]丘比特的烦恼（KM+计算几何）

题目描述

传送门

题目大意：这题说了题目大意就没意思了。

题解

KM裸题（笑
http://www.lydsy.com/JudgeOnline/wttl/thread.php?tid=4169

代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<map>
using namespace std;
#define N 40
#define inf 1000000000

double k;
int n,val,mak,ans;
string name,s1,s2;
map <string,int> boy,girl,type;
int e[N][N],ex[N],ey[N],visx[N],visy[N],linky[N],lak[N];

const double eps=1e-9;
int dcmp(double x)
{
    if (x<=eps&&x>=-eps) return 0;
    return (x>0)?1:-1;
}
struct Vector
{
    double x,y;
    Vector(double X=0,double Y=0)
    {
        x=X,y=Y;
    }
};
typedef Vector Point;
Vector operator - (Vector a,Vector b) {return Vector(a.x-b.x,a.y-b.y);}
bool operator == (Vector a,Vector b) {return a.x==b.x&&a.y==b.y;}
Point b[N],g[N];

double Dot(Vector a,Vector b)
{
    return a.x*b.x+a.y*b.y;
}
double Len(Vector a)
{
    return sqrt(a.x*a.x+a.y*a.y);
}
double Cross(Vector a,Vector b)
{
    return a.x*b.y-a.y*b.x;
}
double DisTS(Point P,Point A,Point B)
{
    if (A==B) return Len(P-A);
    Vector v=B-A,w=P-A,u=P-B;
    if (dcmp(Dot(v,w))<0) return Len(w);
    else if (dcmp(Dot(v,u))>0) return Len(u);
    else return fabs(Cross(v,w)/Len(v));
}
bool check(int id,int jd)
{
    Point A=b[id],B=g[jd];
    if (dcmp(Len(B-A)-k)>0) return 0;
    for (int i=1;i<=n;++i)
        if (i!=id)
            if (dcmp(DisTS(b[i],A,B))==0) return 0;
    for (int i=1;i<=n;++i)
        if (i!=jd)
            if (dcmp(DisTS(g[i],A,B))==0) return 0;
    return 1;
}

bool find(int x,int mak)
{
    visx[x]=mak;
    for (int i=1;i<=n;++i)
        if (visy[i]!=mak)
        {
            int tmp=ex[x]+ey[i]-e[x][i];
            if (!tmp)
            {
                visy[i]=mak;
                if (linky[i]==-1||find(linky[i],mak))
                {
                    linky[i]=x;
                    return 1;
                }
            }
            else lak[i]=min(lak[i],tmp);
        }
    return 0;
}
int KM()
{
    for (int i=1;i<=n;++i)
    {
        ex[i]=-inf;
        for (int j=1;j<=n;++j)
            ex[i]=max(ex[i],e[i][j]);
    }
    memset(linky,-1,sizeof(linky));
    for (int i=1;i<=n;++i)
    {
        for (int j=1;j<=n;++j) lak[j]=inf;
        while (1)
        {
            ++mak;
            if (find(i,mak)) break;
            int tmp=inf;
            for (int k=1;k<=n;++k)
                if (visy[k]!=mak) tmp=min(tmp,lak[k]);
            for (int k=1;k<=n;++k)
            {
                if (visx[k]==mak) ex[k]-=tmp;
                if (visy[k]==mak) ey[k]+=tmp;
                else lak[k]-=tmp;
            }
        }
    }
    int sum=0;
    for (int i=1;i<=n;++i)
        if (linky[i]!=-1)
            sum+=e[linky[i]][i];
    return sum;
}
int main()
{
    cin>>k>>n;
    for (int i=1;i<=n;++i)
    {
        cin>>b[i].x>>b[i].y>>name;
        int len=name.length();
        for (int j=0;j<len;++j)
            if (name[j]>='A'&&name[j]<='Z') name[j]+=32;
        boy[name]=i;type[name]=1;
    }
    for (int i=1;i<=n;++i)
    {
        cin>>g[i].x>>g[i].y>>name;
        int len=name.length();
        for (int j=0;j<len;++j)
            if (name[j]>='A'&&name[j]<='Z') name[j]+=32;
        girl[name]=i;type[name]=2;
    }
    for (int i=1;i<=n;++i)
        for (int j=1;j<=n;++j) e[i][j]=-inf;
    while (1)
    {
        cin>>s1;int len=s1.length();
        if (s1[0]=='E'&&s1[1]=='n'&&s1[2]=='d'&&len==3) break;
        cin>>s2>>val;
        for (int j=0;j<len;++j)
            if (s1[j]>='A'&&s1[j]<='Z') s1[j]+=32;
        len=s2.length();
        for (int j=0;j<len;++j)
            if (s2[j]>='A'&&s2[j]<='Z') s2[j]+=32;
        if (type[s1]>type[s2]) swap(s1,s2);
        int x=boy[s1],y=girl[s2];
        if (check(x,y)) e[x][y]=val;
    }
    for (int i=1;i<=n;++i)
        for (int j=1;j<=n;++j)
            if (i!=j&&check(i,j)) e[i][j]=max(e[i][j],1);
    ans=KM();
    printf("%d\n",ans);
}