# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
387586 | casperwang | Trampoline (info1cup20_trampoline) | C++14 | 1152 ms | 54204 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>
#define pb emplace_back
#define All(x) x.begin(), x.end()
#define pii pair<int,int>
#define ff first
#define ss second
#define y1 y_1
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }
const int MAXN = 200000;
const int L = 30;
int N, R, C, T;
pii pts[MAXN+1];
int x1, y1, x2, y2;
map <int, set<pii>> arr;
int anc[MAXN+1][L];
void build() {
for (int i = 1; i <= N; i++) {
auto [x, y] = pts[i];
arr[x].insert(pii(y, i));
}
for (int i = 1; i <= N; i++) {
auto [x, y] = pts[i];
if (!arr.count(x-1)) continue;
auto it = arr[x-1].upper_bound(pii(y, N+1));
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... |