Submission #1010167

#TimeUsernameProblemLanguageResultExecution timeMemory
1010167LCJLYTrampoline (info1cup20_trampoline)C++14
11 / 100
2086 ms22880 KiB
#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; 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...