# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299653 | E869120 | Trampoline (info1cup20_trampoline) | C++14 | 1384 ms | 69116 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>
using namespace std;
// Input
int H, W;
int N, X[1 << 18], Y[1 << 18];
int Q, SX[1 << 18], SY[1 << 18], EX[1 << 18], EY[1 << 18];
// Compress
map<pair<int, int>, int> Map;
vector<int> GX;
vector<int> V[1 << 18];
// Graph
int par[1 << 18][33];
bool query(int sx, int sy, int gx, int gy) {
if (sx > gx) return false;
if (sy > gy) return false;
if (sx == gx) return true;
int pos1 = lower_bound(GX.begin(), GX.end(), sx) - GX.begin();
if (pos1 == (int)GX.size() || GX[pos1] != sx) return false;
int pos2 = lower_bound(V[pos1].begin(), V[pos1].end(), sy) - V[pos1].begin();
if (pos2 == (int)V[pos1].size()) return false;
int pos = Map[make_pair(sx, V[pos1][pos2])];
int rem = gx - sx - 1;
for (int i = 30; i >= 0; i--) {
if (rem >= (1 << i)) { rem -= (1 << i); pos = par[pos][i]; }
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... |