oj.uz

답안 #754030

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
754030 2023-06-06T13:32:49 Z Zflop 비밀 (JOI14_secret) C++14
0 / 100
 450 ms 8272 KB 
#include "secret.h"
const int NMAX = (int)1e3;
int n;
int prec[NMAX][NMAX];
void DC	(int l,int r,int A[]){
	if(l >= r) return;
	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[i + 1][m],A[i]);
	for (int i = m + 2; i <= r;++i) prec[m + 1][i] = Secret(prec[m + 1][i - 1],A[i]);
	DC(l,m,A);
	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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 115 ms 4372 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 115 ms 4384 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 476715264.
3 Incorrect 114 ms 4428 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 681867574.
4 Incorrect 450 ms 8272 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 877691005.
5 Incorrect 444 ms 8260 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 992510282.
6 Incorrect 431 ms 8204 KB Wrong Answer: Query(200, 208) - expected : 277813445, actual : 688628673.
7 Incorrect 447 ms 8232 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 119153770.
8 Incorrect 430 ms 8252 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 207936512.
9 Incorrect 438 ms 8208 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 420488844.
10 Incorrect 438 ms 8256 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 272908353.