# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Let $$$y_1$$$ be a point on the coordinate plane where $$$y_1$$$ is more optimal than some $$$y_j$$$.
This can only be true if $$$y_1 \cdot y_j \equiv 2 \text{ }(\text{mod } 10^9 + 7)$$$.
left as an exersise for the reader lol
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.me/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...
Name |
---|