Submission #73991915

---

Source Code Expand

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

#define int long long

void solve(){
    
    int n, m, q, t;

    cin >> n >> m >> q >> t;

    vector<int> a(n + 1, 0);

    for(int i = 0; i < m; i++){
        int x; cin >> x;
        a[x]++;
    }

    vector<int> psum(n + 2, 0);

    for(int i = 0; i <= n; i++){
        psum[i + 1] = psum[i] + a[i];
    }

    while(q--){
        int l, r; cin >> l >> r;

        int cnt = psum[r + 1] - psum[l];

        if(cnt >= t){
            cout << "YES" << endl;
        }else{
            cout << "NO" << endl;
        }
    }


}

signed main(){

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();
}

Submission Info

Judge Result