Gopher II
二分图匹配/最大流算法均可以.
#include<bits/stdc++.h>
using namespace std;
int n,m,s,v;
#define N 5010
struct Pos{
double x,y;
void read(){
scanf("%lf%lf",&x,&y);}
}a[N],b[N];
double getdis(Pos x,Pos y){
return sqrt((x.x-y.x)*(x.x-y.x)+(x.y-y.y)*(x.y-y.y));
}
bool f[N][N];
int match[N],dfn[N],dt;
bool dfs(