library

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub beet-aizu/library

:heavy_check_mark: test/aoj/2969.test.cpp

Depends on

Code

// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2969

#include<bits/stdc++.h>
using namespace std;

#define call_from_test
#include "../../tools/chminmax.cpp"
#include "../../segtree/basic/ushi.cpp"
#include "../../vector/compress.cpp"
#include "../../vector/fusion.cpp"
#include "../../vector/near.cpp"
#include "../../vector/sorted.cpp"
#include "../../vector/zip.cpp"
#undef call_from_test


signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  using ll = long long;

  int n;
  ll lim;
  cin>>n>>lim;
  vector<ll> ls(n),rs(n);
  for(int i=0;i<n;i++) cin>>ls[i]>>rs[i];

  auto dc=dict(compress(fusion(near(ls,0,1),near(rs,-1,0))));
  int m=dc.size();

  auto f=[&](int a,int b){return min(a,b);};
  SegmentTree<int> seg(f,n+3);
  seg.build(vector<int>(m,n+2));
  seg.set_val(dc[0],0);

  int res=n;
  for(auto[r,l]:sorted(zip(rs,ls))){
    int val=seg.query(dc[l],dc[r])+1;
    chmin(val,seg.query(dc[r],dc[r]+1));
    seg.set_val(dc[r],val);
    if(r==lim) chmin(res,val);
  }
  cout<<res<<' ';

  vector<int> sm(m,0);
  for(int i=0;i<n;i++){
    sm[dc[ls[i]]]++;
    sm[dc[rs[i]]]--;
  }
  for(int i=0;i+1<m;i++) sm[i+1]+=sm[i];

  cout<<n-*min_element(sm.begin()+dc[0],sm.begin()+dc[lim])+1<<endl;
  return 0;
}
#line 1 "test/aoj/2969.test.cpp"
// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2969

#include<bits/stdc++.h>
using namespace std;

#define call_from_test
#line 1 "tools/chminmax.cpp"

#line 3 "tools/chminmax.cpp"
using namespace std;
#endif
//BEGIN CUT HERE
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif
#line 1 "segtree/basic/ushi.cpp"

#line 3 "segtree/basic/ushi.cpp"
using namespace std;
#endif
//BEGIN CUT HERE
template <typename T>
struct SegmentTree{
  using F = function<T(T,T)>;
  int n;
  F f;
  T ti;
  vector<T> dat;

  SegmentTree(F f,T ti):f(f),ti(ti){}

  void init(int n_){
    n=1;
    while(n<n_) n<<=1;
    dat.assign(n<<1,ti);
  }

  void build(const vector<T> &v){
    int n_=v.size();
    init(n_);
    for(int i=0;i<n_;i++) dat[n+i]=v[i];
    for(int i=n-1;i;i--)
      dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);
  }

  void set_val(int k,T x){
    dat[k+=n]=x;
    while(k>>=1)
      dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]);
  }

  T query(int a,int b){
    if(a>=b) return ti;
    T vl=ti,vr=ti;
    for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {
      if(l&1) vl=f(vl,dat[l++]);
      if(r&1) vr=f(dat[--r],vr);
    }
    return f(vl,vr);
  }

  template<typename C>
  int max_right(int s,C &check,T &acc,int k,int l,int r){
    if(l+1==r){
      acc=f(acc,dat[k]);
      return check(acc)?-1:k-n;
    }
    int m=(l+r)>>1;
    if(m<=s) return max_right(s,check,acc,(k<<1)|1,m,r);
    if(s<=l and check(f(acc,dat[k]))){
      acc=f(acc,dat[k]);
      return -1;
    }
    int vl=max_right(s,check,acc,(k<<1)|0,l,m);
    if(~vl) return vl;
    return max_right(s,check,acc,(k<<1)|1,m,r);
  }

  // max t s.t. check(query(s,t))
  // O(\log N)
  template<typename C>
  int max_right(int s,C &check){
    assert(s<n and check(ti) and not check(query(s,n)));
    T acc=ti;
    return max_right(s,check,acc,1,0,n);
  }
};
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif
#line 1 "vector/compress.cpp"

#line 3 "vector/compress.cpp"
using namespace std;
#endif

