# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128866 | Nurislam | Secret (JOI14_secret) | C++17 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "secret.h"
#include "grader.cpp"
int lc[9][1001];
void Init(int n, int a[]) {
for(int i = 0; i < n; i++){
lc[0][i] = a[i];
}
for(int i = 1; i < 9; i++){
int len = (1<<(i-1));
for(int j = len-1; j+len < n; j++){
lc[i][j] = Secret(lc[i-1][j-len], lc[i-1][j]);
}
}
}
int Query(int l, int r) {
int ans = -1;
for(int i = 8; i >= 0; i--){
int len = (1<<i);
while(l+len-1 <= r){
if(ans == -1)ans = lc[i][l];
else{
ans = Secret(ans, lc[i][l]);
}
l+=len;
}
}
return ans;
}