zoukankan      html  css  js  c++  java
  • HDU4268 Alice and Bob(贪心+multiset)

    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.
     
    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
    2
     
    Source

    一开始用了贪心以后想用alice的最小w从bob最小w开始选,答案当然错了,应该用alice的最小w去选bob尽可能大的w。用了两个for,超时,于是用multiset,让时间复杂度瞬间降低,应该变成O(n)了。

     1 #include<stdio.h>
     2 #include<iostream>
     3 #include<string>
     4 #include<cstring>
     5 #include<algorithm>
     6 #include<queue>
     7 #include<set>
     8 
     9 using namespace std;
    10 
    11 struct card
    12 {
    13     int h,w;    
    14 };
    15 
    16 int cmp(card a,card b)
    17 {
    18     if(a.h==b.h)
    19     {
    20         return a.w<b.w;
    21     }
    22     return a.h<b.h;
    23 }
    24 
    25 int main()
    26 {
    27     int k,m,q,t,p,n;
    28     int T;
    29     cin>>T;
    30     while(T--)
    31     {
    32         int ans=0;
    33         card a[100000],b[100000];
    34         multiset<int> ms;
    35         multiset<int>::iterator it;
    36         
    37         cin>>n;
    38         for(int i=0;i<n;++i)
    39         {
    40             scanf("%d %d",&a[i].h,&a[i].w);
    41         }
    42         for(int i=0;i<n;++i)
    43         {
    44             scanf("%d %d",&b[i].h,&b[i].w);
    45         }
    46         
    47         sort(a,a+n,cmp);
    48         sort(b,b+n,cmp);
    49         
    50          int i=0,j=0;
    51          for(;i<n;++i)
    52          {
    53             while(j<n&&(a[i].h>=b[j].h))
    54             {
    55                 ms.insert(b[j].w);
    56                 ++j;
    57             }
    58             if(ms.empty())
    59             {
    60                 continue;
    61             }
    62             
    63             it=ms.upper_bound(a[i].w);
    64             if(it==ms.begin())
    65             {
    66                 continue;
    67             }else
    68             {
    69                 --it;
    70                 ++ans;
    71                 ms.erase(it);
    72             }
    73             
    74          }
    75          cout<<ans<<endl;
    76          
    77     }
    78     return 0;
    79 }
  • 相关阅读:
    JAVA对象之生
    单表扫描,MySQL索引选择不正确 并 详细解析OPTIMIZER_TRACE格式
    [MySQL 5.6] 初识5.6的optimizer trace
    [MySQL5.6] 一个简单的optimizer_trace示例
    PERFORMANCE_SCHEMA 详解
    MetaData Lock 杨奇龙 ---MYSQL博客专家
    ArcEngine控制台应用程序
    一位数据科学家的私房工具清单
    数据可视化之热力图
    数据可视化之MarkPoint
  • 原文地址:https://www.cnblogs.com/Traveller-Leon/p/4861007.html
Copyright © 2011-2022 走看看