#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx=300;
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);
cin>>r>>c>>n;
int rr[n];
int cc[n];
vector<int>row[mx];
for(int i=0;i<n;i++){
cin>>rr[i]>>cc[i];
row[rr[i]].push_back(cc[i]);
}int t;
cin>>t;
while(t--){
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
int ans=0;
if(x1<=x2&&y1<=y2){
while(x1<x2){
if(row[x1].empty()){break;}
int nxt=lower_bound(row[x1].begin(),row[x1].end(),y1)-row[x1].begin();
// if(nxt==row[x1].size()||row[x1][nxt]>y2){break;}
y1=row[x1][nxt];
//cout<<"test :"<<x1<<" "<<row[x1][nxt]<<endl;
x1++;
}
if(x1==x2&&y1<=y2){ans=1;}
}if(ans){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
492 KB |
expected NO, found YES [2nd token] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
492 KB |
Execution killed with signal 7 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
492 KB |
Execution killed with signal 7 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
492 KB |
Execution killed with signal 7 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
492 KB |
Execution killed with signal 7 |
2 |
Halted |
0 ms |
0 KB |
- |