# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94830 | easrui | Secret (JOI14_secret) | C++14 | 972 ms | 8572 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"
#include <bits/stdc++.h>
using namespace std;
int D[1001][1001];
void Init(int N, int A[]) {
for(int i=0; i<N; i++) D[i][i] = A[i];
for(int i=0; i<N; i++){
for(int j=i+1; j<N; j++){
D[i][j] = Secret(D[i][j-1],D[j][j]);
}
}
}
int Query(int L, int R) {
return D[L][R];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |