Submission #520006

#	Time	Username	Problem	Language	Result	Execution time	Memory
520006		amunduzbaev	Secret (JOI14_secret)	C++14	0 / 100	455 ms	16236 KiB

secret

#include "bits/stdc++.h"
#include "secret.h"
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif

const int M = 1000;
int a[M];

int ask(int a, int b){
	if(a == -1) return b;
	if(b == -1) return a;
	return Secret(a, b);
}

struct ST{
	int pref[M<<2][M], suff[M<<2][M];
	
	void build(int lx = 0, int rx = M, int x = 1){
		if(lx == rx) { pref[x][0] = a[lx]; return; }
		int m = (lx + rx) >> 1;
		pref[x][0] = a[m];
		for(int i=1;i<=m-lx;i++){
			pref[x][i] = ask(pref[x][i-1], a[m-i]);
		}
		
		suff[x][0] = a[m+1];
		for(int i=1;i<=rx-m-1;i++){
			suff[x][i] = ask(suff[x][i-1], a[m+1+i]);
		}
		
		build(lx, m, x<<1);
		build(m+1, rx, x<<1|1);
	}
	
	int get(int l, int r, int lx = 0, int rx = M, int x = 1){
		if(lx == rx) return a[lx];
		int m = (lx + rx) >> 1;
		if(r <= m) return get(l, r, lx, m, x<<1);
		if(m < l) return get(l, r, m+1, rx, x<<1|1);
		return ask(pref[x][m-l], suff[x][r-m-1]);
	}
}tree;

void Init(int N, int A[]) {
	for(int i=0;i<N;i++){
		a[i] = A[i];
	}
	
	tree.build();
}

int Query(int L, int R) {
	return tree.get(L, R);
}

Compilation message (stderr)

secret.cpp: In function 'void Init(int, int*)':
secret.cpp:21:35: warning: array subscript 1000 is above array bounds of 'int [1000]' [-Warray-bounds]
   21 |   if(lx == rx) { pref[x][0] = a[lx]; return; }
      |                               ~~~~^
secret.cpp:9:5: note: while referencing 'a'
    9 | int a[M];
      |     ^

• Subtask 1: 0 / 100