Submission #1056301

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1056301	2024-08-13T08:44:49 Z	Minbaev	Secret (JOI14_secret)	C++17	0 / 100	253 ms	4480 KB

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.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	65 ms	3664 KB	Wrong Answer: Query(222, 254) - expected : 34031541, actual : 307520343.
2	Incorrect	64 ms	3664 KB	Wrong Answer: Query(60, 375) - expected : 669221184, actual : 42053665.
3	Incorrect	64 ms	3488 KB	Wrong Answer: Query(211, 401) - expected : 674373968, actual : 563314998.
4	Incorrect	248 ms	4176 KB	Wrong Answer: Query(90, 497) - expected : 397934825, actual : 587940447.
5	Incorrect	250 ms	4176 KB	Wrong Answer: Query(587, 915) - expected : 752404486, actual : 778589442.
6	Incorrect	250 ms	4400 KB	Wrong Answer: Query(738, 741) - expected : 983692994, actual : 52647746.
7	Incorrect	251 ms	4480 KB	Wrong Answer: Query(84, 976) - expected : 742463504, actual : 34090009.
8	Incorrect	249 ms	4432 KB	Wrong Answer: Query(58, 987) - expected : 20022464, actual : 337773832.
9	Incorrect	248 ms	4228 KB	Wrong Answer: Query(33, 967) - expected : 676869696, actual : 962070828.
10	Incorrect	253 ms	4176 KB	Wrong Answer: Query(116, 961) - expected : 68487362, actual : 873597508.