hdu 2389 Rain on your Parade(二分匹配Hopcroft-Carp算法模版)

最新推荐文章于 2020-08-21 11:09:08 发布

原创最新推荐文章于 2020-08-21 11:09:08 发布 · 472 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

图论同时被 3 个专栏收录

59 篇文章

订阅专栏

模版

23 篇文章

订阅专栏

二分图匹配

9 篇文章

订阅专栏

在一个即将下雨的聚会中，帮助宾客们找到足够多的伞避免淋湿。通过使用Hopcroft-Carp算法解决最大匹配问题。

题目链接

Rain on your Parade

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 655350/165535 K (Java/Others)
Total Submission(s): 3794 Accepted Submission(s): 1239

Problem Description

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

Sample Output

  
   Scenario #1:
2

Scenario #2:
2

Source

HDU 2008-10 Public Contest

题解：

这题一开始用网络流做的，妥妥的超时，后来看了题解才发现这就是一道裸的二分匹配啊。。。然后写了匈牙利版本的，还是超时，网上搜了才知道这题必须用Hopcroft-Carp算法。

下面贴出这题ac代码和Hopcroft-Carp模版：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue> 
using namespace std;
const int MAXN=3000+10;
const int INF=0x3f3f3f3f;
const double eps=1e-6;
int speed[MAXN];
struct fun
{
    int x,y;
}a[MAXN*2];

int g[MAXN][MAXN],Mx[MAXN],My[MAXN],Nx,Ny;   //Nx为第一维,Ny是第二维 
int dx[MAXN],dy[MAXN],dis;
bool vst[MAXN];
bool searchP()
{
    queue<int>Q;
    dis=INF;
    memset(dx,-1,sizeof(dx));
    memset(dy,-1,sizeof(dy));
    for(int i=1;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]>dis)  break;
        for(int v=1;v<=Ny;v++)
            if(g[u][v]&&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)
{
    for(int v=1;v<=Ny;v++)
       if(!vst[v]&&g[u][v]&&dy[v]==dx[u]+1)
       {
           vst[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;  
}
int MaxMatch()
{
    int res=0;
    memset(Mx,-1,sizeof(Mx));
    memset(My,-1,sizeof(My));
    while(searchP())
    {
        memset(vst,0,sizeof(vst));
        for(int i=1;i<=Nx;i++)
          if(Mx[i]==-1&&DFS(i))  res++;
    }
    return res;   
}

double Dis(fun a,fun b)
{
    double x1=a.x-b.x;
    double y1=a.y-b.y;
    return sqrt(x1*x1+y1*y1);
}

int cmp(double x)
{
    if(fabs(x)<eps) return 0;
    else return x>0? 1:-1;
}

int main()
{
    int cas;
    scanf("%d",&cas);
    for(int kase=1;kase<=cas;kase++)
    {
        int n,m;
        memset(g,0,sizeof(g));
        int t;
        scanf("%d",&t);
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        scanf("%d%d%d",&a[i].x,&a[i].y,&speed[i]);
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
        scanf("%d%d",&a[n+i].x,&a[n+i].y);
        Nx=n,Ny=m;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(cmp(Dis(a[i],a[n+j])/speed[i]-t)<=0)
                g[i][j]=1;
            }
        }
        int ans=MaxMatch();
        printf("Scenario #%d:\n%d\n\n",kase,ans);
    }
}

Hopcroft-Carp算法模版：

int g[MAXN][MAXN],Mx[MAXN],My[MAXN],Nx,Ny;   //Nx为第一维,Ny是第二维 
int dx[MAXN],dy[MAXN],dis;                 //注意先要初始化Nx和Ny再调用此函数 
bool vst[MAXN];
bool searchP()
{
    queue<int>Q;
    dis=INF;
    memset(dx,-1,sizeof(dx));
    memset(dy,-1,sizeof(dy));
    for(int i=1;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]>dis)  break;
        for(int v=1;v<=Ny;v++)
            if(g[u][v]&&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)
{
    for(int v=1;v<=Ny;v++)
       if(!vst[v]&&g[u][v]&&dy[v]==dx[u]+1)
       {
           vst[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;  
}
int MaxMatch()
{
    int res=0;
    memset(Mx,-1,sizeof(Mx));
    memset(My,-1,sizeof(My));
    while(searchP())
    {
        memset(vst,0,sizeof(vst));
        for(int i=1;i<=Nx;i++)
          if(Mx[i]==-1&&DFS(i))  res++;
    }
    return res;   
}