제출 #1291421

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291421		1ota	Curtains (NOI23_curtains)	C++20	0 / 100	1 ms	584 KiB

curtains

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

#define endl "\n"
// #define int long long
#define pii pair<int, int>
#define ff first
#define ss second
#define entire(x) (x).begin(), (x).end()

const int inf = 1e9;

int32_t main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);

    int n, m, q; cin >> n >> m >> q;
    vector<pii> curt(m); // [l, r]

    for (auto& [l, r] : curt) cin >> l >> r, l--, r--;

    sort(entire(curt));

    vector<bool> ok(n, false);
    for (int i = 0; i < n; i++){
        
    }

    auto isgood = [&](int s, int e){
        int low = 0, high = m-1;
        while (low < high){
            int mid = (low + high + 1) / 2;
            if (curt[mid].ff < s) low = mid;
            else if (curt[mid].ff == s and curt[mid].ss <= e) low = mid;
            else high = mid-1;
        }
        if (curt[low].ff != s) return false;

        int last = s;
        for (int i = low; i < m; i++){
            if (curt[i].ff - last > 1) break;
            if (curt[i].ss <= e) last = max(last, curt[i].ss);
        }
        return (last == e);
    };

    while (q--){
        int s, e; cin >> s >> e; s--, e--;
        if (isgood(s, e)) cout << "YES" << endl;
        else cout << "NO" << endl;
    }

    return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 15
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36
• Subtask 6: 0 / 20