제출 #1306903

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306903		mncuchiinhuttt	비밀 (JOI14_secret)	C++20	0 / 100	338 ms	8348 KiB

secret

#include "secret.h"
int n;
int dnc[1007][1007];
 
void go(int l, int r, int A[]) {
    int mid = (l + r) >> 1;
    dnc[mid][mid] = A[mid];
    dnc[mid + 1][mid + 1] = A[mid + 1];
    for(int i = mid + 2; i <= r; i++) dnc[mid + 1][i] = Secret(dnc[mid + 1][i - 1], A[i]);
    for(int i = mid - 1; i >= l; i--) dnc[mid][i] = Secret(A[i], dnc[mid][i + 1]);
    if(l < mid) go(l, mid, A);
    if(mid + 1 < r) go(mid + 1, r, A);
}

void Init(int N, int A[]) {
    n = N;
    go(0, n - 1, A);
}

int Query(int L, int R) {
    if(L == R) return dnc[L][L];
    int a = 0, b = n - 1;
    while (a != b) {
        int mid = (a + b) >> 1;
        if (L <= mid and mid < R) {
            return Secret(dnc[mid][L], dnc[mid + 1][R]);
        } else if (mid >= R) {
            return b = mid;
        } else if (mid < L) {
            a = mid + 1;
        } 
    }
    return dnc[L][L];
}

• Subtask 1: 0 / 100