oj.uz

답안 #852741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852741 2023-09-22T15:52:28 Z sleepntsheep 비밀 (JOI14_secret) C++17
100 / 100
 382 ms 4688 KB 
#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;
    suf[v].resize(m-l+1);
    suf[v][m-l] = a[m];
    for (int i = m-l-1, j = m - 1; j >= l; --j, --i)
        suf[v][i] = Secret(a[j], suf[v][i+1]);
    pre[v].resize(r-m);
    pre[v][0] = a[m+1];
    for (int i = 1; i < r-m; ++i)
        pre[v][i] = Secret(pre[v][i-1], a[m+1+i]);
    build(vl, l, m);
    build(vr, m+1, r);
}

int qry(int v, int l, int r, int x, int y)
{
    int m = (l+r)/2, vl=v+1, vr=v+(m-l+1)*2;

    if (y == m) return suf[v][suf[v].size()-1-(m-x)];
    if (m+1 == x) return pre[v][y-x];

    if (l <= x && y <= m) return qry(vl, l, m, x, y);
    if (m + 1 <= x && y <= r) return qry(vr, m+1, r, x, y);

    int al = suf[v][suf[v].size()-1-(m-x)], ar = pre[v][y-m-1];
    return Secret(al, ar);
}

void Init(int n_, int *a_)
{
    n = n_, a = a_;
    build(0, 0, n-1);
}

int Query(int l, int r)
{
    return qry(0, 0, n-1, l, r);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 3604 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 105 ms 3544 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 105 ms 3508 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 375 ms 4432 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 377 ms 4432 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 382 ms 4556 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 375 ms 4424 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 380 ms 4632 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 379 ms 4688 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 374 ms 4688 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1