#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
/*int Secret(int a, int b) {
return min(a, b);
}*/
const int mxN = 1000, mxK = 12;
int n, a[mxN];
int tl[mxN][mxK], tr[mxN][mxK];
void Init(int N, int A[]) {
n = N;
for (int i = 0; i < n; ++i) {
a[i] = A[i];
}
for (int j = 0; (1 << j) <= n; ++j) {
int mask = (1 << j) - 1;
int temp;
for (int i = 0; i < n; ++i) {
temp = ((i & mask) == 0) ? a[i] : Secret(temp, a[i]);
tl[i][j] = temp;
}
for (int i = n - 1; ~i; --i) {
temp = ((i & mask) == mask || i == n - 1) ? a[i] : Secret(a[i], temp);
tr[i][j] = temp;
}
}
}
int Query(int L, int R) {
if (L == R) return a[L];
int x = 31 - __builtin_clz(L ^ R);
return Secret(tr[L][x], tl[R][x]);
}
/*int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a[3] = {2, 1, 3};
Init(3, a);
for (int i = 0; i < 3; ++i) for (int j = i; j < 3; ++j) cout << i << " " << j << " " << Query(i, j) << "\n";
return 0;
}*/
Compilation message
secret.cpp: In function 'void Init(int, int*)':
secret.cpp:22:44: warning: 'temp' may be used uninitialized in this function [-Wmaybe-uninitialized]
22 | temp = ((i & mask) == 0) ? a[i] : Secret(temp, a[i]);
| ~~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
146 ms |
2428 KB |
Output is correct - number of calls to Secret by Init = 7156, maximum number of calls to Secret by Query = 1 |
| 2 |
Partially correct |
149 ms |
2424 KB |
Output isn't correct - number of calls to Secret by Init = 8194, maximum number of calls to Secret by Query = 1 |
| 3 |
Partially correct |
150 ms |
2424 KB |
Output isn't correct - number of calls to Secret by Init = 8194, maximum number of calls to Secret by Query = 1 |
| 4 |
Partially correct |
514 ms |
4472 KB |
Output isn't correct - number of calls to Secret by Init = 15982, maximum number of calls to Secret by Query = 1 |
| 5 |
Partially correct |
517 ms |
4472 KB |
Output isn't correct - number of calls to Secret by Init = 16000, maximum number of calls to Secret by Query = 1 |
| 6 |
Partially correct |
512 ms |
4472 KB |
Output isn't correct - number of calls to Secret by Init = 16000, maximum number of calls to Secret by Query = 1 |
| 7 |
Partially correct |
518 ms |
4460 KB |
Output isn't correct - number of calls to Secret by Init = 16000, maximum number of calls to Secret by Query = 1 |
| 8 |
Partially correct |
525 ms |
4504 KB |
Output isn't correct - number of calls to Secret by Init = 16000, maximum number of calls to Secret by Query = 1 |
| 9 |
Partially correct |
517 ms |
4504 KB |
Output isn't correct - number of calls to Secret by Init = 16000, maximum number of calls to Secret by Query = 1 |
| 10 |
Partially correct |
512 ms |
4344 KB |
Output isn't correct - number of calls to Secret by Init = 16000, maximum number of calls to Secret by Query = 1 |
