POJ 2536 水匹配...

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;

struct POINT2D
{
 	   double x,y;
}point[222];

struct Edge
{
 	   int v,next;
}E[111111];
int match[222],ptr[222];
int Edgenum;
bool vis[222];

void addEdge( int u,int v )
{
 	 E[Edgenum].v=v;
 	 E[Edgenum].next=ptr[u];
 	 ptr[u]=Edgenum++;
}

double dis( POINT2D p, POINT2D q ){
 	   return sqrt( (p.x-q.x)*(p.x-q.x)+(p.y-q.y)*(p.y-q.y) );
}

bool Match( int cur )
{
 	 for( int i=ptr[cur];i!=-1;i=E[i].next )
 	 {
	  	  if( !vis[E[i].v] )
	  	  {
		   	  vis[E[i].v]=true;
		   	  if( match[E[i].v]==-1||Match(match[E[i].v]))
			  {
			   	  match[E[i].v]=cur;
			   	  return true;
  	  		  }
   		  }
	 }
	 return false;
}


int main()
{
 	int n,m,s,v;
 	while( scanf("%d %d %d %d",&n,&m,&s,&v)!=EOF )
 	{
	 	   Edgenum=0;
	 	   memset( match,-1,sizeof(match) );
	 	   memset( ptr,-1,sizeof(ptr) );
	 	   for( int i=0;i<n+m;i++ )
	 	   		scanf( "%lf %lf",&point[i].x,&point[i].y );
	 	   for( int i=0;i<n;i++ )
	 	   for( int j=n;j<n+m;j++ )
	 	   		if( dis(point[i],point[j])/v<=s )
	 	   			addEdge(i,j);
	 	   int ans=0;
	 	   for( int i=0;i<n;i++ )
	 	   {
		   		memset( vis,0,sizeof(vis) );
		   		if( Match(i) )
		   			ans++;
		   }
		   printf( "%d\n",n-ans );
  	}
 	return 0;
}