Submission #1018207

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018207		TsotneSV	Secret (JOI14_secret)	C++14	0 / 100	314 ms	4436 KiB

secret

#include "secret.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1005;
const int LVL=15;

int DAQ[LVL][MAXN],n,arr[MAXN];


void go(int l,int r,int lev) {

    if(l == r) {
        DAQ[lev][l] = arr[l];
        return;
    }

    int m = (l + r)>>1; 
    DAQ[lev][m] = arr[m]; DAQ[lev][m+1] = arr[m+1];

    for(int i=m-1;i>=l;i--) {
        DAQ[lev][i] = Secret(arr[i],DAQ[lev][i+1]);
    } 

    for(int i=m+2;i<=r;i++) {
        DAQ[lev][i] = Secret(arr[i],DAQ[lev][i-1]);
    }

    go(l,m,lev+1); 
    go(m+1,r,lev+1);

}

void Init(int N, int A[]) {

    n = N;

    for(int i=0;i<n;i++) arr[i] = A[i];

    go(0,n-1,0);

}

int f(int l,int r,int tl,int tr,int lev) {

    if(tl == tr) return DAQ[lev][l];

    int m = (tl + tr)>>1;

    if(m >= r) return f(l,r,tl,m,lev+1);
    if(m+1 <= l) return f(l,r,m+1,tr,lev+1);
    return Secret(DAQ[lev][l],DAQ[lev][r]);

}

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

• Subtask 1: 0 / 100