Submission #1069393

#	Time	Username	Problem	Language	Result	Execution time	Memory
1069393		TB_	Index (COCI21_index)	C++17	110 / 110	1814 ms	212420 KiB

index

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

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF ((ll)(1e9+7))
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << (x) << endl;
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

struct Node{
    Node *lnode, *rnode;
    ll l, r, val = 0;
    Node(ll l, ll r) : l(l), r(r){}
    void construct(){
        if(r-l>1){
            ll mid = (r+l) / 2;
            lnode = new Node(l, mid);
            rnode = new Node(mid, r);
            lnode->construct();
            rnode->construct();
        }
    }

    Node *update(ll lo, ll hi, ll x = 1){ // point update 
        if(r <= lo || hi <= l) return 0;
        Node *current = new Node(l, r);
        current->lnode = lnode;
        current->rnode = rnode;
        if(r <= hi && lo <= l){
            current->val = x;
            return current;
        }
        Node *child = lnode->update(lo, hi);
        if(child) current->lnode = child;
        else current->rnode = rnode->update(lo, hi);
        current->val = current->lnode->val+current->rnode->val;
        return current;
    }  

    ll query(ll lo, ll hi){
        if(r <= lo || hi <= l) return 0;
        if(r <= hi && lo <= l) return val;
        return lnode->query(lo, hi)+rnode->query(lo, hi);
    }
};

int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    int n, q, val;
    cin >> n >> q;
    vpl v;

    fo(i, n){
        cin >> val;
        v.pb({val, i});
    }
    sort(rall(v));
    v.pb({-1, -1});

    vector<Node*> versions = {new Node(0, n)};
    versions[0]->construct();

    map<ll, ll> saved;
    fo(i, n+1){
        if(i && v[i].F != v[i-1].F){
            saved[v[i-1].F] = i;
        }
        if(i == n) break;
        versions.pb(versions[((ll)versions.size())-1]->update(v[i].S, v[i].S+1));
    }

    ll from, to;
    while(q--){
        cin >> from >> to;
        ll lo = 1;
        ll hi = n+10;
        while(hi-lo>1){
            ll mid = (hi+lo) / 2;
            auto ptr = saved.lower_bound(mid);
            if(ptr == saved.end()){
                hi = mid;
                continue;
            }
            ll res = versions[(*ptr).S]->query(from-1, to);
            if(res>=mid) lo = mid;
            else hi = mid;
        }
        cout << lo << "\n";
    }


    return 0;
}

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