| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1056331 | Minbaev | Secret (JOI14_secret) | C++17 | 266 ms | 4180 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"
using namespace std;
const int Y = 1005;
int t[Y*4], a[Y], n;
void build(int tl, int tr, int v){
	if(tl == tr){
		t[v] = a[tl];
		return;
	}
	int tm = tr + tl >> 1;
	
	build(tl,tm,v << 1);
	build(tm+1,tr,v << 1 | 1);
	t[v] = Secret(t[v << 1], t[v >> 1 | 1]);
}
 
int get(int tl, int tr, int v, int l, int r){
	if(l <= tl && tr <= r){
		return t[v];
	}
	int tm = tr + tl >> 1;
	
	if(tm < l)return get(tm+1,tr,v << 1 | 1,l,r);
	if(tm + 1 > r)return get(tl,tm,v << 1,l,r);
	
	return Secret(get(tm+1,tr,v << 1 | 1,l,r), get(tl,tm,v << 1,l,r));
}
void Init(int N, int A[]){
    n = N;
    for(int i = 0; i < n; ++i) a[i] = A[i];
    build(0, n - 1, 1);
 
}
int Query(int l, int r){
    return get(0, n - 1, 1, l, r);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
