Submission #1156117

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156117		vladilius	Matryoshka (JOI16_matryoshka)	C++20	11 / 100	1 ms	328 KiB

matryoshka

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, q; cin>>n>>q;
    vector<pii> all = {{}};
    for (int i = 1; i <= n; i++){
        int x, y; cin>>x>>y;
        all.pb({x, y});
    }
    sort(all.begin() + 1, all.end());
    vector<int> a(n + 1), b(n + 1);
    for (int i = 1; i <= n; i++){
        a[i] = all[i].ff; b[i] = all[i].ss;
    }
    while (q--){
        int l, r; cin>>l>>r;
        priority_queue<int, vector<int>, greater<int>> pq;
        int i = 1;
        while (i <= n){
            int j = i;
            while (j <= n && a[i] == a[j]){
                j++;
            }
            
            if (l <= a[i]){
                for (int t = i; t < j; t++){
                    if (b[t] > r) continue;
                    if (!pq.empty()){
                        int f = pq.top();
                        if (f < b[t]){
                            pq.pop();
                        }
                    }
                }
                for (int t = i; t < j; t++){
                    if (b[t] > r) continue;
                    pq.push(b[t]);
                }
            }
            i = j;
        }
        
        cout<<pq.size()<<"\n";
    }
}

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