#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
const int O = 2e3 + 5;
//const int N = (1 << 20) + 5;
const int mod = 1e9 + 7; //998244353;
const int inf = 1e18;
int pr[] = {167772161, 469762049, 754974721, 1045430273, 1051721729, 1053818881};
const double eps = 1e-10;
int n, a[O], mask[O], f[21][O];
/*int Secret(int x, int y){
return x + y;
}/*
void DnC(int l, int r, int level){
if (level > 8) return;
int mid = (l + r) / 2;
DnC(l, mid, level + 1);
DnC(mid + 1, r, level + 1);
f[level][mid] = a[mid];
for (int i = mid - 1; i >= l; -- i) f[level][i] = Secret(f[level][i + 1], a[i]);
f[level][mid + 1] = a[mid + 1];
for (int i = mid + 2; i <= r; ++ i) f[level][i] = Secret(f[level][i - 1], a[i]);
for (int i = mid + 1; i <= r; ++ i) mask[i] |= (1 << level);
}
void Init(int N, int A[]){
for (int i = 0; i < N; ++ i){
a[i] = A[i];
mask[i] = 0;
}
DnC(0, N - 1, 0);
}
int Query(int L, int R){
if (L == R) return a[L];
if (L + 1 == R){
return Secret(a[L], a[R]);
}
int x, cur = mask[L] ^ mask[R];
for (int i = 0; i < 10; ++ i){
if (cur >> i & 1){
x = i;
break;
}
}
return Secret(f[x][L], f[x][R]);
}
/*main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++ i){
cin >> a[i];
}
Init(n, a);
int q; cin >> q;
while (q --){
int l, r; cin >> l >> r;
cout << Query(l, r) << endl;
}
}*/
/**
**/
Compilation message
secret.cpp:17:2: warning: "/*" within comment [-Wcomment]
17 | }/*
|
secret.cpp:59:1: warning: "/*" within comment [-Wcomment]
59 | /*main(){
|
secret.cpp:9:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
9 | const int inf = 1e18;
| ^~~~
/usr/bin/ld: /tmp/ccscMC4s.o: in function `main':
grader.cpp:(.text.startup+0x2a8): undefined reference to `Init(int, int*)'
/usr/bin/ld: grader.cpp:(.text.startup+0x30b): undefined reference to `Query(int, int)'
collect2: error: ld returned 1 exit status
