Submission #988120

#TimeUsernameProblemLanguageResultExecution timeMemory
988120icyalmondSecret (JOI14_secret)C++17
0 / 100
382 ms5300 KiB
#include "secret.h" #include <bits/stdc++.h> using namespace std; long long pref[1005][105], a[1005], mask[1005]; void build(int l, int r, int h) { if (l == r) return; int m = l + r >> 1; pref[m][h] = a[m]; for (int i = m - 1; i >= l; i--) pref[i][h] = Secret(pref[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(pref[L + 1][h], pref[R + 1][h])); } } //coded by icyalmond

Compilation message (stderr)

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