Submission #877511

#TimeUsernameProblemLanguageResultExecution timeMemory
877511IvkosqnSecret (JOI14_secret)C++14
0 / 100
355 ms11860 KiB
#include <bits/stdc++.h> #include "secret.h" #define endl '\n' using namespace std; const int maxn = 1024; int pref[maxn][maxn], suff[maxn][maxn]; int lf[maxn], rg[maxn], a[maxn]; vector<int> mids; void divide(int l, int r){ if(l > r) return; if(l == r){ suff[l][l] = a[l]; lf[l] = l; rg[l] = l; mids.push_back(l); return; } int mid = (l + r) / 2; mids.push_back(mid); divide(l, mid - 1); divide(mid + 1, r); lf[mid] = l, rg[mid] = r; suff[mid][l] = a[l]; pref[mid][mid + 1] = a[mid + 1]; for(int i = l + 1;i <= mid;i++) suff[mid][i] = Secret(suff[mid][i - 1], a[i]); for(int i = mid + 2;i <= r;i++) pref[mid][i] = Secret(pref[mid][i - 1], a[i]); } void Init(int n, int A[]){ for(int i = 0;i < n;i++) a[i] = A[i]; divide(0, n - 1); } int Query(int l, int r){ for(int x : mids){ if(lf[x] <= l && rg[x] >= r && x >= l && x <= r){ int ans = suff[x][l]; if(x != r) ans = Secret(ans, pref[x][r]); return ans; } } }

Compilation message (stderr)

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