oj.uz

답안 #652556

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
652556 2022-10-23T06:39:26 Z rsjw 비밀 (JOI14_secret) C++17
0 / 100
 493 ms 4340 KB 
#include "secret.h"
int n;
int a[1005];
int B[1005];
int f[8][1005];
void divi(int l = 1, int r = n, int rt = 0) {
	if (l == r || l + 1 == r)
		return;
	int m = (l + r) / 2, i;
	f[rt][m] = a[m];
	f[rt][m + 1] = a[m + 1];
	for (i = m - 1; i >= l; i--)
		f[rt][i] = Secret(a[i], f[rt][i + 1]);
	for (i = m + 2; i <= r; i++)
		f[rt][i] = Secret(f[rt][i - 1], a[i]);
	divi(l, m, rt + 1);
	divi(m + 1, r, rt + 1);
}
void Init(int N, int A[]) {
	int i;
	n = N;
	for (i = 0; i < N; i++)
		B[i] = A[i];
	for (int i = 1; i <= n; i++)
		a[i] = A[i - 1];
	divi();
}
int dS(int L, int R, int l = 1, int r = n, int rt = 0) {
	int m = (l + r) / 2, i;
	if (R <= m)
		return dS(L, R, l, m, rt + 1);
	if (L > m)
		return dS(L, R, m + 1, r, rt + 1);
	return rt;
}

int Query(int L, int R) {
	if (L == R)
		return B[L];
	if (L + 1 == R)
		return Secret(B[L], B[L + 1]);
	L++, R++;
	int rt = dS(L, R);
	return Secret(f[rt][L], f[rt][R]);
}

Compilation message

secret.cpp: In function 'int dS(int, int, int, int, int)':
secret.cpp:29:23: warning: unused variable 'i' [-Wunused-variable]
   29 |  int m = (l + r) / 2, i;
      |                       ^

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 2356 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 129 ms 2388 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 136 ms 2480 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Incorrect 472 ms 4280 KB Wrong Answer: Query(955, 956) - expected : 283256648, actual : 659997790.
5 Incorrect 479 ms 4272 KB Wrong Answer: Query(957, 957) - expected : 115761809, actual : 414078098.
6 Incorrect 472 ms 4256 KB Wrong Answer: Query(915, 915) - expected : 282904741, actual : 171305619.
7 Correct 462 ms 4184 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 483 ms 4340 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 481 ms 4324 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 493 ms 4244 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1