Submission #826312

#	Time	Username	Problem	Language	Result	Execution time	Memory
826312		Denkata	Secret (JOI14_secret)	C++14	100 / 100	369 ms	8324 KiB

secret

#include "secret.h"
int prefix[1006][1006];
int n;
void precompute(int l,int r,int A[])
{
    if(r<l)return ;
    if(r==l)
    {
        prefix[l][r] = A[l];
        return ;
    }
    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]);

    precompute(mid+1,r,A);
    precompute(l,mid,A);
}
void Init(int N, int A[])
{
    n=N;
    precompute(0,N-1,A);
}

int Query(int L, int R)
{
    int l = 0, r = n-1;
    while(l!=r)
    {
        int mid = (l+r)/2;
        if(mid>=L && mid+1<=R)
            return Secret(prefix[mid][L],prefix[mid+1][R]);
        else if(mid==R)///mid+1 moje da preskacha
            return prefix[mid][L];
        else if(mid<L)
            l=mid+1;
        else r=mid;
    }
    return prefix[l][l];
}

• Subtask 1: 100 / 100