oj.uz

답안 #618314

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
618314 2022-08-02T04:15:03 Z Shreyan_Paliwal 비밀 (JOI14_secret) C++17
0 / 100
 447 ms 8592 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 1000;
const int maxlvl = 10;

int n;
// int V[maxn];
int DVC[maxlvl][maxn];

void create(int lvl, int l, int r, int A[]) {
    if (l == r) {
        DVC[lvl][l] = A[l];
        return;
    }
    int m = (l + r) >> 1;
    // left side
    DVC[lvl][m] = A[m];
    for (int i = m - 1; i >= l; i--) DVC[lvl][i] = Secret(A[i], DVC[lvl][i + 1]);
    // right side
    DVC[lvl][m + 1] = A[m + 1];
    for (int i = m + 2; i <= r; i++) DVC[lvl][i] = Secret(DVC[lvl][i - 1], A[i]);

    create(lvl + 1, l, m, A);
    create(lvl + 1, m + 1, r, A);
}

int get(int lvl, int l, int r, int L, int R) {
    if (l == r) return DVC[lvl][L];
    int m = (l + r) >> 1;
    if (R <= m) return get(lvl + 1, l, m, L, R);
    if (L >= m+1) return get(lvl + 1, m+1, r, L, R);
    return Secret(DVC[lvl][L], DVC[lvl][R]);
}

void Init(int N, int A[]) {

    n = N;
    create(0, 0, n - 1, A);
}

int Query(int L, int R) {
    return get(0, 0, n - 1, L, R);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 2384 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 121 ms 2524 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Runtime error 119 ms 4708 KB Execution killed with signal 11
4 Runtime error 421 ms 8592 KB Execution killed with signal 11
5 Runtime error 425 ms 8484 KB Execution killed with signal 11
6 Runtime error 427 ms 8568 KB Execution killed with signal 11
7 Runtime error 441 ms 8480 KB Execution killed with signal 11
8 Runtime error 447 ms 8524 KB Execution killed with signal 11
9 Runtime error 428 ms 8556 KB Execution killed with signal 11
10 Runtime error 425 ms 8528 KB Execution killed with signal 11