Rain on your Parade

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

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 <= si <= 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

Source
HDU 2008-10 Public Contest

Recommend
lcy

一看就是求二分图的最大匹配,不过点太多了匈牙利不行,要用Hopcroft_Karp.别人的代码没看懂,不过幸好接口用起来挺方便.贴上大牛的代码:

#include<cstring>   //HK算法。。
#include<queue>
#include<cmath>
#include<cstdio>
#include<vector> using namespace std;
const int maxn=;
int n,m;
struct Pos{
int x,y;
}man[maxn],umbr[maxn];
vector<int> child[maxn];
int speed[maxn];//人的速度
int cx[maxn],cy[maxn];//集合X Y的匹配值
int distx[maxn],disty[maxn];//记录距离 bool bfs(){
bool flag=false;
memset(distx,,sizeof(distx));//距离初始为0
memset(disty,,sizeof(disty)); queue<int> que;
for(int i=;i<=n;i++)//把X集合中 所有未匹配的加入队列
if(cx[i]==-)
que.push(i);
while(!que.empty())//集合非空
{
int x=que.front();
que.pop();
for(int i = ; i < child[ x ].size() ; i++ )//所有以i为起点的边
{
int y = child[ x ][ i ];
if( !disty[ y ] )//该边未被使用
{
disty[ y ]=distx[ x ] + ;//距离+1
if(cy[ y ] == -) flag=true;//该点未被使用可以增加匹配
else
{
distx[ cy[ y ] ]= disty[ y ] + ;
que.push( cy[ y ] );
}
}
}
}
return flag;
}
bool dfs(int x){//寻找增广路
for(int i=;i<child[x].size();i++)//枚举所有以i为起点的边
{
int y=child[x][i];
if(disty[ y ] == distx[ x ]+)//距离刚好为1表明相连
{
disty[ y ] = ;
if(cy[ y ] == - || dfs( cy[ y ] ))//找到一条增广路
{
cx[ x ] = y ; cy[ y ] = x;//保存匹配值
return true;
}
}
}
return false;
}
int Hopcroft_Karp(){
memset(cx,-,sizeof(cx));
memset(cy,-,sizeof(cy));
int ans=;
while(bfs())//如果距离更新成功,X集合中每一个点找一次增广路
{
for(int i=;i<=n;i++)
if(cx[i]==- && dfs(i))
ans++;
}
return ans;
} double dis(int i,int j){
return sqrt( (double)(man[i].x-umbr[j].x)*(man[i].x-umbr[j].x)+ (man[i].y-umbr[j].y)*(man[i].y-umbr[j].y) );
}
int main(){
int t,cas=,time;
scanf("%d",&t);
while(t--){
scanf("%d%d",&time,&n);
for(int i=;i<=n;i++)
scanf("%d%d%d",&man[i].x,&man[i].y,&speed[i]); scanf("%d",&m);
for(int i=;i<=m;i++)
scanf("%d%d",&umbr[i].x,&umbr[i].y); for(int i=;i<=n;i++)
child[i].clear(); for(int i=;i<=n;i++)//能够在下雨前拿到伞的建一条边
for(int j=;j<=m;j++)
if(speed[i]*time >= dis(i,j))
child[i].push_back(j); printf("Scenario #%d:\n",++cas);
printf("%d\n",Hopcroft_Karp());
printf("\n"); }
}

