Today we teach the ability to perform range queries in $$$\mathcal{O}(1)$$$, regardless of the query rekwaired.
Consider $$$Q = [l, r]$$$.
Iterate over all quadraubles $$$\left(a,b,c,d\right)$$$, add $$$Q[a]\times Q[b]\times Q[c] - Q[d]^2$$$
Now to solve single qwery, output $$$\text{Quadruble}[l][r^2][r-l^r][l+r^l]$$$.
The precomputation took $$$\mathcal{O}(1)$$$ time because $$$a,b,c,d\le 10^{18}$$$, a constant
You solve every query in $$$\mathcal{O}(1)$$$ cuz u immediately output the formula.
if you dont trust me, try it in this problem
you can see that my code is fastest ($$$0.00$$$ s)
actually the ones who will be in internation l olympiads of intormatica who will represant the united statat of amrika are
1- nor 2- Geothermal 3- xzm2024 4- awoo 5- Seryi 6- FerjaniSassi
they have officully qualified to the oio (olympiad international of intormatics), and they will participate offically
learn from the true red, this is how we write code https://codeforces.com/contest/4/submission/203467882
also people like Um_nik cant even be 1st because like they dont even know wavelet tree??? like it is so easy just make a tree
also a lot of people struggle to get to YELLOW which is the easiest rate to achieve,, because they write recursive segmant tree?? honestly go learn how to code...