# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823784 | Alihan_8 | Secret (JOI14_secret) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define ln '\n'
//#define int long long
template <class _T>
bool chmin(_T &x, const _T &y){
bool flag = false;
if ( x > y ){
x = y; flag |= true;
}
return flag;
}
template <class _T>
bool chmax(_T &x, const _T &y){
bool flag = false;
if ( x < y ){
x = y; flag |= true;
}
return flag;
}
const int N = 1e3 + 1;
int a[N][N];
void Init(int N, int A[]) {
for ( int i = 0; i < N; i++ ){
int t = A[i];
for ( int j = i + 1; j < N; j++ ){
t = Secret(t, A[j]);
a[i][j] = t;
}
}
}
int Query(int L, int R) {
return a[L][R];
}