# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1018178 | TsotneSV | 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.
#pragma gcc diagnostic "-std=c++1z"
#include <bits/stdc++.h>
using namespace std;
/* /\_/\
(= ._.)
/ > \>
*/
//#pragma comment(linker, "/stack:200000000")
#include "secret.h"
// #define int long long
#define fi first
#define se second
#define pb push_back
#define ins insert
#define mp make_pair
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(0);}
#define endl '\n'
#define sz(x) ((long long) (x).size())
#define all(x) (x).begin(),(x).end()
#define print(x) cout<<(x)<<" ";
#define printl(x) cout<<(x)<<endl
#define dbg(x) cerr<<#x<<" "<<x<<endl
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
void fileIO(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
// const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
const int inf=1e9,MAXN=2e5+5;
const ll INF=1e18;
const ld pi = 3.14159265358979323846;
int DAQ[1005][10],n,arr[1005];
void go(int l,int r,int lev) {
if(l > r) return;
if(l == r) {
DAQ[l][lev] = arr[l];
return;
}
int m = (l + r)/2; DAQ[m][lev] = arr[m]; DAQ[m+1][lev] = arr[m+1];
for(int i=m-1;i>=l;i--) {
DAQ[i][lev] = secret(arr[i],DAQ[i+1][lev]);
}
for(int i=m+2;i<=r;i++) {
DAQ[i][lev] = secret(arr[i],DAQ[i-1][lev]);
}
go(l,m,lev+1); go(m+1,r,lev+1);
}
void Init(int N, int A[]) {
n = N;
for(int i=0;i<n;i++) arr[i] = A[i];
go(0,n-1,0);
}
int f(int l,int r,int tl = 0,int tr = n-1,int lev = 0) {
int m = (tl + tr)/2;
if(l <= m and r > m) {
return lev;
}else if(m < l) {
return f(l,r,m+1,tr,lev+1);
}else {
return f(l,r,tl,m,lev+1);
}
}
int Query(int L, int R) {
if(L == R) return arr[L];
int lev = f(L,R);
return secret(DAQ[L][lev],DAQ[R][lev]);
}