Submission #984431

#	Time	Username	Problem	Language	Result	Execution time	Memory
984431		LOLOLO	Secret (JOI14_secret)	C++11	0 / 100	357 ms	8280 KiB

secret

//#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
const int N = 1e3 + 10;
int n;
int a[N], f[N][N];

void prepare(int l, int r) {
    if (l == r) {
        f[l][l] = a[l];
        return;
    }

    int m = (l + r) / 2;

    f[m][m] = a[m];
    f[m + 1][m + 1] = a[m + 1];

    for (int j = m + 2; j <= r; j++) {
        f[m + 1][j] = Secret(f[m + 1][j - 1], a[j]);
    }

    for (int j = m - 1; j >= l; j--) {
        f[j][m] = Secret(f[j + 1][m], a[j]);
    }

    prepare(l, m);
    prepare(m + 1, r); 
}

void Init(int _n, int _a[]) {
    n = _n;
    for (int i = 0; i < n; i++)
        a[i] = _a[i];

    prepare(0, n - 1);
}

int get(int l, int r, int u, int v) {
    int m = (l + r) / 2;
    if (m < u)
        return get(m + 1, r, u, v);

    if (m > v)
        return get(l, m, u, v);

    if (v == m)
        return f[u][v];

    return Secret(f[u][m], f[m + 1][v]);
}

int Query(int l, int r) {
    if (l == r) {
        return a[l];
    }

    return get(0, n - 1, l, r);
}

• Subtask 1: 0 / 100