# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1056168 | Minbaev | Secret (JOI14_secret) | C++17 | 268 ms | 4796 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;
const int Y = 1e5;
const int inf = 1e9 + 7;
int t[Y], a[Y], n;
void build(int tl, int tr, int v){
if(tl == tr){
t[v] = a[tl];
return;
}
int tm = (tl+tr)/2;
build(tl,tm,v*2);
build(tm+1,tr,v*2+1);
t[v] = Secret(t[v*2], t[v*2+1]);
}
int get(int tl, int tr, int v, int l, int r){
if(l <= tl && tr <= r){
return t[v];
}
int tm = (tl+tr)/2;
int val = inf;
if(!(r < tm+1 || tr < l)){
val = get(tm+1,tr,v*2+1,l,r);
}
int val2 = inf;
if(!(r < tl || tm < l)){
val2 = get(tl,tm,v*2,l,r);
}
if(val != inf && val2 != inf){
return Secret(val, val2);
}
else if(val != inf)return val;
else if(val2 != inf)return val2;
}
void Init(int N, int A[]){
n = N;
for(int i = 1;i<=N;i++){
a[i] = A[i];
}
build(1,n,1);
}
int Query(int L, int R){
L += 1;
R += 1;
return get(1,n,1,L,R);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |