oj.uz

Submission #386532

# Submission time Handle Problem Language Result Execution time Memory
386532 2021-04-06T18:36:26 Z aryan12 Secret (JOI14_secret) C++17
0 / 100
 510 ms 8588 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 1000;

int ans[MAX_N][MAX_N];
int N;

void PreCompute(int left, int right) {
    int mid = (left + right) >> 1;
    if(right - left >= 2)
        return;
    for(int i = mid - 2; i >= left; i--) {
        ans[i][mid - 1] = Secret(ans[i + 1][mid - 1], ans[i][i]);
    }
    for(int i = mid + 1; i <= right; i++) {
        ans[mid][i] = Secret(ans[mid][i - 1], ans[i][i]);
    }
    PreCompute(left, mid - 1);
    PreCompute(mid + 1, right);
}

void Init(int n, int A[]) {
    N = n;
    for(int i = 0; i < N; i++) {
        for(int j = i; j < N; j++) {
            ans[i][j] = (i == j) ? A[i] : -1; 
        }
    }
    PreCompute(0, N - 1);
}

int Compute(int left, int right, int ql, int qr) {
    int mid = (left + right) >> 1;
    if(ql >= mid) {
        return Compute(mid, right, ql, qr);
    }
    else if(qr < mid) {
        return Compute(left, mid, ql, qr);
    }
    return Secret(ans[ql][mid - 1], ans[mid][qr]);
}

int Query(int L, int R) {
    if(L == R)
        return ans[L][L];
    return Compute(0, N - 1, L, R);
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 130 ms 4588 KB Wrong Answer [1]
2 Incorrect 130 ms 4460 KB Wrong Answer [1]
3 Incorrect 131 ms 4480 KB Wrong Answer [1]
4 Incorrect 510 ms 8588 KB Wrong Answer [1]
5 Incorrect 490 ms 8328 KB Wrong Answer [1]
6 Incorrect 487 ms 8300 KB Wrong Answer [1]
7 Incorrect 493 ms 8428 KB Wrong Answer [1]
8 Incorrect 495 ms 8284 KB Wrong Answer [1]
9 Incorrect 488 ms 8300 KB Wrong Answer [1]
10 Incorrect 490 ms 8428 KB Wrong Answer [1]