HDU4268 Alice and Bob【贪心+SET】
来源:互联网 发布:小程序服务器域名要求 编辑:程序博客网 时间:2024/05/21 19:57
Alice and Bob
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4719 Accepted Submission(s): 1480
Problem Description
Alice and Bob's game never ends. Today, they introduce a new game. In this game, both of them have N different rectangular cards respectively. Alice wants to use his cards to cover Bob's. The card A can cover the card B if the height of A is not smaller than B and the width of A is not smaller than B. As the best programmer, you are asked to compute the maximal number of Bob's cards that Alice can cover.
Please pay attention that each card can be used only once and the cards cannot be rotated.
InputPlease pay attention that each card can be used only once and the cards cannot be rotated.
The first line of the input is a number T (T <= 40) which means the number of test cases.
For each case, the first line is a number N which means the number of cards that Alice and Bob have respectively. Each of the following N (N <= 100,000) lines contains two integers h (h <= 1,000,000,000) and w (w <= 1,000,000,000) which means the height and width of Alice's card, then the following N lines means that of Bob's.
OutputFor each case, the first line is a number N which means the number of cards that Alice and Bob have respectively. Each of the following N (N <= 100,000) lines contains two integers h (h <= 1,000,000,000) and w (w <= 1,000,000,000) which means the height and width of Alice's card, then the following N lines means that of Bob's.
For each test case, output an answer using one line which contains just one number.
Sample Input221 23 42 34 532 35 76 84 12 53 4
12
2012 ACM/ICPC Asia Regional Changchun Online
问题链接:HDU4268 Alice and Bob
问题简述:Alice和Bob各有n个矩形,Alice的矩形覆盖多少Bob的矩形。矩形是由高度h和宽度w给出的。
问题分析:
这个问题被归类为贪心,其实就是个排序匹配问题。数一下Alice的矩形覆盖多少Bob的矩形,要尽可能地多。
这需要一个一个去试探,每次尽量匹配尽可能大并且最为接近的矩形。
矩形按照高度和宽度分别排序。
先匹配高度,再匹配宽度。
矩形用pair类型表示,对于排序来说是方便的,代码比较简洁。
集合类multiset不同于set,允许元素重复。同时需要注意的是,集合中的元素已经从小到大排过序。
函数(方法)upper_bound的用法也需要事先掌握。
题记:(略)
参考链接:(略)
AC的C++语言程序如下:
/* HDU4268 Alice and Bob */#include <iostream>#include <algorithm>#include <set>#include <stdio.h>using namespace std;const int N = 1e5;typedef pair<int, int> rect;rect a[N], b[N];int main(){ int t, n; scanf("%d", &t); while(t--) { multiset<int> s; scanf("%d", &n); for(int i=0; i<n; i++) scanf("%d%d", &a[i].first, &a[i].second); for(int i=0; i<n; i++) scanf("%d%d", &b[i].first, &b[i].second); sort(a, a + n); sort(b, b + n); int ans = 0; for(int i=0, j=0; i<n; i++) { while(j<n && a[i].first >= b[j].first) { s.insert(b[j].second); j++; } set<int>::iterator iter = s.upper_bound(a[i].second); if(s.size() > 0 && iter != s.begin()) iter--; if(s.size() > 0 && *iter <= a[i].second) { ans++; s.erase(iter); } } printf("%d\n", ans); } return 0;}
阅读全文
0 0
- HDU4268 Alice and Bob【贪心+SET】
- HDU4268 Alice and Bob 【贪心】
- hdu4268 排序贪心Alice and Bob
- hdu4268 Alice and Bob(贪心)
- hdu4268 Alice and Bob
- HDU4268 Alice and Bob
- hdu4268 Alice and Bob
- hdu4268 Alice and Bob
- hdu4268 Alice and Bob,multiset
- hdu 4268 Alice and Bob (set+贪心)
- HDU 4268 Alice and Bob (set+贪心)
- hdoj 4268 Alice and Bob 【贪心 + set】
- hdu4268 Alice and Bob 长春网络赛
- [STL][multiset] hdu4268 Alice and Bob
- HDU 4268 Alice and Bob 贪心+set应用
- 【set+贪心】HDU 4268——Alice and Bob
- HDU4268 2012ACM长春赛区网络赛 Alice and Bob
- hdu4268 Alice and Bob(二维贪心的固定思想 STL的multiset的二分查找函数实现)
- 关于注释,JS的关键字,和对象的定义
- 建造者模式
- index索引
- FFMPEG学习【libavutil】:音频相关(一)
- C++之迭代器介绍
- HDU4268 Alice and Bob【贪心+SET】
- DNSChef的使用
- Swift基础之使用Alamofire库进行网络请求和断点下载
- Scala之部分应用函数
- js正则分割字符串
- JavaScript中的关键字和保留字
- C++重载运算符的规则详解
- Mysql中那些锁机制之InnoDB
- 无监督机器学习:超越规则引擎和有监督机器学习的反欺诈分析方法