Submission #481735

#	Time	Username	Problem	Language	Result	Execution time	Memory
481735		jk410	Secret (JOI14_secret)	C++17	30 / 100	490 ms	4400 KiB

secret

#include "secret.h"
int N;
int A[1000],Tree[1<<11];
int init_tree(int s,int e,int n){
    if (s==e)
        return Tree[n]=A[s];
    int m=(s+e)>>1;
    return Tree[n]=Secret(init_tree(s,m,n<<1),init_tree(m+1,e,n<<1|1));
}
void Init(int n,int a[]){
    N=n;
    for (int i=0; i<N; i++)
        A[i]=a[i];
    init_tree(0,N-1,1);
}
int query_tree(int s,int e,int l,int r,int n){
    int m=(s+e)>>1;
    if (l<=s&&e<=r)
        return Tree[n];
    if (l>m)
        return query_tree(m+1,e,l,r,n<<1|1);
    if (r<=m)
        return query_tree(s,m,l,r,n<<1);
    return Secret(query_tree(s,m,l,r,n<<1),query_tree(m+1,e,l,r,n<<1|1));
}
int Query(int l,int r){
    return query_tree(0,N-1,l,r,1);
}

• Subtask 1: 30 / 100