# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
727416 | model_code | Mizuyokan 2 (JOI23_mizuyokan2) | C++17 | 1895 ms | 76236 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 <vector>
using std::pair;
using std::vector;
using std::max;
using std::min;
#include <cmath>
using std::abs;
typedef long long int ll;
typedef pair<ll, ll> P;
ll n, m, q, k;
const ll maxl = 81;
const ll base = (1LL << 18);
ll val[base];
ll jumpfrom[base];
ll exactrtol[base];
vector<P> seg[base * 2];
P seglr[base * 2];
ll findexactrtol (ll r) {
// rightest 0 <= l <= r-2 for minor seq (l, r)
// l >= 0, so [0, r) doesn't count
// if (len(minor seq) <= maxl) cannot be satisfied, -1
// O(log A)
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... |