#include "secret.h"
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left224
#define right right224
#define next next224
#define rank rank224
#define prev prev224
#define y1 y1224
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define mp make_pair
const int MAXN = 1001;
int n;
int val[MAXN][10];
int val1[MAXN][10];
void Init(int N, int A[]) {
n = N;
for (int i = 0; i < n; i++) {
val[i][0] = A[i];
val1[i][0] = A[i];
}
for (int k = 1; k <= 9; k++) {
for (int i = 0; i < n; i++) {
int f = i % (1 << k);
if (i - f == i - i % (1 << (k - 1))) {
val[i][k] = val[i][k - 1];
} else {
val[i][k] = Secret(val[i - 1][k], val[i][0]);
}
}
for (int i = n - 1; i >= 0; i--) {
if (i % (1 << k) == 0) {
val1[i][k] = val[min(n - 1, i + (1 << k) - 1)][k];
continue;
}
if (i == n - 1 || (i % (1 << k)) == (1 << k) - 1) {
val1[i][k] = val1[i][0];
continue;
}
int g = i % (1 << k);
int ft = (1 << k) - g - 1;
int g1 = i % (1 << (k - 1));
int ft1 = (1 << (k - 1)) - g1 - 1;
int h = i + ft;
int h1 = i + ft1;
if (h == h1) {
val1[i][k] = val1[i][k - 1];
} else {
val1[i][k] = Secret(val1[i][0], val1[i + 1][k]);
}
}
}
}
int Query(int L, int R) {
int l = L;
int r = R;
int g = 1;
int f = 0;
while (g * 2 <= r - l + 1) {
g <<= 1;
f++;
}
for (int i = l; i <= r; i++) {
if (i != 0 && i % (g * 2) == 0) {
g++;
f++;
}
}
if (l % g == 0) {
return val1[l][f];
}
int f = l - l % g + g;
assert(f <= r);
assert(f + g > r);
return Secret(val1[l][f], val[r][f]);
}
Compilation message
secret.cpp: In function 'int Query(int, int)':
secret.cpp:108:6: error: redeclaration of 'int f'
int f = l - l % g + g;
^
secret.cpp:94:6: note: 'int f' previously declared here
int f = 0;
^
