# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549712 | colossal_pepe | Secret (JOI14_secret) | C++17 | 8502 ms | 4352 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <secret.h>
using namespace std;
int n, a[1005];
void Init(int N, int A[]) {
n = N;
for (int i = 0; i < n; i++) {
a[i] = A[i];
}
}
int Query(int L, int R) {
int ans = a[L];
for (int i = L + 1; i <= R; i++) {
ans = Secret(ans, a[i]);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |