Gopher II(POJ 2536)---二分图最大匹配

题目链接

题目描述

The gopher family, having averted the canine threat, must face a new predator.
The are n gophers and m gopher holes, each at distinct (x, y) coordinates. A hawk arrives and if a gopher does not reach a hole in s seconds it is vulnerable to being eaten. A hole can save at most one gopher. All the gophers run at the same velocity v. The gopher family needs an escape strategy that minimizes the number of vulnerable gophers.
Input

输入格式

The input contains several cases. The first line of each case contains four positive integers less than 100: n, m, s, and v. The next n lines give the coordinates of the gophers; the following m lines give the coordinates of the gopher holes. All distances are in metres; all times are in seconds; all velocities are in metres per second.
Output

输出格式

Output consists of a single line for each case, giving the number of vulnerable gophers.

输入样例

2 2 5 10
1.0 1.0
2.0 2.0
100.0 100.0
20.0 20.0

输出样例

1

分析

题目大意是有 n 个地鼠和 m 个洞，每个洞只能容纳 1 只地鼠，当鹰飞来时，n 个地鼠若能在 s 秒内以v速度从当前位置回到洞中，就能不被鹰抓住，求被抓住的地鼠个数的最小值。
对于这道题，将地鼠视为左点集（编号1-100），地洞视为右点集（编号101-200），对这样的二分图找最大匹配，被抓住的地鼠个数即为n-最大匹配数。

源程序

DFS版本

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#define MAXN 205
#define MAXM MAXN*MAXN
#define EXP 1e-8
using namespace std;
struct Edge{
	int u,v,next;
	Edge(){}
	Edge(int u,int v,int next):u(u),v(v),next(next){}
}edge[MAXM];
int EdgeCount,head[MAXN];
int n,m,s,v,link[MAXN];
double x1[MAXN],y1[MAXN],x2[MAXN],y2[MAXN]; 
bool vis[MAXN];
void addEdge(int u,int v)
{
	edge[++EdgeCount]=Edge(u,v,head[u]);
	head[u]=EdgeCount;
}
double getdis(int a,int b)
{
	return sqrt((x1[a]-x2[b])*(x1[a]-x2[b])+(y1[a]-y2[b])*(y1[a]-y2[b]));
}
bool dfs(int u)
{
	for(int i=head[u];i;i=edge[i].next){
		int v=edge[i].v;
		if(!vis[v]){	//不在交替路中
			vis[v]=true;
			if(link[v]==-1 || dfs(link[v])){	//未匹配点或找到新方案
				link[v]=u;
				return true; 
			}
		}
	}
	return false;
}
int hargarian()
{
	memset(link,-1,sizeof(link));
	int ans=0;	//记录匹配数 
	for(int i=1;i<=n;i++){
		memset(vis,false,sizeof(vis));
		if(dfs(i))
			ans++;
	}
	return ans;
}
int main()
{
	while(~scanf("%d%d%d%d",&n,&m,&s,&v)){
		memset(head,0,sizeof(head));	//初始化 
		EdgeCount=0;
		for(int i=1;i<=n;i++)	//读入地鼠坐标
			scanf("%lf%lf",&x1[i],&y1[i]); 
		for(int i=1;i<=m;i++)	//读入洞坐标
			scanf("%lf%lf",&x2[i],&y2[i]); 
		for(int i=1;i<=n;i++){	//建图 
			for(int j=1;j<=m;j++){
				if(s*v-getdis(i,j)>EXP)	//可以逃到洞中
					addEdge(i,100+j);	//地鼠编号在1~100 
			}							//地洞编号在101~200 
		}
		printf("%d\n",n-hargarian());
	} 
}

BFS版本

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#define MAXN 205
#define MAXM MAXN*MAXN
#define EXP 1e-8
using namespace std;
struct Edge{
	int u,v,next;
	Edge(){}
	Edge(int u,int v,int next):u(u),v(v),next(next){}
}edge[MAXM];
int EdgeCount,head[MAXN];
int n,m,s,v,pre[MAXN],vis[MAXN],link[MAXN];
double x1[MAXN],x2[MAXN],y1[MAXN],y2[MAXN];
queue<int> q;
void addEdge(int u,int v)
{
	edge[++EdgeCount]=Edge(u,v,head[u]);
	head[u]=EdgeCount;
}
double getdis(int a,int b)
{
	return sqrt((x1[a]-x2[b])*(x1[a]-x2[b])+(y1[a]-y2[b])*(y1[a]-y2[b]));
} 
int hargarian()
{
	memset(pre,-1,sizeof(pre));
	memset(vis,-1,sizeof(vis));
	memset(link,-1,sizeof(link));
	int ans=0;	//记录匹配数
	for(int i=1;i<=n;i++){
		if(link[i]==-1){
			while(!q.empty()) q.pop();	//清空队列
			q.push(i);
			bool flag=false;
			while(!q.empty()&&!flag){	//寻找匹配方案
				int u=q.front();q.pop();
				for(int j=head[u];j;j=edge[j].next){
					if(flag) break;	//已找到匹配方案
					int v=edge[j].v;
					if(vis[v]!=i){	//不在交替路中
						vis[v]=i;
						if(link[v]>=0)	//对应点已匹配，寻找新方案
							q.push(link[v]),pre[link[v]]=u;
						else{	//找到匹配点 
							flag=true;	 
							int l=u,r=v;
							while(l!=-1){	//分配匹配方案 
								int tmp=link[l];
								link[l]=r;
								link[r]=l;
								l=pre[l];
								r=tmp; 
							}
						} 
					} 
				}
			}
			if(link[i]!=-1)	//该点有匹配 
				ans++; 
		}
	} 
	return ans; 
}
int main()
{
	while(~scanf("%d%d%d%d",&n,&m,&s,&v)){
		memset(head,0,sizeof(head));	//初始化 
		EdgeCount=0;
		for(int i=1;i<=n;i++)	//地鼠坐标
			scanf("%lf%lf",&x1[i],&y1[i]); 
		for(int i=1;i<=m;i++)	//洞坐标
			scanf("%lf%lf",&x2[i],&y2[i]); 
		for(int i=1;i<=n;i++){	//建图
			for(int j=1;j<=m;j++){
				if(s*v-getdis(i,j)>EXP)	//可以逃入洞中 
					addEdge(i,j+100);		//地鼠编号1~100 
			} 								//洞坐标101~200 
		}
		printf("%d\n",n-hargarian()); 
	}
}