# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
704003 | blue | RMQ (NOI17_rmq) | C++17 | 124 ms | 28232 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 <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
const int lg = 16;
const int mx = 100'000;
using vi = vector<int>;
using vvi = vector<vi>;
int st[mx][1+lg];
vi maxpow(1+mx);
int rangemin(int l, int r)
{
return min(st[l][maxpow[r-l+1]], st[r - (1 << maxpow[r-l+1]) + 1][maxpow[r-l+1]]);
}
vi P;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
maxpow[1] = 0;
for(int i = 2; i <= mx; i++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |