Submission #1056301

#	Time	Username	Problem	Language	Result	Execution time	Memory
1056301		Minbaev	Secret (JOI14_secret)	C++17	0 / 100	253 ms	4480 KiB

secret

#include "secret.h"
//#include <bits/stdc++.h>

using namespace std;

const int Y = 1e5;
const int inf = 3;

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;
	
	if(tm < l)return get(tm+1,tr,v*2+1,l,r);
	if(tm + 1 > r)return get(tl,tm,v*2,l,r);
	
	return Secret(get(tm+1,tr,v*2+1,l,r), get(tl,tm,v*2,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);
}

• Subtask 1: 0 / 100