# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624466 | erto | Secret (JOI14_secret) | C++17 | 0 ms | 0 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>
typedef long long int ll;
#define INF 1000000007
#define INF2 998244353
//#define N (ll)(2e5+ 5)
using namespace std;
int n;
int ans[1005][1005];
void calc(int lb, int rb, int A[]){
int mid = (lb + rb) / 2;
if(lb == rb)return;
ans[mid][mid] = A[mid - 1];
for(int i=mid - 1; i>=lb; i--){
ans[mid][i] = Secret(A[i - 1], ans[mid][i + 1]);
}
ans[mid + 1][mid + 1] = A[mid];
for(int i=mid + 2; i<=rb; i++){
ans[mid + 1][i] = Secret(ans[mid + 1][i - 1], A[i - 1]);
}
calc(lb, mid, A[]);
calc(mid + 1, rb, A[]);
}
void Init(int N, int A[]){
n = N;
calc(1, n, A);
}
int Query(int L, int R){
L++;
R++;
int a = 1, b = n;
if(L == R)return A[L - 1];
else{
while(a < b){
int mid = (a + b) / 2;
if(L <= mid && mid < R){
return Secret(ans[mid][L], ans[mid][R]);
}
else if(mid == R){
return ans[mid][L];
}
else if(mid < L){
a = mid + 1;
}
else{
l = mid;
}
}
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int T = 1;
// cin>>T;
while (T--){
solve();
}
}