Rain on your Parade的更多相关文章

  1. HDOJ 2389 Rain on your Parade

     HK.... Rain on your Parade Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 655350/165535 K ...

  2. HDU 2389 Rain on your Parade / HUST 1164 4 Rain on your Parade(二分图的最大匹配)

    HDU 2389 Rain on your Parade / HUST 1164 4 Rain on your Parade(二分图的最大匹配) Description You're giving a ...

  3. Hdu2389 Rain on your Parade (HK二分图最大匹配)

    Rain on your Parade Problem Description You’re giving a party in the garden of your villa by the sea ...

  4. HDU 2389 Rain on your Parade(二分匹配,Hopcroft-Carp算法)

    Rain on your Parade Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 655350/165535 K (Java/Ot ...

  5. HDU2389:Rain on your Parade(二分图最大匹配+HK算法)

    Rain on your Parade Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 655350/165535 K (Java/Ot ...

  6. HDU 2389 ——Rain on your Parade——————【Hopcroft-Karp求最大匹配、sqrt(n)*e复杂度】

    Rain on your Parade Time Limit:3000MS     Memory Limit:165535KB     64bit IO Format:%I64d & %I64 ...

  7. HDU2389 Rain on your Parade —— 二分图最大匹配 HK算法

    题目链接:https://vjudge.net/problem/HDU-2389 Rain on your Parade Time Limit: 6000/3000 MS (Java/Others)  ...

  8. Hdu 3289 Rain on your Parade (二分图匹配 Hopcroft-Karp)

    题目链接: Hdu 3289 Rain on your Parade 题目描述: 有n个客人,m把雨伞,在t秒之后将会下雨,给出每个客人的坐标和每秒行走的距离,以及雨伞的位置,问t秒后最多有几个客人可 ...

  9. hdu-2389.rain on your parade(二分匹配HK算法)

    Rain on your Parade Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 655350/165535 K (Java/Ot ...

随机推荐

  1. Linux下使用Speedtest测试网速

    导读 Speedtest是用来测试网络性能的开源软件,在Linux下面安装Speedtest可以用来测试网络出口的上传和下载速度,帮助排查网络方面导致的故障. Speedtest介绍 由于公司几个项目 ...

  2. HTTP HSTS协议和 nginx

    导读 Netcraft 公司最近公布了他们检测SSL/TLS网站的研究,并指出只有仅仅5%的用户正确执行了HTTP严格传输安全HSTS.本文介绍nginx如何配置HSTS. 什么是HSTS HTTPS ...

  3. Vector3.Lerp 插值

    Vector3.Lerp 插值 static function Lerp (from : Vector3, to : Vector3, t : float) : Vector3 Description ...

  4. [BZOJ1786][BZOJ1831]逆序对

    [BZOJ1786][BZOJ1831]逆序对 试题描述 输入 输出 输入示例 - - 输出示例 数据规模及约定 见“输入” 题解 首先这题有一个性质,即,填的数从左到右一定不降.证明不妨读者自己yy ...

  5. OpenCV的基本数据结构

    参考:http://www.cnblogs.com/guoqiaojin/p/3176692.html

  6. Android自定义dialogdemo

    很多时候,我们需要自己去定义dialog,目前我们就遇见了这样一个需求,我的想法是自己定义一个dialog,如果有list的话就使用listview,如果有msg的话就使用msg,并且取消和确定按钮也 ...

  7. 《转》.NET开源核心运行时,且行且珍惜

    转载自infoQ 背景 InfoQ中文站此前报道过,2014年11月12日,ASP.NET之父.微软云计算与企业级产品工程部执行副总裁Scott Guthrie,在Connect全球开发者在线会议上宣 ...

  8. sharepoint读取启用了追加功能的多行文本的历史版本记录

    当建立多行文本栏时,有个功能就是"追加对现有文本所做的更改",这个功能启用后,这个多行文本就只运行追加内容而不允许修改以前提交的内容.常常被应用在多个用户之间的协作.问题的追踪等记 ...

  9. cocos2d c++ 代码规范(译文)

    原文在http://cocos2d-x.org/projects/cocos2d-x/wiki/Cocos2d_c++_coding_style,我觉得这个规范非常全面,写的非常好,我只捡一些我认为比 ...

  10. VMware安装64位操作系统提示Intel VT-x处于禁用状态的解决办法

    用VMware安装64位操作系统时,如果目前本地的操作系统是64位的,那么可以说明CPU是肯定支持64位的,这时候如果提示此主机支持 Intel VT-x,但 Intel VT-x 处于禁用状态.这个 ...