| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 69448 | MladenP | 비밀 (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.
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 1000
int n, a[MAXN], d[MAXN][MAXN];
void init(int l, int r) {
if(r < l) return;
d[mid][mid] = a[mid];
for(int i = mid+1; i <= r; i++) d[mid][i] = Secret(d[mid][i-1], a[i]);
d[mid-1][mid-1] = a[mid-1];
for(int i = mid-2; i >= l; i--) d[i][mid-1] = Secret(a[i], d[i+1][mid-1]);
init(l, mid-1); init(mid+1, r);
}
void Init(int N, int A[]) {
n = N;
for(int i = 0; i < n; i++) a[i] = A[i];
init(0, N-1);
}
int query(int l, int r, int L, int R) {
if(L <= mid-1 && mid <= R) return Secret(d[L][mid-1],d[mid][R]);
if(mid < L) return query(mid+1, r, L, R);
if(R < mid) return query(l, mid-1, L, R);
}
int Query(int L, int R) {
if(L == R) return a[L];
if(L+1 == R) return Secret(a[L], a[R]);
return query(0, n-1, L, R);
}