zoukankan      html  css  js  c++  java
  • hdu 4268 Alice and Bob

    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. 
     
    Input
    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. 
     
    Output
    For each test case, output an answer using one line which contains just one number. 
     
    Sample Input
    2
    2
    1 2
    3 4
    2 3
    4 5
    3
    2 3
    5 7
    6 8
    4 1
    2 5
    3 4 


    Sample Output
    1


    分析:

    贪心思想,需要利用到set。



    今天学习了下set,STL真强大。将Alice的card标记为id = 0,Bob的card标记为1。将所


    有的纸片按照h,w的升序排序,按照id的降序排序,也就是在相同情况下将Bob的纸片放


    前面。然后将Bob的纸片的w插入set,贪心选取Alice比Bob的纸片w大一点的来覆盖,然


    后删掉被覆盖的纸片。

    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    #include <set>
    using namespace std;
    
    const int MAXN = 200100;
    typedef multiset<int> SET;
    typedef multiset<int> :: iterator P;
    struct node
    {
        int h,w,id;
        bool operator < (const node &b) const
        {
            if (h!=b.h) return h<b.h;
            if (w!=b.w) return w<b.w;
            return id>b.id;   //排序过程
        }
    };
    node a[MAXN];
    SET d;
    int main()
    {
        int n,t,i,ans;
        scanf("%d",&t);
        while (t--)
        {
            scanf("%d",&n);
            for (i=1;i<=n*2;i++)
            {
                scanf("%d%d",&a[i].h,&a[i].w);
                if (i>n) a[i].id=1;
                else a[i].id=0;
            }
            sort(a+1,a+n*2+1);
            d.clear();
            ans=0;
            for (i=1;i<=n*2;i++)
            {
                if (a[i].id) d.insert(a[i].w);
                else
                if (! d.empty()&&*d.begin()<=a[i].w)
                {
                    P p=d.upper_bound(a[i].w);//取上限
                    ans++;
                    p--;  //变成小于a[i].w的最大值
                    d.erase(p);
                }
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
    


  • 相关阅读:
    【扫盲】i++和++i的区别
    java 字符串String.intern()方法学习
    随机访问和快速访问
    Semaphore信号量深度解析
    CyclicBarrier回环屏障深度解析
    CountDownLatch深度剖析
    静态代理和装饰者模式的区别
    AspectJ之@DeclareParents注解为对象添加新方法
    C#开发上位机常用
    使用Charles进行抓包、篡改请求、设置代理
  • 原文地址:https://www.cnblogs.com/aukle/p/3217652.html
Copyright © 2011-2022 走看看