#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
Tran The Bao
CTL - Da Lat
Cay ngay cay dem nhung deo duoc cong nhan
*/
const int MAXN = 1000;
int n, d[MAXN][MAXN];
void build(int l, int r, int a[]) {
if (l == r) {
d[l][l] = a[l];
return;
}
int mid = l + (r - l) / 2;
build(l, mid, a);
build(mid + 1, r, a);
FOR(i, mid + 1, r) d[l][i] = Secret(d[l][mid], d[mid + 1][i]);
FOR(i, l, mid) d[i][r] = Secret(d[i][mid], d[mid + 1][r]);
}
void Init(int N, int A[]) {
n = N;
build(0, N - 1, A);
}
int Query(int L, int R) {
int l = 0, r = n - 1;
WHILE(1) {
int mid = l + (r - l) / 2;
if (L <= mid && mid <= R) {
int a = d[L][mid], b = (mid + 1 > R? -1 : d[mid + 1][R]);
if (b != -1) return Secret(a, b);
return a;
}
if (mid < L) l = mid + 1;
else r = mid;
}
return 0;
}
Compilation message
secret.cpp: In function 'void build(int, int, int*)':
secret.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
| ^
secret.cpp:48:5: note: in expansion of macro 'FOR'
48 | FOR(i, mid + 1, r) d[l][i] = Secret(d[l][mid], d[mid + 1][i]);
| ^~~
secret.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
| ^
secret.cpp:49:5: note: in expansion of macro 'FOR'
49 | FOR(i, l, mid) d[i][r] = Secret(d[i][mid], d[mid + 1][r]);
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
122 ms |
4276 KB |
Output is correct - number of calls to Secret by Init = 4598, maximum number of calls to Secret by Query = 1 |
| 2 |
Correct |
122 ms |
4476 KB |
Output is correct - number of calls to Secret by Init = 4608, maximum number of calls to Secret by Query = 1 |
| 3 |
Correct |
119 ms |
4272 KB |
Output is correct - number of calls to Secret by Init = 4619, maximum number of calls to Secret by Query = 1 |
| 4 |
Partially correct |
425 ms |
8268 KB |
Output isn't correct - number of calls to Secret by Init = 9965, maximum number of calls to Secret by Query = 1 |
| 5 |
Partially correct |
426 ms |
8112 KB |
Output isn't correct - number of calls to Secret by Init = 9976, maximum number of calls to Secret by Query = 1 |
| 6 |
Partially correct |
422 ms |
8100 KB |
Output isn't correct - number of calls to Secret by Init = 9976, maximum number of calls to Secret by Query = 1 |
| 7 |
Partially correct |
430 ms |
8312 KB |
Output isn't correct - number of calls to Secret by Init = 9976, maximum number of calls to Secret by Query = 1 |
| 8 |
Partially correct |
432 ms |
8232 KB |
Output isn't correct - number of calls to Secret by Init = 9976, maximum number of calls to Secret by Query = 1 |
| 9 |
Partially correct |
426 ms |
8348 KB |
Output isn't correct - number of calls to Secret by Init = 9976, maximum number of calls to Secret by Query = 1 |
| 10 |
Partially correct |
423 ms |
8260 KB |
Output isn't correct - number of calls to Secret by Init = 9976, maximum number of calls to Secret by Query = 1 |
