Hello there I've been reading up on MO's algorithm and sqrt decomposition and i think i've figured out the concept
so i'm trying to solve this problem but i keep getting TLE and i can't seem to figure out what i'm doing wrong
Here's my code
Thank you all in advance :D
Change some strings:
this->bucket = ord/bsize
onthis->bucket = l/bsize
if (q1.bucket!=q2.bucket) return q1.r<q2.r;
onif (q1.bucket==q2.bucket) return q1.r<q2.r;
Now it passed 49 tests instead of 5 14994457 Maybe there are some another bugs.
well what you said plus using int instead of long long all over except for the results got me an Accepted :D thank you so much man
I got TLE as well initially. Try coordinate compression because it got me AC finally.
why would you use coordinate compression when 1 <= ai <= 10^6 ? 15606407
As multiplication is costly operation, instead of using (t*t-(t-1)*(t-1)) replace by (2*t — 1) I got AC
15606787
and the changes given by komendart
The little things that one should be careful of
Thank you for pointing that out