Submission #70269

#TimeUsernameProblemLanguageResultExecution timeMemory
70269MladenPSecret (JOI14_secret)C++17
0 / 100
688 ms8552 KiB
#include "secret.h" #define mid (l+r)/2 int n, a[1010], d[1010][1010]; void init(int l, int r) { if(l >= r) return; for(int i = mid+1; i <= r; i++) d[mid][i] = Secret(d[mid][i-1], a[i]); for(int i = mid-2; i >= l; i--) d[i][mid-1] = Secret(a[i], d[i+1][mid-1]); init(l, mid-1); init(mid+1, r); } void Init(int N, int A[]) { n = N; for(int i = 0; i < n; i++) a[i] = A[i-1], d[i][i] = a[i]; init(1, N); } int query(int l, int r, int L, int R) { if(L <= mid && mid <= R) { if(L < mid) return Secret(d[L][mid-1],d[mid][R]); else return d[mid][R]; } if(mid < L) return query(mid+1, r, L, R); if(R < mid) return query(l, mid-1, L, R); } int Query(int L, int R) { if(L == R) return a[L]; if(L+1 == R) return Secret(a[L], a[R]); return query(1, n, L, R); }

Compilation message (stderr)

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