POJ 2389 Rain on your Parade(二分图HK算法)

https://vjudge.net/problem/HDU-2389

HK模板题，，适应模板，最大流应该也可以解

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 3005;
int mx[maxn], my[maxn];
int dx[maxn], dy[maxn];
int link[maxn];
bool vis[maxn];
int head[maxn];
int cnt;
int dis;
double x1[maxn], x2[maxn], y1[maxn], y2[maxn], v[maxn];
int n, m, k;
//vector<int> G[maxn];
struct node
{
    int to, next;
}e[maxn*maxn];
void init()
{
//    for(int i = 1; i <= n; i ++)
//        G[i].clear();
    cnt = 0;
    memset(head, -1, sizeof(head));
    memset(link, -1, sizeof(link));
    memset(mx, -1, sizeof(mx));
    memset(my, -1, sizeof(my));
}
void addedge(int u, int v)
{
    e[cnt].to = v;
    e[cnt].next = head[u];
    head[u] = cnt ++;
}
bool searchP()
{
    queue<int> q;
    dis = inf;
    memset(dx, -1, sizeof(dx));
    memset(dy, -1, sizeof(dy));
    for(int i = 1; i <= n; 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 = head[u]; ~i; i = e[i].next)
        {
            //int v = G[u][i];
            int v = e[i].to;
            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 = head[u]; ~i; i = e[i].next)
    {
        //int v = G[u][i];
        int v = e[i].to;
        if(! vis[v] && dy[v] == dx[u] + 1)
        {
            vis[v] = 1;
            if(my[v] != -1 && dy[v] == dis) continue;
            if(my[v] == -1 || dfs(my[v]))
            {
                my[v] = u;
                mx[u] = v;
                return 1;
            }
        }
    }
    return 0;
}
double t;
double calc(double x1, double y1, double x2, double y2, double v)
{
    if(sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) <= v * t)
        return 1;
    else return 0;
}
int main()
{
    int T;
    scanf("%d", &T);
    int cas = 0;
    while(T --)
    {
        init();
        int ans = 0;
        scanf("%lf%d", &t, &n);
        for(int i = 1; i <= n; i ++)
            scanf("%lf%lf%lf", &x1[i], &y1[i], &v[i]);
        scanf("%d", &m);
        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(calc(x1[i], y1[i], x2[j], y2[j], v[i]))
            {
                addedge(i, j);
                //cout<<i<<' '<<j<<' '<<x1[i]<<' '<<y1[i]<<' '<<x2[j]<<' '<<y2[j]<< ' '<<v[i]<<endl;
            }
        }
        while(searchP())
        {
            memset(vis, 0, sizeof(vis));
            for(int i = 1; i <= n; i ++)
            {
                if(mx[i] == -1 && dfs(i))
                    ans ++;
            }
        }
        printf("Scenario #%d:\n%d\n\n", ++ cas, ans);
    }
    return 0;
}