//BEGIN CUT HERE
template<typename V>
V compress(V vs){
  sort(vs.begin(),vs.end());
  vs.erase(unique(vs.begin(),vs.end()),vs.end());
  return vs;
}
template<typename T>
map<T, int> dict(const vector<T> &vs){
  map<T, int> res;
  for(int i=0;i<(int)vs.size();i++)
    res[vs[i]]=i;
  return res;
}
map<char, int> dict(const string &s){
  return dict(vector<char>(s.begin(),s.end()));
}
template<typename T>
vector<T> compressed(vector<T> vs){
  auto dc=dict(compress(vs));
  for(auto &v:vs) v=dc[v];
  return vs;
}
//END CUT HERE
#ifndef call_from_test
//INSERT ABOVE HERE
signed main(){
  return 0;
}
#endif
#line 1 "vector/fusion.cpp"

#line 3 "vector/fusion.cpp"
using namespace std;
#endif

//BEGIN CUT HERE
template<typename T, typename ...Ts>
vector<T> fusion(vector<T> bs,Ts... ts){
  auto append=[&](auto vs){for(auto v:vs) bs.emplace_back(v);};
  initializer_list<int>{(void(append(ts)),0)...};
  return bs;
}
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif
#line 1 "vector/near.cpp"

#line 3 "vector/near.cpp"
using namespace std;

#endif
//BEGIN CUT HERE
template<typename T>
vector<T> add(vector<T> vs,vector<T> as){
  assert(vs.size()==as.size());
  for(int i=0;i<(int)vs.size();i++) vs[i]+=as[i];
  return vs;
}

template<typename T, typename U>
vector<T> add(vector<T> vs,U a){
  return add(vs,vector<T>(vs.size(),a));
}

template<typename T>
vector<T> mul(vector<T> vs,vector<T> as){
  assert(vs.size()==as.size());
  for(int i=0;i<(int)vs.size();i++) vs[i]*=as[i];
  return vs;
}

template<typename T, typename U>
vector<T> mul(vector<T> vs,U a){
  return mul(vs,vector<T>(vs.size(),a));
}

template<typename T, typename ...Ts>
vector<T> near(vector<T> vs,Ts... ts){
  vector<T> rs;
  rs.reserve(vs.size()*sizeof...(ts));
  auto append=[&](auto a){
    for(auto w:add(vs,a)) rs.emplace_back(w);
  };
  initializer_list<int>{(void(append(ts)),0)...};
  return rs;
}
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif
#line 1 "vector/sorted.cpp"

#line 3 "vector/sorted.cpp"
using namespace std;
#endif

//BEGIN CUT HERE
template<typename T>
vector<T> sorted(vector<T> vs){
  sort(vs.begin(),vs.end());
  return vs;
}
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif
#line 1 "vector/zip.cpp"

#line 3 "vector/zip.cpp"
using namespace std;
#endif

//BEGIN CUT HERE
template<typename ...Ts>
decltype(auto) zip(vector<Ts>... args){
  vector<decltype(make_tuple(args[0]...))> res;
  int n=min({args.size()...});
  res.reserve(n);
  for(int i=0;i<n;i++) res.emplace_back(args[i]...);
  return res;
}
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif
#line 14 "test/aoj/2969.test.cpp"
#undef call_from_test


signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  using ll = long long;

  int n;
  ll lim;
  cin>>n>>lim;
  vector<ll> ls(n),rs(n);
  for(int i=0;i<n;i++) cin>>ls[i]>>rs[i];

  auto dc=dict(compress(fusion(near(ls,0,1),near(rs,-1,0))));
  int m=dc.size();

  auto f=[&](int a,int b){return min(a,b);};
  SegmentTree<int> seg(f,n+3);
  seg.build(vector<int>(m,n+2));
  seg.set_val(dc[0],0);

  int res=n;
  for(auto[r,l]:sorted(zip(rs,ls))){
    int val=seg.query(dc[l],dc[r])+1;
    chmin(val,seg.query(dc[r],dc[r]+1));
    seg.set_val(dc[r],val);
    if(r==lim) chmin(res,val);
  }
  cout<<res<<' ';

  vector<int> sm(m,0);
  for(int i=0;i<n;i++){
    sm[dc[ls[i]]]++;
    sm[dc[rs[i]]]--;
  }
  for(int i=0;i+1<m;i++) sm[i+1]+=sm[i];

  cout<<n-*min_element(sm.begin()+dc[0],sm.begin()+dc[lim])+1<<endl;
  return 0;
}
Back to top page