# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
414928 | Pro_ktmr | Event Hopping 2 (JOI21_event2) | C++17 | 268 ms | 30620 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 <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
constexpr int MAX_N = 100'000;
constexpr int MAX_logN = 18;
constexpr int MAX_LR = 1'000'000'000;
int N, K;
int L[MAX_N], R[MAX_N];
vector<int> z;
vector<int> invL[MAX_N * 2 + 1];
int doubling[MAX_N * 2 + 1][MAX_logN];
int count(int l, int r) {
int res = 0;
for (int j = MAX_logN - 1; j >= 0; j--) {
if (doubling[l][j] <= r) {
l = doubling[l][j];
res += 1 << j;
}
}
return res;
}
int main() {
scanf("%d%d", &N, &K);
for (int i = 0; i < N; 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... |