Submission #845303

#TimeUsernameProblemLanguageResultExecution timeMemory
845303jamkel19Trampoline (info1cup20_trampoline)C++14
0 / 100
28 ms1872 KiB
#include <bits/stdc++.h> using namespace std; #define st first #define nd second typedef long long ll; int main() { ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); int n,m,g,q; cin>>n>>m>>g; vector<vector<int>>a(n); int x,y; for(int i=0;i<g;i++) { cin>>x>>y; a[x-1].push_back(y-1); } cin>>q; int x1,x2,y1,y2; bool p=true; int start,meta,s; while(q--) { cin>>x1>>y1>>x2>>y2; x1--;x2--;y1--;y2--; p=true; if(x2<x1 or y2<y1) { p=false; } else { for(int i=x1;i<x2;i++) { start=0;meta=a[i].size()-1;s=(start+meta)/2; while(start<meta) { if(a[i][s]<y1) { start=s+1; } else { meta=s; } s=(start+meta)/2; } if(a[i].size()>0) { if(a[i][s]>=y1 && a[i][s]<=y2) { y1=a[i][s]; } else { p=false; break; } } else { p=false; break; } } } if(p) { cout<<"Yes"<<endl; } else { cout<<"No"<<endl; } } }
#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...