제출 #1174402

#제출 시각아이디문제언어결과실행 시간메모리
1174402ezzzayCurtains (NOI23_curtains)C++20
0 / 100
1 ms328 KiB
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
const int N=1e6+5;
signed main(){
    int n,m,q;
    cin>>n>>m>>q;
    vector<pair<int,int>>v;
    for(int i=1;i<=m;i++){
        int l,r;
        cin>>l>>r;
        v.pb({l,r});
    }
    sort(v.begin(),v.end());
   
    while(q--){
        int l,r;
        cin>>l>>r;
        vector<bool> dp(n+2);
        dp[l-1]=1;
        auto it= lower_bound(v.begin(),v.end(), make_pair(l,l));
        int idx= it-v.begin();
        for(int i=idx;i<m;i++){
            auto p=v[i];
            int x=p.ff,y=p.ss;
            if(l<=x and y<=r and dp[x-1]){
                for(int j=x;j<=y;j++){
                    dp[j]=1;
                }
            }
            if(l<x)break;
        }
        if(dp[r]){
            cout<<"YES"<<endl;
        }
        else{
            cout<<"NO"<<endl;
        }
    }
}
#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...