#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000;
const int maxlvl = 10;
int n;
int DVC[maxlvl][maxn];
void create(int lvl, int l, int r, int A[]) {
if (l == r) {
DVC[lvl][l] = A[l];
return;
}
int m = (l + r) >> 1;
// left side
DVC[lvl][m] = A[m];
for (int i = m - 1; i >= l; i--) DVC[lvl][i] = Secret(A[i], DVC[lvl][i + 1]);
// right side
DVC[lvl][m + 1] = A[m + 1];
for (int i = m + 2; i <= r; i++) DVC[lvl][i] = Secret(DVC[lvl][i - 1], A[i]);
create(lvl + 1, l, m, A);
create(lvl + 1, m + 1, r, A);
}
int get(int lvl, int l, int r, int L, int R) {
if (l == r) return DVC[lvl][L];
int m = (l + r) >> 1;
if (R <= m) return get(lvl + 1, l, m, L, R);
if (L >= m+1) return get(lvl + 1, m+1, r, L, R);
return Secret(DVC[lvl][L], DVC[lvl][R]);
}
void Init(int N, int A[]) {
n = N;
create(0, 0, n - 1, A);
for (int i = 0; i < 10; i++) {
for (int j = 0; j < n; j++) {
}
}
}
int Query(int L, int R) {
return get(0, 0, n - 1, L, R);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
122 ms |
2380 KB |
Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1 |
2 |
Correct |
128 ms |
2400 KB |
Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1 |
3 |
Runtime error |
116 ms |
4684 KB |
Execution killed with signal 11 |
4 |
Runtime error |
466 ms |
8452 KB |
Execution killed with signal 11 |
5 |
Runtime error |
469 ms |
8500 KB |
Execution killed with signal 11 |
6 |
Runtime error |
451 ms |
8560 KB |
Execution killed with signal 11 |
7 |
Runtime error |
514 ms |
8556 KB |
Execution killed with signal 11 |
8 |
Runtime error |
492 ms |
8488 KB |
Execution killed with signal 11 |
9 |
Runtime error |
487 ms |
8544 KB |
Execution killed with signal 11 |
10 |
Runtime error |
479 ms |
8668 KB |
Execution killed with signal 11 |