# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
992310 | ramalzaher | 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.
x#include <bits/stdc++.h>
#define ll long long
#define sz size()
#define pb push_back
#define all(x) x.begin() , x.end()
using namespace std;
bool check(vector<int> &a){
for (int i = 0; i < a.size()-1 ; i++)
{
if(a[i] > a[i+1] ) return 0 ;
}
return 1 ;
}
int main()
{
int r , c , n ; cin >> r >>c >> n ;
map<int,set<int>>mp;
for (int i = 0; i < n; i++)
{
int a, b ; cin >> a >> b;
mp[a].insert(b) ;
}
int t ; cin >> t;
for (int i = 0; i < t; i++)
{
vector<int> v ; bool ok= 0 ;
int sx , sy , ex , ey ; cin >> sx >> sy >> ex >> ey;
v.pb(sy);
for(int j = sx ; j < ex ; j ++ ){
auto itt = mp[j].lower_bound(sy) ;
if(itt==mp[j].end()) { v.pb(-1);ok=1; break ; }
v.pb(*itt) ;
sy = *itt ;
//cout<<sy<<" " ;
}
v.pb(ey);
//for(auto it : v)cout<<it<<" ";//cout<<endl;
if(ey >= sy && ok == 0 )cout<<"Yes\n"; else cout<<"No\n";
}
return 0;
}