oj.uz

답안 #754026

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
754026 2023-06-06T13:31:18 Z Zflop 비밀 (JOI14_secret) C++14
0 / 100
 532 ms 8248 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[i][m] = Secret(prec[i + 1][m],A[i]);
	for (int i = m + 2; i <= r;++i) prec[m][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[L][m],prec[m + 1][R]); 
		if(R == m) return prec[L][m];
		if(L > m) l = m + 1;
		else r = m;
		}
	return prec[l][l];
	}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 112 ms 4324 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 50543498.
2 Incorrect 118 ms 4552 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 487293320.
3 Incorrect 113 ms 4384 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 75594064.
4 Incorrect 427 ms 8068 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 275432058.
5 Incorrect 448 ms 8176 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 242932050.
6 Incorrect 485 ms 8248 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 942318537.
7 Incorrect 456 ms 8120 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 706319466.
8 Incorrect 532 ms 8080 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 679860248.
9 Incorrect 488 ms 8108 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 155726091.
10 Incorrect 490 ms 8092 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 336940175.