| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1293670 | rayan_bd | Secret (JOI14_secret) | C++20 | 6131 ms | 4404 KiB |
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
const int mxN = 1005;
int a[mxN], n;
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) {
if(L == R) return a[L];
int x = Secret(a[L], a[L + 1]);
for(int i = L + 2; i <= R; ++i){
x = Secret(x, a[i]);
}
return x;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
