# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
685907 | Alihan_8 | Trampoline (info1cup20_trampoline) | C++17 | 522 ms | 1048576 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.
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r, c, n; cin >> r >> c >> n;
set <int> st[r];
for ( int i = 1; i <= n; i++ ){
int x, y; cin >> x >> y;
st[--x].insert(--y);
}
int t; cin >> t;
while ( t-- ){
int xs, ys, xe, ye;
cin >> xs >> ys >> xe >> ye;
if ( xs > xe ){
cout << "No\n";
continue;
}
xs--, xe--, ys--, ye--;
bool flag = true;
while ( xs < xe ){
auto it = st[xs].lower_bound(ys);
if ( it == st[xs].end() or *it > ye ){
flag = false;
break;
}
ys = *it;
xs++;
}
if ( flag ) cout << "Yes\n";
else cout << "No\n";
}
cout << '\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... |