# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701822 | RandomLB | 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 "secret.h"
#include <algorithm>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
#define pb push_back
#define siz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define ms(x, a) memset(x, a, sizeof(x))
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values){
cout << vars << " = ";
string delim = "";
(...,(cout << delim << values, delim = ", "));
cout << endl;
}
const int INF = 0x3f3f3f3f;
//=================================
const int MAX = 1005;
int arr[MAX], res[MAX][MAX], n;
int secret(int a, int b){ return a+b/2*2; }
void solve(int l, int r){
if (l == r) return;
int m = l+(r-l)/2;
res[m][m] = arr[m], res[m+1][m+1] = arr[m+1];
for (int i = m-1; i >= l; i--) res[i][m] = Secret(arr[i], res[i+1][m]);
for (int i = m+2; i <= r; i++) res[m+1][i] = Secret(res[m+1][i-1], arr[i]);
solve(l, m); solve(m+1, r);
}
int solve(int l, int r, int tl, int tr){
int m = l+(r-l)/2;
if (tl <= m && m < tr) return Secret(res[tl][m], res[m+1][tr]);
return (tr <= m? solve(l, m, tl, tr) : solve(m+1, r, tl, tr));
}
void Init(int N, vi v){
n = N;
for (int i = 0; i < n; i++) arr[i] = v[i];
solve(0, n-1);
}
int query(int l, int r){
if (l == r) return arr[l];
return solve(0, n-1, l, r);
}