제출 #780704

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780704		borisAngelov	비밀 (JOI14_secret)	C++17	0 / 100	400 ms	4544 KiB

secret

#include "secret.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1024;
const int max_log = 15;

int n;
int a[maxn];

int precompute[maxn][max_log];

void divide(int depth, int l, int r)
{
    if (l == r)
    {
        precompute[l][depth] = a[l];
        return;
    }

    int mid = (l + r) / 2;

    precompute[mid][depth] = a[mid];

    for (int i = mid - 1; i >= l; --i)
    {
        precompute[i][depth] = Secret(precompute[i + 1][depth], a[i]);
    }

    precompute[mid + 1][depth] = a[mid + 1];

    for (int i = mid + 2; i <= r; ++i)
    {
        precompute[i][depth] = Secret(precompute[i - 1][depth], a[i]);
    }

    divide(depth + 1, l, mid);
    divide(depth + 1, mid + 1, r);
}

void Init(int N, int Arr[])
{
    n = N;

    for (int i = 0; i < n; ++i)
    {
        a[i] = Arr[i];
    }

    divide(0, 0, n - 1);
}

int recurse(int depth, int l, int r, int ql, int qr)
{
    if (l == r)
    {
        return precompute[depth][l];
    }

    int mid = (l + r) / 2;

    if (r <= mid)
    {
        return recurse(depth + 1, l, mid, ql, qr);
    }

    if (l >= mid + 1)
    {
        return recurse(depth + 1, mid + 1, r, ql, qr);
    }

    return Secret(precompute[depth][l], precompute[depth][r]);
}

int Query(int L, int R)
{
    int l = L;
    int r = R;

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

• Subtask 1: 0 / 100