Hdu 2389 二分匹配

题目链接

Rain on your Parade

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

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

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

 题目也是很裸的最大匹配问题，匈牙利算法复杂度太高（对于这题而言, O(n*m)）, 而Hopcroft-Karp算法复杂度只有O(sqrt(n)*m).关于算法的具体实现，

网上百度一大推。1A......:D

Accepted Code:

 /*************************************************************************
     > File Name: 2389.cpp
     > Author: Stomach_ache
     > Mail: sudaweitong@gmail.com
     > Created Time: 2014年08月01日 星期五 22时08分50秒
     > Propose: Hopcroft-Karp
  ************************************************************************/
 #include <queue>
 #include <cmath>
 #include <string>
 #include <cstdio>
 #include <vector>
 #include <fstream>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 using namespace std;

 const int maxn = ;
 const int INF = 0x3f3f3f3f;
 int cx[maxn], cy[maxn];
 int dx[maxn], dy[maxn];
 bool mark[maxn];
 vector<int> next[maxn];
 int n, m;
 struct node {
       int x, y, s;
 }g[maxn];

 int dist(int x1, int y1, int x2, int y2) {
       return (x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2);
 }

 int searchPath() {
       memset(dx, -, sizeof(dx));
     memset(dy, -, sizeof(dy));
     queue<int> Q;
     for (int i = ; i <= m; i++) if (cx[i] == -) {
           dx[i] = ;
         Q.push(i);
     }
     int dist = INF;
     while (!Q.empty()) {
           int u = Q.front(); Q.pop();
         if (dx[u] > dist) break;
         for (int i = ; i < (int)next[u].size(); i++) {
               int v = next[u][i];
               if (dy[v] == -) {
                   dy[v] = dx[u] + ;
                 if (cy[v] == -) {
                       dist = dy[v];
                 } else {
                       dx[cy[v]] = dy[v] + ;
                     Q.push(cy[v]);
                 }
             }
         }
     }
     return dist != INF;
 }

 int findPath(int u) {
       for (int i = ; i < (int)next[u].size(); i++) {
           int v = next[u][i];
         if (!mark[v] && dy[v] == dx[u] + ) {
               mark[v] = true;
             if (cy[v] == - || findPath(cy[v])) {
                   cy[v] = u;
                 cx[u] = v;
                 return ;
             }
         }
     }
     return ;
 }

 int MaxMatch() {
       int res = ;
       memset(cx, -, sizeof(cx));
     memset(cy, -, sizeof(cy));
     while (searchPath()) {
           memset(mark, false, sizeof(mark));
         for (int i = ; i <= m; i++) {
               if (cx[i] == -) {
                   res += findPath(i);
             }
         }
     }
     return res;
 }

 int main(void) {
       int T, cas = ;
     scanf("%d", &T);
     while (T--) {
           int t;
           scanf("%d", &t);
         scanf("%d", &m);
         for (int i = ; i <= m; i++) {
               next[i].clear();
               scanf("%d %d %d", &g[i].x, &g[i].y, &g[i].s);
         }
         scanf("%d", &n);
         for (int i = ; i <= n; i++) {
               int x, y;
             scanf("%d %d", &x, &y);
             for (int j = ; j <= m; j++) {
                   if (t*t*g[j].s*g[j].s >= dist(x, y, g[j].x, g[j].y)) {
                       next[j].push_back(i);
                 }
             }
         }
         printf("Scenario #%d:\n%d\n\n", cas++, MaxMatch());
     }

     return ;
 }