Submission #988085

#TimeUsernameProblemLanguageResultExecution timeMemory
988085icyalmondSecret (JOI14_secret)C++14
0 / 100
360 ms13140 KiB
#include "secret.h" int pref[1005][15], suf[1005][15], mask[1005]; void build(int l, int r, int h, int A[]) { int m = l + 1 >> 1; suf[m][h] = A[m - 1]; for (int i = m - 1; i >= l; i--) suf[i][h] = Secret(suf[i + 1][h], A[i - 1]); pref[m + 1][h] = A[m]; for (int i = m + 2; i <= r; i++) pref[i][h] = Secret(pref[i - 1][h], A[i - 1]); for (int i = m + 1; i <= r; i++) mask[i] |= 1 << h; if (l != m) build(l, m, h + 1, A); if (m + 1 != r) build(m + 1, r, h + 1, A); } void Init(int N, int A[]) { build(1, N, 0, A); } int Query(int L, int R) { L++; R++; if (L == R) return(suf[L][mask[L] ^ mask[R]]); else return(Secret(suf[L][mask[L] ^ mask[R]], pref[R][mask[L] ^ mask[R]])); } //coded by icyalmond

Compilation message (stderr)

secret.cpp: In function 'void build(int, int, int, int*)':
secret.cpp:7:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    7 |     int m = l + 1 >> 1;
      |             ~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...