oj.uz

답안 #146695

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146695 2019-08-25T09:22:21 Z dolphingarlic 비밀 (JOI14_secret) C++14
0 / 100
 604 ms 8568 KB 
#include "secret.h"

int prefix[1000][1000], n;

void populate(int L, int R, int A[]) {
    int mid = (L + R) / 2;
    prefix[mid][mid] = A[mid];
    prefix[mid + 1][mid + 1] = A[mid + 1];

    for (int i = mid + 2; i <= R; i++) prefix[mid + 1][i] = Secret(prefix[mid + 1][i - 1], A[i]);
    for (int i = mid - 1; i >= L; i--) prefix[mid][i] = Secret(A[i], prefix[mid][i + 1]);

    if (L < mid) populate(L, mid, A);
    if (mid + 1 < R) populate(mid + 1, R, A);
}

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

int Query(int L, int R) {
    int a = 0, b = n - 1;

    while (a != b) {
        int mid = (a + b) / 2;
        if (mid >= L && mid < R) return Secret(prefix[mid][L], prefix[mid + 1][R]);
        else if (mid == R) return prefix[mid][L];
        else if (mid < L) a = mid + 1;
        else b = mid;
    }

    return 0;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 4580 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 169 ms 4472 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 169 ms 4520 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 584 ms 8372 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 589 ms 8312 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Incorrect 604 ms 8492 KB Wrong Answer: Query(999, 999) - expected : 38146624, actual : 0.
7 Correct 589 ms 8376 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 584 ms 8248 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 588 ms 8568 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 589 ms 8256 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1