oj.uz

답안 #901769

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
901769 2024-01-10T02:02:24 Z trMatherz 비밀 (JOI14_secret) C++17
100 / 100
 387 ms 8396 KB 
#include "secret.h"

int prefix[1000][1000], n;

void populate(int L, int R, int A[]) {
	int mid = (L + R) / 2;
	prefix[mid][mid] = A[mid];
	prefix[mid + 1][mid + 1] = A[mid + 1];

	for (int i = mid + 2; i <= R; i++)
		prefix[mid + 1][i] = Secret(prefix[mid + 1][i - 1], A[i]);
	for (int i = mid - 1; i >= L; i--)
		prefix[mid][i] = Secret(A[i], prefix[mid][i + 1]);

	if (L < mid) populate(L, mid, A);
	if (mid + 1 < R) populate(mid + 1, R, A);
}

void Init(int N, int A[]) {
	n = N;
	populate(0, N - 1, A);
}

int Query(int L, int R) {
	int a = 0, b = n - 1;

	while (a != b) {
		int mid = (a + b) / 2;
		if (mid >= L && mid < R)
			return Secret(prefix[mid][L], prefix[mid + 1][R]);
		else if (mid == R) return prefix[mid][L];
		else if (mid < L) a = mid + 1;
		else b = mid;
	}

	return prefix[a][a];
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 7608 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 106 ms 7592 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 108 ms 7660 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 373 ms 8268 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 387 ms 8396 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 364 ms 8276 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 372 ms 8312 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 370 ms 8280 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 374 ms 8292 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 361 ms 8276 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1