# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
852582 | 2023-09-22T06:57:02 Z | sleepntsheep | Secret (JOI14_secret) | C++17 | 0 ms | 0 KB |
#include <cstdio> #define N 1005 int n, *a, st[10][N]; void Init(int n_, int *a_) { n = n_; a = a_; for (int i = 0; i < n; ++i) st[0][i] = a[i]; for (int h = 1; (1 << h) <= n; ++h) { for (int j = 0; j < n; ++j) { if (j + (1 << h) * 2 > n) continue; st[h][j] = Secret(st[h-1][j], st[h-1][j+(1<<(h-1))]); } } } int Query(int l, int r) { int z = a[l++]; for (int h = 10; h >= 0; --h) { if ((1 << h) <= r-l+1) { z = Secret(z, st[h][l]); l += 1 << h; } } return z; }