HDU2389-Rain on your Parade-二分图匹配-ISAP

裸二分图匹配

/*--------------------------------------------------------------------------------------*/

#include <algorithm>
#include <iostream>
#include <cstring>
#include <ctype.h>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <map>

//debug function for a N*M array
#define debug_map(N,M,G) printf("
");for(int i=0;i<(N);i++)
{for(int j=0;j<(M);j++){
printf("%d",G[i][j]);}printf("
");}
//debug function for int,float,double,etc.
#define debug_var(X) cout<<#X"="<<X<<endl;
#define LL long long
const int INF = 0x3f3f3f3f;
const LL LLINF = 0x3f3f3f3f3f3f3f3f;
/*--------------------------------------------------------------------------------------*/
using namespace std;

int N,M,T,t;
const int maxn = 6010;
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=1;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=1;i<=uN;i++) if(Mx[i] == -1 && DFS(i))
            res++;
    }
    return res/2;
}

typedef pair<int,int> point;
vector <point> gst;
int v[maxn];

int main()
{
    scanf("%d",&T);
    int cas = 0;
    while(T--)
    {
        scanf("%d%d",&t,&N);
        for(int i=0;i<maxn;i++) G[i].clear();

        gst.clear();
        for(int i=1,x,y,s;i<=N;i++)
        {
            scanf("%d%d%d",&x,&y,&s);
            gst.push_back(make_pair(x,y));
            v[i] = s;
        }
        scanf("%d",&M);
        uN = N+M;
        for(int i=1,x,y;i<=M;i++)
        {
            scanf("%d%d",&x,&y);
            for(int g=0;g<gst.size();g++)
            {
                if((x-gst[g].first)*(x-gst[g].first)+(y-gst[g].second)*(y-gst[g].second) <= t*v[g+1]*t*v[g+1])
                {
                    G[g+1].push_back(i+N);
                    G[i+N].push_back(g+1);
                    //printf("link:[%d,%d]
",g+1,i+N);
                }
            }
        }
        printf("Scenario #%d:
%d

",++cas,MaxMatch());
    }
}