# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
751925 | Desh03 | 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>
using namespace std;
vector<vector<int>> mid, v;
void dc(int l, int r, vector<int> &a) {
if (l > r) return;
int m = l + r >> 1;
v[m][m] = a[m];
if (m < r) v[m + 1][m + 1] = a[m + 1];
for (int i = l; i <= m - 1; i++)
for (int j = m + 1; j <= r; j++)
mid[i][j] = m;
for (int i = m - 1; i >= l; i--)
v[i][m] = Secret(a[i], v[i + 1][m]);
for (int i = m + 2; i <= r; i++)
v[m + 1][i] = Secret(a[i], v[m + 1][i - 1]);
dc(l, m - 1, a);
dc(m + 1, r, a);
}
void Init(int n, vector<int> a) {
mid = v = vector<vector<int>> (n, vector<int> (n, -1));
dc(0, n - 1, a);
}
int Query(int l, int r) {
if (v[l][r] != -1) return v[l][r];
int m = mid[l][r];
return Secret(v[l][m], v[m + 1][r]);
}