Submission #209219

#	Time	Username	Problem	Language	Result	Execution time	Memory
209219		AryaKnight	Exhibition (JOI19_ho_t2)	C++14	100 / 100	422 ms	4568 KiB

joi2019_ho_t2

//#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
//#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
//#pragma GCC target("avx2")  //Enable AVX
#include<bits/stdc++.h>
using namespace std;

#define all(a) begin(a),end(a)
#define F first
#define S second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

void clr(auto &a,int n){
  a.clear();
  a.resize(n);
}

template <typename A, typename B>
istream& operator>>(istream& input,pair<A,B>& x) {
  input>>x.F>>x.S;
  return input;
}

template <typename A>
istream& operator>>(istream& input,vector<A>& x) {
  for(auto& i:x)
    input>>i;
  return input;
}

template<typename A>
ostream& operator<<(ostream& output,vector<A>& x) {
  for(auto& i:x)
    output<<i<<' ';
  return output;
}

template<typename T>
vector<pair<T,int>> getvec(int n){
  vector<pair<T,int>>a(n);
  for(int i=0;i<a.size();i++){
    cin>>a[i].F;
    a[i].S=i;
  }
  return a;
}

const int mod=1e9+7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int mul(int a,int b){
  return ((a)*1ll*(b))%mod;
}

void add(int &a,int b){
  a+=b;
  if(a>=mod)a-=mod;
}

int sub(int a,int b){
  a-=b;
  if(a<0){
    a+=mod;
  }
  return a;
}

int powz(int a,int b){
  int res=1;
  while(b){
    if(b&1){
      res=mul(res,a);
    }
    b/=2;
    a=mul(a,a);
  }
  return res;
}

const int N=200005;

struct SegTree{
  vector<int>t;
  int _=1e9;
  int merge(int x,int y){
    return min(x,y);
  }
  SegTree(int n){
    t.resize(4*n);
    for(auto &i:t){
      i=_;
    }
  }
  
  int query(int v, int tl, int tr, int l, int r) {
    if (l > r) 
      return _;
    if (l == tl && r == tr) {
      return t[v];
    }
    int tm = (tl + tr) / 2;
    return merge(query(v*2, tl, tm, l, min(r, tm))
		 ,query(v*2+1, tm+1, tr, max(l, tm+1), r));
  }
  
  void update(int v, int tl, int tr, int pos, int new_val) {
    if (tl == tr) {
      t[v] = new_val;
    } else {
      int tm = (tl + tr) / 2;
      if (pos <= tm)
	update(v*2, tl, tm, pos, new_val);
      else
	update(v*2+1, tm+1, tr, pos, new_val);
      t[v] = merge(t[v*2],t[v*2+1]);
    }
  }
}; 

void solve(){
  int n,m;
  cin>>n>>m;
  vector<pair<int,int>>a(n);
  for(auto &i:a){
    cin>>i.S>>i.F;
  }
  sort(all(a));
  vi c(m);
  cin>>c;
  sort(all(c));
  vector<int>compress;
  for(auto &i:a){
    compress.pb(i.S);
  }
  for(auto &i:c){
    compress.pb(i);
  }
  sort(all(compress));
  compress.resize(unique(all(compress))-compress.begin());
  for(auto &i:a){
    i.S=lower_bound(all(compress),i.S)-compress.begin();
  }
  for(auto &i:c){
    i=lower_bound(all(compress),i)-compress.begin();
  }
  vector<int>prf;
  int mn=1e9;
  vector<int>nw(n);
  for(int i=0;i<n;i++){
    mn=min(mn,a[i].S);
    nw[i]=mn;
  }
  int lst=n-1;
  int ans=0;
  SegTree st(n);
  for(int i=0;i<n;i++){
    st.update(1,0,n-1,i,a[i].S);
  }
  for(int i=m-1;i>=0;i--){
    int l=0,r=lst,an=0;
    if(st.query(1,0,n-1,0,lst)>c[i]){
      cout<<ans;
      return;
    }
    while(l<=r){
      int mid=(l+r)/2;
      if(st.query(1,0,n-1,mid,lst)<=c[i]){
	l=mid+1;
	an=max(an,mid);
      }
      else{
	r=mid-1;
      }
    }
    ans++;
    lst=an-1;
    if(lst<0){
      cout<<ans;
      return;
    }
  }
  cout<<ans;
}

signed main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc=1;
  //cin>>tc;
  for(int _=0;_<tc;_++){
    // cout<<"Case #"<<_+1<<": ";
    solve();
    if(_!=tc-1){
      cout<<'\n';
    }
  }
}

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50