oj.uz

답안 #618302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
618302 2022-08-02T04:12:00 Z Shreyan_Paliwal 비밀 (JOI14_secret) C++17
100 / 100
 492 ms 4324 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[]) {
    //cout << lvl << ' ' << l << ' ' << r << endl;
    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;
    //cout << lvl << ' ' << l << ' ' << r << ' ' << m << ' ' << L << ' ' << R << endl;
    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[]) {
    for (int i = 0; i < n; i++) V[i] = A[i];

    n = N;
    create(0, 0, n - 1, A);
    for (int i = 0; i < 10; i++) {
        for (int j = 0; j < n; j++) {
            //cout << DVC[i][j] << ' ';
        }
        //cout << endl;
    }
}

int Query(int L, int R) {
    //cout << "-----------------" << endl;
    //cout << L << ' ' << R << endl;
    return get(0, 0, n - 1, L, R);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 2380 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 134 ms 2324 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 126 ms 2404 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 460 ms 4276 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 492 ms 4200 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 464 ms 4208 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 479 ms 4292 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 474 ms 4324 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 480 ms 4200 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 461 ms 4204 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1