#include<bits/stdc++.h>
#include "secret.h"
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define task "hopscotch"
#define pii pair<ll, pll>
using namespace std;
using ll = long long;
const int N = 1e3+55;
const ll mod = 998244353;
const ll base = 350;
const ll cs = 331;
ll m, n, t, k, a[N], ans, tong, b[N], c[N], d[N], P[N][12];
vector<ll> adj[N], kq;
ll pw(ll k, ll n)
{
ll total = 1;
for(; n; n >>= 1)
{
if(n & 1)total = total * k % mod;
k = k * k % mod;
}
return total;
}
ll findp(ll u, ll lab[])
{
return lab[u] < 0 ? u : lab[u] = findp(lab[u], lab);
}
void hop(ll u, ll v, ll lab[])
{
u = findp(u, lab);
v = findp(v, lab);
if(u == v)return;
if(lab[u] > lab[v])swap(lab[u], lab[v]);
lab[u] += lab[v];
lab[v] = u;
}
void dfs(ll u, ll p)
{
for(ll v : adj[u])
{
if(v == p)continue;
}
}
void build(int l, int r, int lv)
{
if(l > r)return;
ll mid = (l + r) / 2;
P[mid][id] = b[mid];
P[mid+1][id] = b[mid+1];
for(int i = mid-1; i >= l; i --)P[i][id] = Secret(b[i], P[i+1][id]);
a[mid+1] ^= (1<<lv);
for(int i = mid+2; i <= r; i ++)
{
P[i][id] = Secret(b[i], P[i-1][id]);
a[i] ^= (1<<lv);
}
build(l, mid, id+1);
build(mid+1, r, id+1);
}
void Init(int N, int A[])
{
m = N;
for(int i = 0; i < m; i ++)b[i] = A[i];
build(0, m-1, 0);
}
int Query(int l, int r)
{
if(l == r)return b[l];
int id = __builtin_ctz(a[l]^a[r]);
return Secret(P[l][id], P[r][id]);
}
Compilation message
secret.cpp: In function 'void build(int, int, int)':
secret.cpp:53:12: error: 'id' was not declared in this scope; did you mean 'mid'?
53 | P[mid][id] = b[mid];
| ^~
| mid
