This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx=5009;
const int mod= 1e9+7 ;
const ll inf=1e12+4;
//***while there is life there is hope
int r,c,n;
int main() {
//ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>r>>c>>n;
int rr[n];
int cc[n];
//map<int,vector<int>>row;
for(int i=0;i<n;i++){
cin>>rr[i]>>cc[i];
// row[rr[i]].push_back(cc[i]);
}
/* for(ll i=1;i<=r;i++){
// sort(row[i].begin(),row[i].end());
}*/
int t;
cin>>t;
while(t--){
ll x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
int ans=0;
if(x1<=x2&&y1<=y2){
if(x2-x1==1){
for(int i=0;i<n;i++){
if(rr[i]==x1&&cc[i]>=y1&&cc[i]<=y2){
ans=1;
}
}
}else{
}if(ans){cout<<"Yes"<<endl;}else{cout<<"No"<<"\n";}
}
}
}
# | 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... |