# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
293193 | fucking_do_it | Secret (JOI14_secret) | C++14 | 524 ms | 8824 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 "secret.h"
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e3+9,lg = 12;
int n,cnt = 0;
int a[inf],Log2[inf],sparse[lg][inf];
vector<int> tmp;
void Init(int N, int A[]) {
n = N;
Log2[1] = 0;
for(int i=2;i<=n;i++)
Log2[i] = Log2[i/2] + 1;
for(int i=1;i<=n;i++)
a[i] = A[i-1],sparse[0][i] = a[i];
for(int j=1;j<lg;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
sparse[j][i] = Secret( sparse[j-1][i],sparse[j-1][ i+(1<<(j-1)) ] ),cnt++;
assert(cnt<=8000);
}
int Query(int L, int R) {
L++,R++;
int len = R-L+1;
int k = Log2[len];
return Secret( sparse[L][k] , sparse[R-(1<<k)+1][k] );
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |