제출 #1203804

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1203804		Mighilon	Osumnjičeni (COCI21_osumnjiceni)	C++20	0 / 110	443 ms	2632 KiB

Main

#include <bits/stdc++.h>
using namespace std;
 
#ifdef DEBUG
#include "../Library/debug.h"
#else
#define dbg(x...)
#endif
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
 
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i)
#define trav(a, x) for (auto& a : x)
#define f first 
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
 
const char nl = '\n';
const int INF = 1e9;
const int MOD = 1e9 + 7;

void solve(){
    int n;
    cin>>n;
    vpi a(n);
    F0R(i,n)cin>>a[i].f>>a[i].s;
    int q;
    cin>>q;
    auto check=[](int a, int b, int c, int d)->bool{
        return (c<=a&&a<=d)||(c<=b&&b<=d);
    };
    F0R(_,q){
        int l, r;
        cin>>l>>r;
        r--;l--;
        set<pair<pi,int>> st;
        vi nxt(n,-1);
        FOR(i,l,r+1){
            if(!st.empty()){
                auto it=st.upper_bound({a[i],-1});
                if(it==st.end())
                    it=prev(it);
                while(check(it->f.f,it->f.s, a[i].f,a[i].s)){
                    nxt[it->s]=i;
                    if(it==st.begin()){
                        st.erase(it);
                        break;
                    }
                    it=prev(it);
                    st.erase(next(it));
                }
            }
            st.insert({a[i],i});
        }
        ll ans=1;
        vb vis(n,0);
        int j=l;
        FOR(i,l,r+1){
            if(vis[i]){
                ans++;
                while(j<i){
                    if(nxt[j]!=-1)
                        vis[nxt[j]]=0;
                    j++;
                }
            }
            if(nxt[i]!=-1)
                vis[nxt[i]]=1;
        }
        cout<<ans<<nl;
    }
}
 
int32_t main(){
    ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    
    int TC = 1;
    // cin >> TC;
    while(TC--){
        solve();
    }
    return 0;
}

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