oj.uz

답안 #866008

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866008 2023-10-25T09:44:56 Z lolismek 비밀 (JOI14_secret) C++14
100 / 100
 417 ms 4576 KB 
#include "secret.h"

#include <vector>
#include <iostream>

using namespace std;


const int NMAX = 2000;

int n;
int a[NMAX + 1];
int dp[20][NMAX + 1];

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

    int mid = (l + r) / 2;
    dp[level][mid] = a[mid];

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

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

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

void Init(int N, int A[]){
    n = N;
    for(int i = 0; i < N; i++){
        a[i] = A[i];
    }
    divide(1, 0, N - 1);
}

int getAns(int level, int l, int r, int L, int R){
    int mid = (l + r) / 2;
    if(L <= mid && mid <= R){
        if(R == mid){
            return dp[level][L];
        }
        return Secret(dp[level][L], dp[level][R]);
    }

    if(mid < L){
        return getAns(level + 1, mid + 1, r, L, R);
    }
    return getAns(level + 1, l, mid, L, R);
}
int Query(int L, int R){
    if(L == R){
        return a[L];
    }
    return getAns(1, 0, n - 1, L, R);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 2636 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 120 ms 2748 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 120 ms 2728 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 386 ms 4268 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 415 ms 4264 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 390 ms 4432 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 404 ms 4576 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 399 ms 4484 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 405 ms 4352 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 417 ms 4352 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1