# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
482240 | nonsensenonsense1 | New Home (APIO18_new_home) | C++17 | 5083 ms | 17672 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 <cstdio>
#include <utility>
#include <algorithm>
#include <cstring>
#include <vector>
const int INF = 0x3f3f3f3f;
struct store {
int x, t, l, r;
bool operator<(store arg) {
return x < arg.x;
}
};
struct query {
int l, y, ind;
bool operator<(query arg) {
return y < arg.y;
}
};
bool cmp_l(query a, query b)
{
return a.l < b.l;
}
const int N = 300000;
const int K = 300;
int n, k, q, next[N + 1], type_amt[N], ans[N], it[N], fi[N], last[N], right[N], to[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |