Submission #1306904

#TimeUsernameProblemLanguageResultExecution timeMemory
1306904mncuchiinhutttSecret (JOI14_secret)C++20
100 / 100
344 ms8284 KiB
#include "secret.h" int n; int dnc[1007][1007]; void go(int l, int r, int A[]) { int mid = (l + r) >> 1; dnc[mid][mid] = A[mid]; dnc[mid + 1][mid + 1] = A[mid + 1]; for(int i = mid + 2; i <= r; i++) dnc[mid + 1][i] = Secret(dnc[mid + 1][i - 1], A[i]); for(int i = mid - 1; i >= l; i--) dnc[mid][i] = Secret(A[i], dnc[mid][i + 1]); if(l < mid) go(l, mid, A); if(mid + 1 < r) go(mid + 1, r, A); } void Init(int N, int A[]) { n = N; go(0, n - 1, A); } int Query(int L, int R) { if(L == R) return dnc[L][L]; int l = 0, r = n - 1; while(l != r) { int mid = (l + r) >> 1; if(mid >= L and mid < R) { return Secret(dnc[mid][L], dnc[mid + 1][R]); } else if(mid < L) { l = mid + 1; } else if(R <= mid) { r = mid; } } }

Compilation message (stderr)

secret.cpp: In function 'int Query(int, int)':
secret.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
   34 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...