oj.uz

답안 #988100

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988100 2024-05-24T04:55:13 Z icyalmond 비밀 (JOI14_secret) C++17
0 / 100
 356 ms 12208 KB 
#include "secret.h"

int pref[1005][15], suf[1005][15], mask[1005], a[1005];

void build(int l, int r, int h)
{
    if (l == r) suf[l][h] = a[l];
    else
    {
        int m = l + 1 >> 1;
        suf[m][h] = a[m];
        for (int i = m - 1; i >= l; i--) suf[i][h] = Secret(suf[i + 1][h], a[i]);
        pref[m + 1][h] = a[m + 1];
        for (int i = m + 2; i <= r; i++) pref[i][h] = Secret(pref[i - 1][h], a[i]);
        for (int i = m + 1; i <= r; i++) mask[i] |= 1 << h;
        if (l != m) build(l, m, h + 1);
        if (m + 1 != r) build(m + 1, r, h + 1);
    }
}

void Init(int N, int A[])
{
    for (int i = 1; i <= N; i++) a[i] = A[i - 1];
    build(1, N, 0);
}

int Query(int L, int R)
{
    if (L == R) return(a[L + 1]);
    else
    {
        int h = __builtin_ctz(mask[L + 1] ^ mask[R + 1]);
        return(Secret(suf[L + 1][h], pref[R + 1][h]));
    }
}

//coded by icyalmond

Compilation message

secret.cpp: In function 'void build(int, int, int)':
secret.cpp:10:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   10 |         int m = l + 1 >> 1;
      |                 ~~^~~

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 100 ms 10580 KB Execution killed with signal 11
2 Runtime error 98 ms 10548 KB Execution killed with signal 11
3 Runtime error 102 ms 10832 KB Execution killed with signal 11
4 Runtime error 350 ms 12200 KB Execution killed with signal 11
5 Runtime error 352 ms 12036 KB Execution killed with signal 11
6 Runtime error 354 ms 12192 KB Execution killed with signal 11
7 Runtime error 356 ms 12208 KB Execution killed with signal 11
8 Runtime error 354 ms 12004 KB Execution killed with signal 11
9 Runtime error 354 ms 12116 KB Execution killed with signal 11
10 Runtime error 353 ms 11952 KB Execution killed with signal 11