//#include <iostream> //cin, cout
#include "secret.h"
/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/
// includes
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>
//usings
using namespace std;
using namespace __gnu_pbds;
// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;
// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()
// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second
// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// maps
#define mii map<int, int>
#define mll map<ll, ll>
// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRe(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define Fe(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)
int n;
vvi v; vi m, a;
void go(int l, int r, int x){
if(l == r) return;
int m = (l + r) / 2;
v[x][m] = a[m];
for(int i = m - 1; i >= l; i--) v[x][i] = Secret(v[x][i + 1], a[i]);
v[x][m + 1] = a[m + 1];
for(int i = m + 2; i <= r; i++) v[x][i] = Secret(v[x][i - 1], a[i]);
for(int i = m + 1; i <= r; i++) m[i] ^= 1 << x;
go(l, m, x + 1);
go(m + 1, r, x + 1);
}
void Init(int N, int A[]){
n = N;
v = vvi(10, vi(n));
a = m = vi(n);
A(i, n) cin >> a[i];
go(0, n - 1, 0);
}
int Query(int L, int R){
if(L == r) return a[L];
int bits = __builtin_ctz(m[L] ^ m[R]);
return Secret(v[bits][L], v[bits][R]);
}
Compilation message
secret.cpp: In function 'void go(int, int, int)':
secret.cpp:101:35: error: invalid types 'int[int]' for array subscript
101 | for(int i = m + 1; i <= r; i++) m[i] ^= 1 << x;
| ^
secret.cpp: In function 'void Init(int, int*)':
secret.cpp:110:7: error: 'begin' was not declared in this scope; did you mean 'std::begin'?
110 | A(i, n) cin >> a[i];
| ^
secret.cpp:88:31: note: in definition of macro 'A'
88 | #define A(x, y) for(auto &x : y)
| ^
In file included from /usr/include/c++/10/set:63,
from secret.cpp:14:
/usr/include/c++/10/bits/range_access.h:108:37: note: 'std::begin' declared here
108 | template<typename _Tp> const _Tp* begin(const valarray<_Tp>&);
| ^~~~~
secret.cpp:110:7: error: 'end' was not declared in this scope; did you mean 'std::end'?
110 | A(i, n) cin >> a[i];
| ^
secret.cpp:88:31: note: in definition of macro 'A'
88 | #define A(x, y) for(auto &x : y)
| ^
In file included from /usr/include/c++/10/set:63,
from secret.cpp:14:
/usr/include/c++/10/bits/range_access.h:110:37: note: 'std::end' declared here
110 | template<typename _Tp> const _Tp* end(const valarray<_Tp>&);
| ^~~
secret.cpp:110:10: error: 'cin' was not declared in this scope
110 | A(i, n) cin >> a[i];
| ^~~
secret.cpp:28:1: note: 'std::cin' is defined in header '<iostream>'; did you forget to '#include <iostream>'?
27 | #include <chrono>
+++ |+#include <iostream>
28 |
secret.cpp: In function 'int Query(int, int)':
secret.cpp:114:10: error: 'r' was not declared in this scope
114 | if(L == r) return a[L];
| ^
