Submission #1181982

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181982		al95ireyiz	Osumnjičeni (COCI21_osumnjiceni)	C++20	0 / 110	1098 ms	44968 KiB

Main

// It's the evening of another day. And the end of mine...
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#include<bits/stdc++.h>
using namespace std;
// #include<ext/pb_ds/assoc_container.hpp> \
#include<ext/pb_ds/tree_policy.hpp> \
using namespace __gnu_pbds; \
template<class T> \
using Tree=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statisticslmode_update>;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
string sp=" ";
#define F ୨୧
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define mkp make_pair
#define qll queue<ll>
#define dqll deque<ll>
#define mll map<ll,ll>
#define vll vector<ll>
#define pll pair<ll,ll>
#define ull unsigned ll
#define mne min_element
#define mxe max_element
#define rs(x)resize(x)
#define vpll vector<pll>
#define vvll vector<vll>
#define pq priority_queue
#define len(x)(ll)x.size()
#define lcm(x,y)x/gcd(x,y)*y
#define all(x)x.begin(),x.end()
#define umll unordered_map<ll,ll>
#define lg2(x)(63ll-__builtin_clzll(x))
#define precision(x)fixed<<setprecision(x)
#define popcnt(x)(ll)__builtin_popcountll(x)
template<typename t1,typename t2>istream&operator>>(istream&is,pair<t1,t2>&x){return is>>x.fr>>x.sc;}
template<typename t1,typename t2>ostream&operator<<(ostream&os,pair<t1,t2>&x){return os<<x.fr<<' '<<x.sc;}
template<typename t1>istream&operator>>(istream&is,vector<t1>&vc){for(t1&j:vc)is>>j;return is;}
template<typename t1>ostream&operator<<(ostream&os,vector<t1>&vc){for(t1&j:vc)os<<j<<sp;return os;}
// #define ll int_fast32_t
// #define ll int_fast64_t
// #pragma GCC optimize("O2")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
const ll INF=1e9;
const ll INFL=1e18;
const ll MOD=1e9+7;
// const ll MOD=998244353;
const ll maxn=1e5+5;
ll n,m,k=0;
inline void prc(){}
struct SegTree {
    vector<ll> tree, lazy;
    ll size;
    
    SegTree(ll n) {
        size = 1;
        while(size < n) size *= 2;
        tree.resize(2 * size, 0);
        lazy.resize(2 * size, 0);
    }
    
    void push(ll x, ll lx, ll rx) {
        if(lazy[x] == 0) return;
        tree[x] += lazy[x];
        if(rx - lx > 1) {
            lazy[2*x+1] += lazy[x];
            lazy[2*x+2] += lazy[x];
        }
        lazy[x] = 0;
    }
    
    void update(ll l, ll r, ll v, ll x, ll lx, ll rx) {
        push(x, lx, rx);
        if(lx >= r || rx <= l) return;
        if(lx >= l && rx <= r) {
            lazy[x] += v;
            push(x, lx, rx);
            return;
        }
        ll mid = (lx + rx) >> 1;
        update(l, r, v, 2*x+1, lx, mid);
        update(l, r, v, 2*x+2, mid, rx);
        tree[x] = max(tree[2*x+1], tree[2*x+2]);
    }
    
    ll query(ll l, ll r, ll x, ll lx, ll rx) {
        push(x, lx, rx);
        if(lx >= r || rx <= l) return 0;
        if(lx >= l && rx <= r) return tree[x];
        ll mid = (lx + rx) >> 1;
        return max(query(l, r, 2*x+1, lx, mid),
                  query(l, r, 2*x+2, mid, rx));
    }
    
    void upd(ll l, ll r, ll v) { update(l, r, v, 0, 0, size); }
    ll get(ll l, ll r) { return query(l, r, 0, 0, size); }
};

void _(ll&tt){
    cin>>n;
    vpll v(n+1);
    mll comp;
    for(ll i=1;i<=n;i++){
        cin>>v[i].fr>>v[i].sc;
        comp[v[i].fr]++;
        comp[v[i].sc]++;
    }
    ll cp = 0;
    for(auto &[k, v] : comp){
        cp++;
        v = cp;
    }
    for(ll i=1;i<=n;i++){
        v[i].fr = comp[v[i].fr], v[i].sc = comp[v[i].sc];
    }
    SegTree st(cp + 6);
    cin>>m;
    vvll q(m, vll(3));
    for(ll i=0;i<m;i++){
        cin>>q[i][0]>>q[i][1];
        q[i][2] = i;
    }
    sort(all(q));
    vll cv(m);
    ll l=q[0][0], r=q[0][1];
    for(ll i=l;i<=r;i++){
        st.upd(v[i].fr, v[i].sc+1, 1);
    }
    cv[q[0][2]] = st.get(0, cp + 6);
    for(ll i=1;i<m;i++){
        d(q[i], l, r);
        while(q[i][0] > l) st.upd(v[l].fr, v[l].sc+1, -1), l++;
        while(q[i][1] < r) st.upd(v[r].fr, v[r].sc+1, -1), r--;
        while(q[i][1] > r) r++, st.upd(v[r].fr, v[r].sc+1, 1);
        cv[q[i][2]] = st.get(0, cp + 6);
    }
    for(ll i=0;i<m;i++) cout<<cv[i]<<'\n';
}
signed main(){
    clock_t testcaseruntime=clock();
    cin.tie(0)->sync_with_stdio(0);
    prc();
    ll t=1;
    // cin>>t;
    for(ll tt=1;tt<=t;tt++){
        // cout<<"Case "<<tt<<": ";
        _(tt);
    }
    cerr<<"\n\033[1;31mTime: \033[1;30m"<<(double)(clock()-testcaseruntime)/CLOCKS_PER_SEC<<"\033[1;32m seconds"<<'\n';
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 50