Submission #25277

#	Time	Username	Problem	Language	Result	Execution time	Memory
25277		kajebiii	비밀 (JOI14_secret)	C++14	0 / 100	719 ms	5364 KiB

secret

#include "secret.h"
#include <stdio.h>

const int MAX_N = 1e3 + 10;
const int ROOT_N = 32;

int inQ[ROOT_N][ROOT_N][ROOT_N];
int left[ROOT_N][ROOT_N][ROOT_N];
void Init(int N, int A[]) {
//    for(int i=0; i<N; i++) printf("%d ", A[i]); puts("");
    for(int g=0; g<(N+ROOT_N-1)/ROOT_N; g++) {
        int b = g * ROOT_N;
        for(int i=0; b+i<N; i++)
            inQ[g][i][i] = A[b+i];
        for(int p=1; p<ROOT_N; p++)
            for(int i=0, j=p; b+j<ROOT_N; i++, j++)
                inQ[g][i][j] = Secret(inQ[g][i][j-1], A[b+j]);
    }
    for(int g=0; g<(N+ROOT_N-1)/ROOT_N; g++) {
        int b = g * ROOT_N;
        for(int i=0; b+i<N; i++) 
            left[g][i][g] = inQ[g][0][i];
        for(int i=0; b+i<N; i++)
            for(int gg=g-1; gg>=0; gg--)
                left[g][i][gg] = Secret(left[g][i][gg+1], inQ[gg][0][ROOT_N]);
    }
}

int Query(int L, int R) {
//    printf("[%d %d]\n", L, R);
    int gL = L / ROOT_N, gR = R / ROOT_N;
    int rL = L % ROOT_N, rR = R % ROOT_N;
    if(gL == gR) return inQ[gL][rL][rR];
    return Secret(inQ[gL][rL][ROOT_N-1], left[gR][rR][gL+1]);
}

Compilation message (stderr)

secret.cpp: In function 'void Init(int, int*)':
secret.cpp:25:40: warning: array subscript is above array bounds [-Warray-bounds]
                 left[g][i][gg] = Secret(left[g][i][gg+1], inQ[gg][0][ROOT_N]);
                                        ^

• Subtask 1: 0 / 100