# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
775608 | LeaRouse | Trampoline (info1cup20_trampoline) | C++14 | 0 ms | 0 KiB |
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++>
#define ff first
#define ss second
#define ll long long
using namespace std;
const int MAX=2505;
map<int,vector<int>>m;
int imp(int a,int dif,int c){
while(dif--){
c=lower_bound(v[a].begin(),v[a].end(),c);
a++;
}
return c;
}
void go(){
int n, r,c; cin>>r>>c>>n;
for(int i=0;i<n;i++){
int a,b; cin>>a>>b;
m[a].push_back(b);
}
for(auto it:m){
sort(it.ss.begin(),it.ss.end());
}
int t; cin>>t;
while(t--){
int a,b,e,d; cin>>a>>b>>e>>d;
if(a>e or b>d){
cout<<"No"<<endl;
continue;
}
int dif=e-a;
int nc=imp(a,dif,b);
if(nc<=d) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
int main(){
fastio;
go();
return 0;
}