제출 #1174404

#제출 시각아이디문제언어결과실행 시간메모리
1174404ezzzayCurtains (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;
bool dp[N];
bool vis[N];
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());
    dp[0]=1;
    int mx=0;
    for(auto p:v){
        int l=p.ff,r=p.ss;
        if(l<=mx+1){
            mx=max(mx,r);
        }
        if(r==mx){
            vis[r]=1;
        }
    }
    while(q--){
        int l,r;
        cin>>l>>r;
        if(vis[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...