# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
620059 | fabijan_cikac | Exam (eJOI20_exam) | C++17 | 148 ms | 32844 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;
const int BIT = 17;
const int N = (1 << BIT);
const int INF = 1e9;
int n; int lt[N]; int rt[N];
int a[N]; int b[N]; int rmq[BIT][N];
set<int> v[2 * N];
int maks(int l, int r){
int x = log2(r - l + 1);
return max(rmq[x][l], rmq[x][r - (1 << x) + 1]);
}
void find_bound(){
for (int i = 0; i < n; ++i){
rmq[0][i] = a[i];
lt[i] = INF; rt[i] = INF;
}
for (int i = 1; i < BIT; ++i){
for (int j = 0; j <= n - (1 << i); ++j)
rmq[i][j] = max(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}
for (int i = 0; i < n; ++i){
if (v[b[i]].empty()) continue;
if (a[i] == b[i]){
lt[i] = i; rt[i] = i; continue;
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... |