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;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef array<int,3>pi2;
void solve(){
int n,m,k;
cin >> n >> m >> k;
pii arr[k];
unordered_map<int,vector<int>>mp;
for(int x=0;x<k;x++){
cin >> arr[x].first >> arr[x].second;
mp[arr[x].first].push_back(arr[x].second);
}
for(auto &it:mp){
sort(it.second.begin(),it.second.end());
}
int q;
cin >> q;
pii st,ed;
for(int x=0;x<q;x++){
cin >> st.first >> st.second >> ed.first >> ed.second;
int cur=st.second;
bool amos=true;
if(st.first>st.second) amos=false;
for(int y=st.first;y<ed.first;y++){
int index=lower_bound(mp[y].begin(),mp[y].end(),cur)-mp[y].begin();
if(index>=(int)mp[y].size()){
amos=false;
break;
}
cur=mp[y][index];
}
if(amos&&cur<=ed.second){
cout << "Yes\n";
}
else cout << "No\n";
}
}
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin >> t;
//freopen("in.txt","w",stdout);
while(t--){
solve();
}
}
# | 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... |