HDU 2389 Rain on your Parade （二分图匹配）

题意：天马上就要下雨了，然后有n个人，m把伞，然后分别给出人的坐标和他们跑的速度，以及伞的坐标，然后问在t时间内，最多能有多少人拿到伞。

题解：二分图匹配
之前做过一道类似的题目，是用最大流做的，但这道题n和m都是3000，用匈牙利和ISAP都会超时，直接上HK算法。

以后类似的题目都用二分图来做吧。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
/* *******************************
 * 二分图匹配（Hopcroft-Karp算法）
 * 复杂度O(sqrt(n)*E)
 * 邻接表存图，vector实现
 * vector先初始化，然后假如边
 * uN 为左端的顶点数，使用前赋值(点编号0开始)
 */
const int maxn = 3e3 + 30;
const int INF = 0x3f3f3f3f;
vector<int> G[maxn];
int uN;  //左端顶点数 记得赋值
int Mx[maxn], My[maxn];
int dx[maxn], dy[maxn];
int dis;
bool used[maxn];
bool SearchP() {
	queue<int>Q;
	dis = INF;
	memset(dx, -1, sizeof(dx));
	memset(dy, -1, sizeof(dy));
	for (int i = 0; i < uN; 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;
		int sz = G[u].size();
		for (int i = 0; i < sz; i++) {
			int v = G[u][i];
			if (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) {
	int sz = G[u].size();
	for (int i = 0; i < sz; i++) {
		int v = G[u][i];
		if (!used[v] && dy[v] == dx[u] + 1) {
			used[v] = true;
			if (My[v] != -1 && dy[v] == dis)continue;
			if (My[v] == -1 || DFS(My[v])) {
				My[v] = u;
				Mx[u] = v;
				return true;
			}
		}
	}
	return false;
}
int MaxMatch() {
	int res = 0;
	memset(Mx, -1, sizeof(Mx));
	memset(My, -1, sizeof(My));
	while (SearchP()) {
		memset(used, false, sizeof(used));
		for (int i = 0; i < uN; i++)
			if (Mx[i] == -1 && DFS(i))
				res++;
	}
	return res;
}

int T, t, n, m;
struct node {
	int x, y, s;
}man[maxn];
struct node1 {
	int x, y;
}umb[maxn];
int main() {
	int cas = 0;
	scanf("%d", &T);
	while (T--) {
		scanf("%d%d", &t, &n);
		for (int i = 0; i < n; i++) scanf("%d%d%d", &man[i].x, &man[i].y, &man[i].s);
		for (int i = 0; i < n; i++) G[i].clear();
		scanf("%d", &m);
		for (int i = 0; i < m; i++) scanf("%d%d", &umb[i].x, &umb[i].y);
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				int dis = (man[i].x - umb[j].x) * (man[i].x - umb[j].x) + (man[i].y - umb[j].y) * (man[i].y - umb[j].y);
				if (man[i].s * t * man[i].s * t >= dis) G[i].push_back(j);
			}
		}
		uN = n;
		printf("Scenario #%d:\n%d\n\n", ++cas, MaxMatch());
	}
	return 0;
}