# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
675194 | vjudge1 | Trampoline (info1cup20_trampoline) | C++17 | 770 ms | 46604 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.
// BEGIN BOILERPLATE CODE
#include <bits/stdc++.h>
using namespace std;
#ifdef KAMIRULEZ
const bool kami_loc = true;
const long long kami_seed = 69420;
#else
const bool kami_loc = false;
const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif
const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);
long long rand_range(long long rmin, long long rmax) {
uniform_int_distribution<long long> rdist(rmin, rmax);
return rdist(kami_gen);
}
long double rand_real(long double rmin, long double rmax) {
uniform_real_distribution<long double> rdist(rmin, rmax);
return rdist(kami_gen);
}
void file_io(string fi, string fo) {
if (fi != "" && (!kami_loc || fi == kami_fi)) {
freopen(fi.c_str(), "r", stdin);
}
if (fo != "" && (!kami_loc || fo == kami_fo)) {
freopen(fo.c_str(), "w", stdout);
}
}
void set_up() {
if (kami_loc) {
file_io(kami_fi, kami_fo);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
}
void just_do_it();
void just_exec_it() {
if (kami_loc) {
auto pstart = chrono::steady_clock::now();
just_do_it();
auto pend = chrono::steady_clock::now();
long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
string bar(50, '=');
cout << '\n' << bar << '\n';
cout << "Time: " << ptime << " ms" << '\n';
}
else {
just_do_it();
}
}
int main() {
set_up();
just_exec_it();
return 0;
}
// END BOILERPLATE CODE
// BEGIN MAIN CODE
const int ms = 2e5 + 20;
const int st = 20;
map<int, set<pair<int, int>>> f;
int px[ms];
int py[ms];
int nxt[ms][st];
int get(int px, int py) {
auto it1 = f.find(px);
if (it1 == f.end()) {
return 0;
}
auto it2 = it1->second.lower_bound(make_pair(py, -1));
if (it2 == it1->second.end()) {
return 0;
}
return it2->second;
}
void just_do_it() {
int n;
cin >> n >> n >> n;
for (int i = 1; i <= n; i++) {
cin >> px[i] >> py[i];
f[px[i]].insert({py[i], i});
}
for (int u = 1; u <= n; u++) {
nxt[u][0] = get(px[u] + 1, py[u]);
}
for (int k = 1; k < st; k++) {
for (int u = 1; u <= n; u++) {
nxt[u][k] = nxt[nxt[u][k - 1]][k - 1];
}
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
if (sx == tx) {
if (sy <= ty) {
cout << "Yes" << '\n';
}
else {
cout << "No" << '\n';
}
continue;
}
else if (sx > tx) {
cout << "No" << '\n';
continue;
}
int u = get(sx, sy);
for (int k = 0; k < st; k++) {
if (((tx - sx - 1) >> k) & 1) {
u = nxt[u][k];
}
}
if (u == 0) {
cout << "No" << '\n';
continue;
}
if (py[u] <= ty) {
cout << "Yes" << '\n';
}
else {
cout << "No" << '\n';
}
}
}
// END MAIN CODE
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... |