求最大匹配数
数据比较大,hungary算法会超时,要用Hopcroft-karp算法
#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int MAXN=3001;
struct guest
{
int x,y,s;
}gue[MAXN];
struct umbrella
{
int x,y;
}um[MAXN];
int n,m;
const int INF=1<<28;
int g[MAXN][MAXN],Mx[MAXN],My[MAXN],Nx,Ny;
int dx[MAXN],dy[MAXN],dis;
bool vst[MAXN];
bool searchP()
{
queue<int>Q;
dis=INF;
memset(dx,-1,sizeof(dx));
memset(dy,-1,sizeof(dy));
for(int i=0;i<Nx;i++)
if(Mx[i]==-1)
{
Q.push(i);
dx[i]=0;
}
while(!Q.empty())
{
int u=Q.front();
Q.pop();
if(dx[u]>dis) break;
for(int v=0;v<Ny;v++)
if(g[u][v]&&dy[v]==-1)
{
dy[v]=dx[u]+1;
if(My[v]==-1) dis=dy[v];
else
{
dx[My[v]]=dy[v]+1;
Q.push(My[v]);
}
}
}
return dis!=INF;
}
bool DFS(int u)
{
for(int v=0;v<Ny;v++)
if(!vst[v]&&g[u][v]&&dy[v]==dx[u]+1)
{
vst[v]=1;
if(My[v]!=-1&&dy[v]==dis) continue;
if(My[v]==-1||DFS(My[v]))
{
My[v]=u;
Mx[u]=v;
return 1;
}
}
return 0;
}
int MaxMatch()
{
int res=0;
memset(Mx,-1,sizeof(Mx));
memset(My,-1,sizeof(My));
while(searchP())
{
memset(vst,0,sizeof(vst));
for(int i=0;i<Nx;i++)
if(Mx[i]==-1&&DFS(i)) res++;
}
return res;
}
int main()
{
int T,i,j,t,icase=0;
scanf("%d",&T);
while(T--)
{
icase++;
scanf("%d%d",&t,&m);
memset(g,0,sizeof(g));
for(i=0;i<m;i++)
scanf("%d%d%d",&gue[i].x,&gue[i].y,&gue[i].s);
scanf("%d",&n);
Nx=n;
Ny=m;
for(i=0;i<n;i++)
scanf("%d%d",&um[i].x,&um[i].y);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(t*t*gue[j].s*gue[j].s>=(gue[j].x-um[i].x)*(gue[j].x-um[i].x)+(gue[j].y-um[i].y)*(gue[j].y-um[i].y))
g[i][j]=1;
}
}
printf("Scenario #%d:\n",icase);
printf("%d\n\n",MaxMatch());
}
return 0;
}