# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
852725 | sleepntsheep | 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 <vector>
#include "secret.h"
#include <assert.h>
#define N 1050
int n, *a;
std::vector<int> pre[N<<1], suf[N<<1];
void build(int v, int l, int r)
{
if (l == r)
{
pre[v] = suf[v] = {a[l]};
return;
}
int m=(l+r)/2, vl=v+1, vr=v+(m-l+1)*2;
pre[v].resize(r-l+1);
suf[v].resize(r-l+1);
suf[v][r-l] = a[r];
for (int i = r-l-1, j = r-1; j >= l; --j, --i)
suf[v][i] = Secret(a[j], suf[v][i+1]);
pre[v][0] = a[l];
for (int i = 1, j = l + 1; j <= r; ++j, ++i)
pre[v][i] = Secret(pre[v][i-1], a[j]);
build(vl, l, m);
build(vr, m+1, r);
}
int qry(int v, int l, int r, int x, int y)
{