oj.uz

답안 #70234

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
70234 2018-08-22T13:55:32 Z MladenP 비밀 (JOI14_secret) C++17
100 / 100
 707 ms 8708 KB 
#include "secret.h"
#define mid (l+r)/2
int n, i, a[1010], d[1010][1010];
void init(int l, int r) {
	if(l >= r) return;
	for(int i = mid+1; i <= r; i++) d[mid][i] = Secret(d[mid][i-1], a[i]);
	for(int i = mid-2; i >= l; i--) d[i][mid-1] = Secret(a[i], d[i+1][mid-1]);
	init(l, mid-1);init(mid+1, r);
}
void Init(int N, int A[]) {
	for(i = 1, n = N; i <= n; i++) a[i] = A[i-1], d[i][i] = a[i];
	init(1, N);
}
int query(int l, int r, int L, int R) {
	if(L < mid && mid <= R) return Secret(d[L][mid-1],d[mid][R]);
	if(L == mid) return d[mid][R];
	if(mid < L) return query(mid+1, r, L, R);
	return query(l, mid-1, L, R);
}
int Query(int L, int R) {
	L++;R++;if(L == R) return a[L];
	return query(1, n, L, R);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 4472 KB Output is correct - number of calls to Secret by Init = 3331, maximum number of calls to Secret by Query = 1
2 Correct 180 ms 4604 KB Output is correct - number of calls to Secret by Init = 3340, maximum number of calls to Secret by Query = 1
3 Correct 197 ms 4608 KB Output is correct - number of calls to Secret by Init = 3349, maximum number of calls to Secret by Query = 1
4 Correct 634 ms 8300 KB Output is correct - number of calls to Secret by Init = 7491, maximum number of calls to Secret by Query = 1
5 Correct 635 ms 8428 KB Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1
6 Correct 689 ms 8588 KB Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1
7 Correct 662 ms 8708 KB Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1
8 Correct 646 ms 8708 KB Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1
9 Correct 707 ms 8708 KB Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1
10 Correct 605 ms 8708 KB Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1