oj.uz

답안 #576001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576001 2022-06-12T04:06:16 Z talant117408 비밀 (JOI14_secret) C++17
100 / 100
 460 ms 12312 KB 
#include "secret.h"
#include <bits/stdc++.h>

#ifndef EVAL
#include "grader.cpp"
#endif
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define pb                  push_back
#define mp                  make_pair
#define lb                  lower_bound
#define ub                  upper_bound
#define endl                '\n'
#define all(v)              (v).begin(),(v).end()
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const int MAXN = 1e3+3;
int LL[MAXN][MAXN], RR[MAXN][MAXN], V[MAXN];
int n;

void dnc(int l, int r) {
    if (l > r) return;
    int mid = (l+r) >> 1;
    LL[mid][mid] = V[mid];
    if (l == r) {
        return;
    }
    RR[mid][mid+1] = V[mid+1];
    for (int i = mid-1; i >= l; i--) {
        LL[mid][i] = Secret(V[i], LL[mid][i+1]);
    }
    for (int i = mid+2; i <= r; i++) {
        RR[mid][i] = Secret(RR[mid][i-1], V[i]);
    }
    dnc(l, mid);
    dnc(mid+1, r);
}

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

int get(int l, int r, int ql, int qr) {
    if (l == r) return V[l];
    if (l > r) return 0;
    int mid = (l+r) >> 1;
    if (l <= ql && qr <= r && ql <= mid && mid < qr) {
        return Secret(LL[mid][ql], RR[mid][qr]);
    }
    if (ql > mid) return get(mid+1, r, ql, qr);
    else return get(l, mid, ql, qr);
}

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

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 6420 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 123 ms 6368 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 125 ms 6412 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 441 ms 12312 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 435 ms 12104 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 442 ms 12072 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 432 ms 12060 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 460 ms 12036 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 452 ms 12096 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 440 ms 12040 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1