제출 #1283358

#제출 시각아이디문제언어결과실행 시간메모리
1283358soabCurtains (NOI23_curtains)C++20
9 / 100
1596 ms8628 KiB
// soab

#include <bits/stdc++.h>

using namespace std;

#define int long long 
#define nl '\n'
#define fi first
#define se second

void io() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
}   

const int MAXN = 3 * 1e5 + 1;
int n, m, q;

vector<pair<int,int>> ctain(MAXN);

bool check(int l, int r) {
    vector<pair<int,int>> v;
    for(int i = 0; i < m; i++) {
        if(ctain[i].fi >= l && ctain[i].se <= r) {
            v.push_back(ctain[i]);
        }
    }

    sort(v.begin(), v.end());
    if(v.empty() || v[0].fi > l) return 0;

    int cur = l;
    for(auto [st, en] : v) {
        if(st <= cur + 1) {
            cur = max(cur, en);
        } else return 0;
    }
    return cur == r;
}

void sub2() {
    for(int i = 0; i < q; i++) {
        int l, r; cin >> l >> r;
        cout << (check(l, r)? "YES" : "NO") << nl;
    }
}

signed main() {
    io();

    cin >> n >> m >> q;
    for(int i = 0; i < m; i++) {
        cin >> ctain[i].fi >> ctain[i].se;
    }

    sub2();
    
    return 0;
}   
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...