Submission #740331

#	Time	Username	Problem	Language	Result	Execution time	Memory
740331		BidoTeima	Secret (JOI14_secret)	C++17	0 / 100	439 ms	8252 KiB

secret

#include "secret.h"
#include <bits/stdc++.h>
const int N = 1e3;
int val[N][N];
int a[N];
void rec(int l, int r){
    if(l > r)
        return;
    if(l == r){
        val[l][l] = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    // (l, mid), (l + 1, mid), ..., (mid, mid)
    int pre = a[mid];
    for(int i = mid; i >= l; i--){
        if(i < mid)pre = Secret(pre, a[i]);
        val[i][mid] = pre;
    }
    pre = a[mid + 1];
    for(int i = mid + 1; i <= r; i++){
        if(i > mid + 1)pre = Secret(pre, a[i]);
        val[mid + 1][i] = pre;
    }
    rec(l, mid - 1);
    rec(mid + 2, r);
}
void Init(int n, int A[]) {
    for(int i = 0; i < n; i++){
        a[i] = A[i];
    }
    memset(val, -1, sizeof(val));
    rec(0, n - 1);
}

int Query(int L, int R) {
    if(L == R)
        return val[L][L];
    for(int i = L; i + 1 <= R; i++){
        if(val[L][i] != -1 && val[i + 1][R] != -1)
            return Secret(val[L][i], val[i + 1][R]);
    }
    if(val[L][R] != -1)
        return val[L][R];
    return -1;
}

• Subtask 1: 0 / 100