F - Rain on your Parade HDU2389 （二分图 Hopcroft-Carp算法）

You’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sunny evening, and a soothing wind sends fresh, salty air from the sea. The evening is progressing just as you had imagined. It could be the perfect end of a beautiful day.
But nothing ever is perfect. One of your guests works in weather forecasting. He suddenly yells, “I know that breeze! It means its going to rain heavily in just a few minutes!” Your guests all wear their best dresses and really would not like to get wet, hence they stand terrified when hearing the bad news.
You have prepared a few umbrellas which can protect a few of your guests. The umbrellas are small, and since your guests are all slightly snobbish, no guest will share an umbrella with other guests. The umbrellas are spread across your (gigantic) garden, just like your guests. To complicate matters even more, some of your guests can’t run as fast as the others.
Can you help your guests so that as many as possible find an umbrella before it starts to pour?

Given the positions and speeds of all your guests, the positions of the umbrellas, and the time until it starts to rain, find out how many of your guests can at most reach an umbrella. Two guests do not want to share an umbrella, however.
Input
The input starts with a line containing a single integer, the number of test cases.
Each test case starts with a line containing the time t in minutes until it will start to rain (1 <=t <= 5). The next line contains the number of guests m (1 <= m <= 3000), followed by m lines containing x- and y-coordinates as well as the speed si in units per minute (1 <= s i <= 3000) of the guest as integers, separated by spaces. After the guests, a single line contains n (1 <= n <= 3000), the number of umbrellas, followed by n lines containing the integer coordinates of each umbrella, separated by a space.
The absolute value of all coordinates is less than 10000.
Output
For each test case, write a line containing “Scenario #i:”, where i is the number of the test case starting at 1. Then, write a single line that contains the number of guests that can at most reach an umbrella before it starts to rain. Terminate every test case with a blank line.
Sample Input
2
1
2
1 0 3
3 0 3
2
4 0
6 0
1
2
1 1 2
3 3 2
2
2 2
4 4
Sample Output
Scenario #1:
2

Scenario #2:
2

题意：

   先给出距离下雨的时间，再给出n个人和m把雨伞的坐标位置，以及每个人的奔跑速
   度。每把雨伞只能供一人使用。求在下雨前最多有多少人可以拿到雨伞。

Hopcroft-Carp算法 并不是太理解 找了个板子

#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<iostream>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<queue>
typedef long long ll;
using namespace std;
const int N=3010;
const int INF=0x3f3f3f3f3f;
int bmap[N][N];
int cx[N],cy[N];
int dis,n,m,t;
int dx[N],dy[N],used[N];
struct node
{
    int x,y,s;
}st[N],en[N];
bool answer(node A,node B)
{
    double ans=sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));
    if(A.s*t>=ans)
    {
        return true;
    }
    else{
    return false;
    }
}
bool searchpath()
{
    queue<int>Q;
    dis=INF;
    memset(dx,-1,sizeof(dx));
    memset(dy,-1,sizeof(dy));
    for(int i=1;i<=m;i++)
    {
        if(cx[i]==-1)
        {
            Q.push(i);
            dx[i]=0;
        }
    }
    while(!Q.empty())
    {
        int u=Q.front();
        Q.pop();
        if(dx[u]>dis)
            break;
        for(int v=1;v<=n;v++)
        {
            if(bmap[u][v]&&dy[v]==-1)
            {
                dy[v]=dx[u]+1;
                if(cy[v]==-1)
                    dis=dy[v];
                else
                {
                    dx[cy[v]]=dy[v]+1;
                    Q.push(cy[v]);
                }
            }
        }
    }
    return dis!=INF;
}
bool DFS(int u)
{
    for(int v=1;v<=n;v++)
    {
        if(!used[v]&&bmap[u][v]&&dy[v]==dx[u]+1)
        {
            used[v]=1;
            if(cy[v]!=-1&&dy[v]==dis)
                continue;
            if(cy[v]==-1||DFS(cy[v]))
            {
                cy[v]=u;
                cx[u]=v;
                return true;
            }
        }
    }
    return false;
}
int maxmatch()
{
    int sum=0;
    memset(cx,-1,sizeof(cx));
    memset(cy,-1,sizeof(cy));
    while(searchpath())
    {
        memset(used,0,sizeof(used));
        for(int i=1;i<=m;i++)
        {
            if(cx[i]==-1&&DFS(i))
                sum++;
        }
    }
    return sum;
}
int main()
{
    int T;
    scanf("%d",&T);
    int Case=1;
    while(T--)
    {
        memset(bmap,0,sizeof(bmap));
        scanf("%d",&t);
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
        {
            scanf("%d%d%d",&st[i].x,&st[i].y,&st[i].s);
        }
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&en[i].x,&en[i].y);
        }
        for(int i=1;i<=m;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(answer(st[i],en[j]))
                {
                    bmap[i][j]=1;
                }
            }
        }
        printf("Scenario #%d:\n",Case++);
        printf("%d\n\n",maxmatch());
    }
    return 0;
}