#include "secret.h"
int a[1212], n;
int L[1212][1212];
int R[1212][1212];
void init(int now, int s, int e) {
if (s == e)return;
int m = (s + e) / 2;
init(now * 2, s, m), init(now * 2 + 1, m + 1, e);
L[now][0] = a[m]; R[now][0] = a[m + 1];
for (int i = m - 1, j = 1; i >= s; i--, j++)L[now][j] = Secret(a[i], L[now][j - 1]);
for (int i = m + 2, j = 1; i <= e; i++, j++)R[now][j] = Secret(R[now][j - 1], a[i]);
}
void Init(int N, int A[]) {
n = N;
for (int i = 0; i < N; i++)a[i] = A[i];
init(1, 0, n - 1);
}
int QR(int now, int l, int r, int s, int e) {
int m = (s + e) / 2;
if (m < l)return QR(now*2, l, r, s, m);
if (r < m)return QR(now*2+1, l, r, m + 1, e);
return Secret(L[now][m - l], R[now][r - (m + 1)]);
}
int Query(int L, int R) {
if (L == R)return a[L];
return QR(1, L, R, 0, n - 1);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
20063 ms |
6488 KB |
Time limit exceeded |
| 2 |
Execution timed out |
20018 ms |
6504 KB |
Time limit exceeded |
| 3 |
Execution timed out |
20055 ms |
6708 KB |
Time limit exceeded |
| 4 |
Execution timed out |
20095 ms |
12648 KB |
Time limit exceeded |
| 5 |
Execution timed out |
20010 ms |
12648 KB |
Time limit exceeded |
| 6 |
Execution timed out |
20097 ms |
12648 KB |
Time limit exceeded |
| 7 |
Correct |
646 ms |
12648 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
| 8 |
Correct |
586 ms |
12648 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
| 9 |
Correct |
639 ms |
12648 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
| 10 |
Correct |
649 ms |
12648 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
