# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
775607 | HD1 | Trampoline (info1cup20_trampoline) | C++14 | 2063 ms | 10024 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.
//we are all lost trying to be someone.
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define sz(x) ll(x.size())
#define reve(x) reverse(x.begin(),x.end())
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
const ll MAX=3*(1e4+100);
const ll mod=1e9+7;
const ll inf=1e18+7;
map<ll,vector<ll>>A;
bool solve(){
ll x1, y1, x2, y2;
cin>>x1>>y1>>x2>>y2;
if(x1>x2 || y1>y2) return false;
if(x1==x2 && y1<=y2) return true;
else{
ll co=y1;
for(ll i=x1; i<x2; i++){
if(!A.count(i)) return false;
ll cov=*lower_bound(A[i].begin(),A[i].end(),co);
if(cov>=co && cov<=y2){
co=cov;
}
else{
return false;
}
}
}
return true;
}
int main(){
ll n, m, t;
cin>>n>>m>>t;
ll a, b;
while(t--){
cin>>a>>b;
A[a].push_back(b);
}
for(auto it: A){
sort(A[it.ff].begin(), A[it.ff].end());
}
ll x1, y1, x2, y2;
cin>>t;
while(t--){
if(solve()) cout<<"Yes"<<'\n';
else cout<<"No"<<'\n';
}
}
Compilation message (stderr)
# | 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... |