oj.uz

Submission #754037

# Submission time Handle Problem Language Result Execution time Memory
754037 2023-06-06T13:44:30 Z Zflop Secret (JOI14_secret) C++14
0 / 100
 465 ms 8256 KB 
#include "secret.h"
const int NMAX = (int)1e3;
int n;
int prec[NMAX][NMAX];
void DC	(int l,int r,int A[]){
	int m = (l + r) / 2;
	prec[m][m] = A[m];
	prec[m + 1][m + 1] = A[m + 1];
	for (int i = m - 1; i >= l;--i) prec[m][i] = Secret(prec[m][i + 1],A[i]);
	for (int i = m + 2; i <= r;++i) prec[m + 1][i] = Secret(prec[m + 1][i - 1],A[i]);
	if(l < m) DC(l,m,A);
	if(m + 1 < r) DC(m + 1,r,A);
	}
void Init(int N,int A[]){
	n = N;
	DC(0,N - 1,A);
}
int Query(int L,int R){
	int l = 0,r = n - 1;
	while(l != r){
		int m = (l + r) / 2;
		if(L <= m && m < R) return Secret(prec[m][L],prec[m + 1][R]); 
		if(R == m) return prec[m][L];
		if(L > m) l = m + 1;
		else r = m;
		}
	return prec[l][l];
	}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 113 ms 4356 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 115 ms 4344 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 118 ms 4360 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 433 ms 8100 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 427 ms 8156 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 457 ms 8068 KB Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445.
7 Incorrect 431 ms 8180 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 454 ms 8112 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 465 ms 8256 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 438 ms 8104 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.