oj.uz

Submission #949569

# Submission time Handle Problem Language Result Execution time Memory
949569 2024-03-19T11:13:32 Z JakobZorz Secret (JOI14_secret) C++17
0 / 100
 385 ms 16192 KB 
#include "secret.h"

int n;
int arr[1024];
int tl[2048][1024];
int tr[2048][1024];

void init(int node,int l,int r){
    if(l==r-1)
        return;
    int m=(l+r)/2;
    if(m>1000)
        return;
    tl[node][m-1]=arr[m-1];
    for(int i=m-2;i>=l;i--)
        tl[node][i]=Secret(arr[i],tl[node][i+1]);
    tr[node][m+1]=arr[m];
    for(int i=m+2;i<=r&&i<=1000;i++)
        tr[node][i]=Secret(tr[node][i-1],arr[i-1]);
    init(2*node,l,m);
    init(2*node+1,m,r);
}

void Init(int N,int A[]){
    n=N;
    for(int i=0;i<n;i++)
        arr[i]=A[i];
    init(1,0,1024);
}

int query(int node,int l,int r,int a,int b){
    int m=(l+r)/2;
    if(b<m)
        return query(2*node,l,m,a,b);
    if(m<a)
        return query(2*node+1,m,r,a,b);
    if(a==m)
        return tr[node][b];
    if(b==m)
        return tl[node][a];
    return Secret(tl[node][a],tr[node][b]);
}

int Query(int L,int R){
    return query(1,0,1024,L,R+1);
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 10300 KB Output is correct - number of calls to Secret by Init = 7976, maximum number of calls to Secret by Query = 1
2 Correct 108 ms 10324 KB Output is correct - number of calls to Secret by Init = 7976, maximum number of calls to Secret by Query = 1
3 Correct 107 ms 10320 KB Output is correct - number of calls to Secret by Init = 7976, maximum number of calls to Secret by Query = 1
4 Incorrect 361 ms 16192 KB Wrong Answer: Query(993, 993) - expected : 480716499, actual : 0.
5 Correct 361 ms 15956 KB Output is correct - number of calls to Secret by Init = 7976, maximum number of calls to Secret by Query = 1
6 Incorrect 369 ms 15972 KB Wrong Answer: Query(993, 999) - expected : 329331970, actual : 0.
7 Correct 385 ms 15968 KB Output is correct - number of calls to Secret by Init = 7976, maximum number of calls to Secret by Query = 1
8 Correct 363 ms 16116 KB Output is correct - number of calls to Secret by Init = 7976, maximum number of calls to Secret by Query = 1
9 Correct 363 ms 15960 KB Output is correct - number of calls to Secret by Init = 7976, maximum number of calls to Secret by Query = 1
10 Correct 364 ms 15964 KB Output is correct - number of calls to Secret by Init = 7976, maximum number of calls to Secret by Query = 1