Submission #784771

#	Time	Username	Problem	Language	Result	Execution time	Memory
784771		bachhoangxuan	Matryoshka (JOI16_matryoshka)	C++17	100 / 100	180 ms	20032 KiB

matryoshka

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;
bool cmp(tuple<int,int,int> a,tuple<int,int,int> b){
    if(get<0>(a)!=get<0>(b)) return get<0>(a)<get<0>(b);
    else return get<1>(a)>get<1>(b);
}
void solve(){
    int n,q;cin >> n >> q;
    vector<tuple<int,int,int>> que;
    for(int i=0;i<n;i++){
        int r,h;cin >> r >> h;
        que.emplace_back(h,r,-1);
    }
    vector<int> ans(q);
    for(int i=0;i<q;i++){
        int a,b;cin >> a >> b;
        que.emplace_back(b,-i,a);
    }
    sort(que.begin(),que.end(),cmp);
    deque<int> v;
    for(auto &[x,val,y]:que){
        if(val<=0) ans[-val]=(int)v.size()-(lower_bound(v.begin(),v.end(),y)-v.begin());
        else{
            int pos=lower_bound(v.begin(),v.end(),val)-v.begin();
            if(pos) v[pos-1]=val;
            else v.push_front(val);
        }
    }
    for(int i=0;i<q;i++) cout << ans[i] << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

• Subtask 1: 11 / 11
• Subtask 2: 15 / 15
• Subtask 3: 25 / 25
• Subtask 4: 49 / 49