hdu-2389.rain on your parade(二分匹配HK算法)
Rain on your Parade
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 655350/165535 K (Java/Others)
Total Submission(s): 6752 Accepted Submission(s): 2117
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.
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.
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
2
Scenario #2:
2
/*************************************************************************
> File Name: hdu-2389.rain_on_your_parade.cpp
> Author: CruelKing
> Mail: 2016586625@qq.com
> Created Time: 2019年09月02日 星期一 21时29分16秒
本题思路:比较裸的二分匹配,但是一看n比较大,所以需要更牛皮的算法,也即HK算法其复杂度为sqrt(n) * m.
************************************************************************/ #include <cstdio>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
using namespace std; typedef long long ll;
const int maxn = + , inf = 0x3f3f3f3f;
int speed[maxn];
bool used[maxn];
int n, m, t;
typedef pair<int, int> pii;
pii umbrellas[maxn], guests[maxn];
int mx[maxn], my[maxn];
int dx[maxn], dy[maxn];
vector <int> G[maxn];
int dis; bool searchp() {
queue<int> que;
dis = inf;
memset(dx, -, sizeof dx);
memset(dy, -, sizeof dy);
for(int i = ; i <= m; i ++) {
if(mx[i] == -) {
que.push(i);
dx[i] = ;
}
}
while(!que.empty()) {
int u = que.front();
que.pop();
if(dx[u] > dis) break;
int sz = G[u].size();
for(int i = ; i < sz; i ++) {
int v = G[u][i];
if(dy[v] == -) {
dy[v] = dx[u] + ;
if(my[v] == -) dis = dy[v];
else {
dx[my[v]] = dy[v] + ;
que.push(my[v]);
}
}
}
}
return dis != inf;
} bool dfs(int u) {
int sz = G[u].size();
for(int i = ; i < sz;i ++) {
int v = G[u][i];
if(!used[v] && dy[v] == dx[u] + ) {
used[v] = true;
if(my[v] != - && dy[v] == dis) continue;
if(my[v] == - || dfs(my[v])) {
my[v] = u;
mx[u] = v;
return true;
}
}
}
return false;
} int maxmatch() {
int res = ;
memset(mx, -, sizeof mx);
memset(my, -, sizeof my);
while(searchp()) {
memset(used, false, sizeof used);
for(int i = ; i <= m;i ++) {
if(mx[i] == - && dfs(i)) res ++;
}
}
return res;
} bool has_distance(int i, int j) {
ll temp = (umbrellas[i].first - guests[j].first) * (umbrellas[i].first - guests[j].first) + (umbrellas[i].second - guests[j].second) * (umbrellas[i].second - guests[j].second);
return temp <= (ll)speed[j] * speed[j] * t * t;
} int main() {
int T, Case = ;
scanf("%d", &T);
while(T --) {
scanf("%d", &t);
scanf("%d", &m);
for(int i = ; i <= m; i ++) {
scanf("%d %d %d", &guests[i].first, &guests[i].second, &speed[i]);
}
scanf("%d", &n);
for(int i = ; i <= n; i ++) {
scanf("%d %d", &umbrellas[i].first, &umbrellas[i].second);
for(int j = ; j <= m; j ++) {
if(has_distance(i, j)) G[j].push_back(i);
}
}
int res = maxmatch();
for(int i = ; i <= m; i ++) G[i].clear();
printf("Scenario #%d:\n", ++Case);
printf("%d\n\n", res);
}
return ;
}
hdu-2389.rain on your parade(二分匹配HK算法)的更多相关文章
- hdu2389 Rain on your Parade 二分图匹配--HK算法
You’re giving a party in the garden of your villa by the sea. The party is a huge success, and every ...
- 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 ...
- Hdu 3289 Rain on your Parade (二分图匹配 Hopcroft-Karp)
题目链接: Hdu 3289 Rain on your Parade 题目描述: 有n个客人,m把雨伞,在t秒之后将会下雨,给出每个客人的坐标和每秒行走的距离,以及雨伞的位置,问t秒后最多有几个客人可 ...
- 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 ...
- 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 ...
- HDU 2389 Rain on your Parade 最大匹配(模板题)【HK算法】
<题目链接> 题目大意:有m个宾客,n把雨伞,预计时间t后将会下大雨,告诉你每个宾客的位置和速度,每把雨伞的位置,问你最多几个宾客能够拿到伞. 解题分析: 本题就是要我们求人与伞之间的最大 ...
- hdu 2444 The Accomodation of Students(二分匹配 匈牙利算法 邻接表实现)
The Accomodation of Students Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K ( ...
- HDU2389 Rain on your Parade —— 二分图最大匹配 HK算法
题目链接:https://vjudge.net/problem/HDU-2389 Rain on your Parade Time Limit: 6000/3000 MS (Java/Others) ...
- HDU 2389 Rain on your Parade
大意:在一个二维坐标系上有nx个人和ny把伞,每个人都有自己的移动速度,问有多少人可以再 time 时间内移动到不同的雨伞处(不允许两个人共用一把伞). 输入数据: 第一行是一个T代表T组测试数据 ...
随机推荐
- 面试官:SpringBoot jar 可执行原理,知道吗?
文章篇幅较长,但是包含了SpringBoot 可执行jar包从头到尾的原理,请读者耐心观看.同时文章是基于 SpringBoot-2.1.3进行分析.涉及的知识点主要包括Maven的生命周期以及自定义 ...
- Git提交代码的正确姿势
按此步骤基本没问题,中间有conflict,需要手动解决. 1.git stash 2.git pull 3.git stash pop 4.git add --xxx 5.git commit -m ...
- Oracle RAC数据泵导出问题处理
1. 设置导出文件路径 sqlplus / as sysdba SQL> alter session set container=spdb1pdb; SQL> create directo ...
- python+selenium实现经京东登录+购物+支付
import json from time import sleep from selenium import webdriver import chardet from selenium.webdr ...
- 举个例子去理解vuex(状态管理),通俗理解vuex原理,通过vue例子类比
通俗理解vuex原理---通过vue例子类比 本文主要通过简单的理解来解释下vuex的基本流程,而这也是vuex难点之一. 首先我们先了解下vuex的作用vuex其实是集中的数据管理仓库,相当于数 ...
- class和style绑定
在数据绑定中,一个常见需求是,将数据与元素的 class 列表,以及元素的 style 内联样式的操作绑定在一起.由于它们都是属性(attribute),因此我们可以使用 v-bind 来处理它们:只 ...
- HDU 5687 Problem C ( 字典树前缀增删查 )
题意 : 度熊手上有一本神奇的字典,你可以在它里面做如下三个操作: 1.insert : 往神奇字典中插入一个单词 2.delete: 在神奇字典中删除所有前缀等于给定字符串的单词 3.search: ...
- Java 统计单词频数
输出单个文件中的 N 个英语单词出现的次数 定义双列集合,将单词不重复的读入一列中,另一列用来计数 import java.io.BufferedReader; import java.util.Ar ...
- [design pattern](1) Strategy
引言 最近,在学习设计模式相关的知识.本博客主要想讲一讲策略模式,这也是我学习的第一个模式.写下这篇博客,主要想记录下个人的一点理解,也是想通过写博客的方式来加深对与Strategy的一点理解.以下的 ...
- [CF Round603 Div2 F]Economic Difficulties
题目:Economic Difficulties 传送门:https://codeforces.com/contest/1263/problem/F 题意:给了两棵tree:Ta(拥有a个节点,节点编 ...