#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define fr(i,ii,iii) for(int i=ii;i<iii;i++)
const int N=2002;
int n,m,q;
pii p[N];
int f[N];
int main(){
ios_base::sync_with_stdio(NULL);cin.tie(NULL);
cin>>n>>m>>q;
fr(i,1,m+1)cin>>p[i].ff>>p[i].ss;
sort(p+1,p+m+1);
fr(i,0,q){
int x,y;cin>>x>>y;
int l=0;
fr(i,1,m+1){
if(p[i].ff>=x){
l=p[i].ff;
break;
}
}
if(l>x){
cout<<"NO\n";
continue;
}
fr(i,1,m+1){
if(p[i].ff-1<=l and p[i].ss>=l)l=p[i].ss;
if(l>=y)break;
}
cout<<(l==y?"YES":"NO")<<"\n";
}
}
/*
6 2 1
1 2
3 4
1 4
l=0,1,2,4
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |