제출 #1131118

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131118		khoavn2008	Secret (JOI14_secret)	C++20	0 / 100	431 ms	4476 KiB

secret

#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i=(l),_r=(r);i<=_r;i++)
#define FORNG(i,r,l) for(int i=(r),_l=(l);i>=_l;i--)
const int LOG = 17, MAXN = 1212;
int n, a[MAXN], dnc[LOG][MAXN];
void build(int c, int l, int r){
    if(l == r){
        dnc[c][l] = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    dnc[c][mid] = a[mid];
    dnc[c][mid + 1] = a[mid + 1];
    FORNG(i,mid - 1, l)dnc[c][i] = Secret(dnc[c][i + 1], a[i]);
    FOR(i,mid + 2, r)dnc[c][i] = Secret(dnc[c][i - 1], a[i]);
    build(c + 1, l, mid);
    build(c + 1, mid + 1, r);
}
int get(int c, int l, int r, int L, int R){
    if(l == r)return dnc[c][l];
    int mid = (l + r) >> 1;
    if(R <= mid)return get(c + 1, l, mid, L, R);
    if(l > mid)return get(c + 1, mid + 1, r, L, R);
    return Secret(dnc[c][L], dnc[c][R]);
}
void Init(int N, int A[]) {
    n = N;
    FOR(i,1,n){
        a[i] = A[i - 1];
    }
    build(0,1,n);
}
int Query(int L, int R) {
    L++,R++;
    return get(0, 1, n, L, R);
}

• Subtask 1: 0 / 100