Submission #1311148

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311148		Ghulam_Junaid	Secret (JOI14_secret)	C++20	0 / 100	337 ms	8608 KiB

secret

#include <bits/stdc++.h>
#include "secret.h"

using namespace std;

const int N = 1005;
int n, a[N], ans[N][N];
map<pair<int, int>, int> saved;

void compute(int l, int r){
    if (r - l <= 1) return;

    int mid = (l + r) / 2;
    int prv = a[mid];
    for (int i = l - 1; i >= l; i --){
        ans[i][mid] = saved[{i, mid}] = Secret(a[i], prv);
        prv = saved[{i, mid}];
    }
    prv = a[mid];
    for (int i = mid + 1; i < r; i ++){
        ans[mid][i] = saved[{mid, i}] = Secret(a[i], prv);
        prv = saved[{mid, i}];
    }
    compute(l, mid);
    compute(mid + 1, r);
}

void Init(int nn, int aa[]) {
    memset(ans, -1, sizeof ans);
    n = nn;
    for (int i = 1; i <= n; i ++)
        a[i] = aa[i];
    compute(0, n);
}

int Query(int L, int R) {
    if (ans[L][R] != -1)
        return ans[L][R];
    for (int mid = L + 1; mid < R; mid ++)
        if (ans[L][mid] != -1 and ans[mid][R] != -1)
            return Secret(ans[L][mid], ans[mid][R]);
}

Compilation message (stderr)

secret.cpp: In function 'int Query(int, int)':
secret.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
   42 | }
      | ^

• Subtask 1: 0 / 100