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>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> veci;
typedef vector<ll> vecll;
#define fi first
#define se second
// debug needs a semicolon!!!
#define debug(x) cerr<<# x<<" is "<<x<<'\n'
#define vec vector
#define pq priority_queue
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int r, c, t;
cin >> r >> c >> t;
set<int> green[r];
while (t--) {
int rr, cc;
cin >> rr >> cc;
green[rr-1].insert(cc-1);
}
int q;
cin >> q;
while (q--) {
int xs, ys, xe, ye;
cin >> xs>> ys>> xe>> ye;
xs--;
xe--;
ys--;
ye--;
int currrow=xs, currcol=ys;
bool madeit=true;
while (currrow < xe) {
auto it=green[currrow].lower_bound(currcol);
if (it == green[currrow].end()) {
madeit = false;
break;
}
if (*(it) > ye) {
madeit = false;
break;
}
currrow++;
currcol = *it;
}
if (madeit) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
}
# | 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... |