POJ 2536 Gopher II（二分图匹配）

POJ 2536 Gopher II

题目链接

题意：n个地鼠，m个洞，每个地鼠速度v，如果能在s秒内逃进某个洞就能活，每个洞只能容纳一个地鼠，问最少会死几个地鼠

思路：二分图匹配，能跑到的建边，然后求最大匹配，n - 最大匹配就是答案

代码：

#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;

const int N = 105;

int n, m;
double s, v;

struct Point {
	double x, y;
	void read() {
		scanf("%lf%lf", &x, &y);
	}
} p1[N], p2[N];

vector<int> g[N];

double dis(Point a, Point b) {
	double dx = a.x - b.x;
	double dy = a.y - b.y;
	return sqrt(dx * dx + dy * dy);
}

int left[N], vis[N];

bool dfs(int u) {
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i];
		if (vis[v]) continue;
		vis[v] = 1;
		if (left[v] == -1 || dfs(left[v])) {
			left[v] = u;
			return true;
		}
	}
	return false;
}

int hungary() {
	int ans = 0;
	memset(left, -1, sizeof(left));
	for (int i = 0; i < n; i++) {
		memset(vis, 0, sizeof(vis));
		if (dfs(i)) ans++;
	}
	return ans;
}

int main() {
	while (~scanf("%d%d%lf%lf", &n, &m, &s, &v)) {
		for (int i = 0; i < n; i++) {
			p1[i].read();
			g[i].clear();
		}
		for (int i = 0; i < m; i++) p2[i].read();
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (dis(p1[i], p2[j]) > s * v) continue;
				g[i].push_back(j);
			}
		}
		printf("%d\n", n - hungary());
	}
	return 0;
}