[HDOJ2389]Rain on your Parade（二分图最大匹配，HK算法）

题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=2389

题意：一个人请了m个人在院子里聚会，每个人有位置坐标和速度。院子里有n把伞，给出伞的位置。现在要下雨了，所有人应该在k秒内拿到伞，问如何拿伞能让尽可能多的人拿到伞，每把伞只能有一个人打。

以每个人到某把伞的时间是否在限定时间内来建立二分图，之后跑最大匹配就行。这里有一个问题出在了点的数量是3000，在点数量较大的情况下使用一般的匈牙利和KM算法会TLE，所以学习到了使用HK算法，尽管我暂时还不知道HK算法的具体解决问题的思路和方法，但是我会用板子…

/*
━━━━━┒ギリギリ♂ eye！
┓┏┓┏┓┃キリキリ♂ mind！
┛┗┛┗┛┃＼○／
┓┏┓┏┓┃ /
┛┗┛┗┛┃ノ)
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┃┃┃┃┃┃
┻┻┻┻┻┻
*/
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define fr first
#define sc second
#define cl clear
#define BUG puts("here!!!")
#define W(a) while(a--)
#define pb(a) push_back(a)
#define Rint(a) scanf("%d", &a)
#define Rll(a) scanf("%I64d", &a)
#define Rs(a) scanf("%s", a)
#define Cin(a) cin >> a
#define FRead() freopen("in", "r", stdin)
#define FWrite() freopen("out", "w", stdout)
#define Rep(i, len) for(int i = 0; i < (len); i++)
#define For(i, a, len) for(int i = (a); i < (len); i++)
#define Cls(a) memset((a), 0, sizeof(a))
#define Clr(a, x) memset((a), (x), sizeof(a))
#define Full(a) memset((a), 0x7f7f7f, sizeof(a))
#define lrt rt << 1
#define rrt rt << 1 | 1
#define pi 3.14159265359
#define RT return
#define lowbit(x) x & (-x)
#define onecnt(x) __builtin_popcount(x)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<LL, LL> pll;
typedef map<string, int> msi;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<vl> vvl;
typedef vector<bool> vb;
const int maxn = 3030;
const int inf = 0x3f3f3f3f;
int nx, ny, dist;
int Mx[maxn], My[maxn], dx[maxn], dy[maxn], vis[maxn], G[maxn][maxn];

bool Dfs(int u){
    for(int v = 0; v < ny; v++)
        if(!vis[v] && G[u][v] && dy[v] == dx[u] + 1){
            vis[v] = 1;
            if(My[v] != -1 && dy[v] == dist)
                continue;
            if(My[v] == -1|| Dfs(My[v])){
                My[v] = u;
                Mx[u] = v;
                return 1;
            }
        }
    return 0;
}
bool Search(){
    queue<int> Q;
    dist = 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] > dist)
            break;
        for(int v = 0; v < ny; v++)
            if(G[u][v] && dy[v] == -1){
                dy[v] = dx[u] + 1;
                if(My[v] == -1)
                    dist = dy[v];
                else{
                    dx[My[v]] = dy[v] + 1;
                    Q.push(My[v]); 
                }
            } 
    }
    return dist != inf;
}
int MaxMatch() {
    int res = 0;
    memset(Mx, -1, sizeof(Mx));
    memset(My, -1, sizeof(My));
    while(Search()){
        memset(vis, 0, sizeof(vis));
        for(int i = 0; i < nx; i++)
            if(Mx[i] == -1&& Dfs(i))
                res++;
    }
    return res;
}
int n, m, k;
typedef struct Node {
    double x, y, v;
}Node;
Node num[maxn], pos[maxn];

double dis(Node a, Node b) {
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

inline bool scan_lf(double &num) {
    char in;double Dec=0.1;
    bool IsN=false,IsD=false;
    in=getchar();
    if(in==EOF) return false;
    while(in!='-'&&in!='.'&&(in<'0'||in>'9'))
            in=getchar();
    if(in=='-'){IsN=true;num=0;}
    else if(in=='.'){IsD=true;num=0;}
    else num=in-'0';
    if(!IsD){
            while(in=getchar(),in>='0'&&in<='9'){
                    num*=10;num+=in-'0';}
    }
    if(in!='.'){
            if(IsN) num=-num;
            return true;
    }else{
            while(in=getchar(),in>='0'&&in<='9'){
                    num+=Dec*(in-'0');Dec*=0.1;
            }
    }
    if(IsN) num=-num;
    return true;
}
inline bool scan_d(int &num) {
    char in;bool IsN=false;
    in=getchar();
    if(in==EOF) return false;
    while(in!='-'&&(in<'0'||in>'9')) in=getchar();
    if(in=='-'){ IsN=true;num=0;}
    else num=in-'0';
    while(in=getchar(),in>='0'&&in<='9'){
            num*=10,num+=in-'0';
    }
    if(IsN) num=-num;
    return true;
}

int main() {
    // FRead();
    int T, _ = 1;
    scan_d(T);
    W(T) {
        Cls(G);
        scan_d(k); scan_d(m);
        Rep(i, m) {
            scan_lf(num[i].x);
            scan_lf(num[i].y);
            scan_lf(num[i].v);
        }
        Rint(n);
        Rep(i, n) {
            scan_lf(pos[i].x);
            scan_lf(pos[i].y);
        }
        nx = m; ny = n;
        Rep(i, m) {
            Rep(j, n) {
                if(dis(num[i], pos[j]) / num[i].v <= k) {
                    G[i][j] = 1;
                }
            }
        }
        printf("Scenario #%d:
%d

", _++, MaxMatch());
    }
    RT 0;
}