#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "secret.h"
using namespace std;
using namespace __gnu_pbds;
#define ff first
#define ss second
#define ll int
#define ld long double
#define nl cout<<"\n"
#define all(v) v.begin(),v.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define forn(i,a,b) for(int64_t i=int64_t(a);i<int64_t(b);++i)
#define forb(i,a,b) for(int64_t i=int64_t(a);i>=int64_t(b);--i)
#define fastio() ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mod 1'000'000'007
#define mod2 998'244'353
#define inf 1'000'000'000'000'007
#define pi 3.14159265358979323846
template<class key,class cmp=std::less<key>>
using ordered_set=tree<key,null_type,cmp,rb_tree_tag,tree_order_statistics_node_update>;
template<class L,class R> ostream& operator<<(ostream& out,pair<L,R> &p) {return out<<"("<<p.ff<<", "<<p.ss<<")";}
template<class T> ostream& operator<<(ostream& out,vector<T> &v) {out<<"[";for(auto it=v.begin();it!=v.end();++it){if(it!=v.begin())out<<", ";out<<*it;}return out<<"]";}
template<class T> ostream& operator<<(ostream& out,deque<T> &v) {out<<"[";for(auto it=v.begin();it!=v.end();++it){if(it!=v.begin())out<<", ";out<<*it;}return out<<"]";}
template<class T> ostream& operator<<(ostream& out,set<T> &s) {out<<"{";for(auto it=s.begin();it!=s.end();++it){if(it!=s.begin())out<<", ";out<<*it;}return out<<"}";}
template<class L,class R> ostream& operator<<(ostream& out,map<L,R> &m) {out<<"{";for(auto it=m.begin();it!=m.end();++it){if(it!=m.begin())out<<", ";out<<*it;}return out<<"}";}
void dbg_out() {cerr<<"]\n";}
template<typename Head,typename... Tail>
void dbg_out(Head H,Tail... T) {cerr<<H;if(sizeof...(Tail))cerr<<", ";dbg_out(T...);}
#ifdef LOCAL
#define dbg(...) cerr<<"["<<#__VA_ARGS__<<"] = [",dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
//---------------------------------mars4---------------------------------
class Segtree
{
ll N;
public:
vector<ll> segtree;
void init(ll n,ll val=0)
{
N=n;
segtree=vector<ll>(N<<1,val);
}
void build(int A[])
{
forn(i,0,N)
segtree[i+N]=A[i];
forb(i,N-1,1)
segtree[i]=secret(segtree[i<<1],segtree[i<<1|1]);
}
ll query(ll l,ll r)
{
ll res=0;
for(l+=N,r+=N+1;l<r;l>>=1,r>>=1)
{
if(l&1) res=secret(res,segtree[l++]);
if(r&1) res=secret(res,segtree[--r]);
}
return res;
}
};
Segtree s;
void Init(int N,int A[])
{
s.init(N);
s.build(A);
}
int Query(int L,int R)
{
return s.query(L,R);
}
Compilation message
secret.cpp: In member function 'void Segtree::build(int*)':
secret.cpp:63:15: error: 'secret' was not declared in this scope; did you mean 'Secret'?
63 | segtree[i]=secret(segtree[i<<1],segtree[i<<1|1]);
| ^~~~~~
| Secret
secret.cpp: In member function 'int Segtree::query(int, int)':
secret.cpp:71:16: error: 'secret' was not declared in this scope; did you mean 'Secret'?
71 | if(l&1) res=secret(res,segtree[l++]);
| ^~~~~~
| Secret
secret.cpp:72:16: error: 'secret' was not declared in this scope; did you mean 'Secret'?
72 | if(r&1) res=secret(res,segtree[--r]);
| ^~~~~~
| Secret
