제출 #1112929

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1112929		Aviansh	Curtains (NOI23_curtains)	C++17	9 / 100	1561 ms	5000 KiB

curtains

#include <bits/stdc++.h>

using namespace std;

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m,q;
    cin >> n >> m >> q;
    vector<array<int,2>>events[n+1];
    for(int i = 0;i<m;i++){
        int a,b;
        cin >> a >> b;
        events[a].push_back({a,b});
        events[b].push_back({a,b});
    }
    while(q--){
        int a,b;
        cin >> a >> b;
        int minima = a;
        priority_queue<int,vector<int>,greater<int>>mins;
        bool work = 1;
        for(int i = a;i<=b;i++){
            for(array<int,2>a:events[i]){
                if(a[0]==i)
                    mins.push(a[1]);
            }
            if(mins.size()==0){
                work=false;
                break;
            }
            minima=max(minima,mins.top());
            while(mins.size()&&mins.top()==i){
                mins.pop();
            }
        }
        if(minima==b&&work){
            cout << "YES\n";
        }
        else{
            cout << "NO\n";
        }
    }
    return 0;
}

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