Why fixing Box size in mo's algorithm makes code faster
In my opinion, using box size as (int)sqrt(n) is best for mo's algorithm.
But my two submissions differ in just that(fixing block size or taking it as (int)sqrt(n), and one gets TLE and other one gets AC.
What is the logic here ?
Round 1975 Div 1 + Div 2 Solution Discussion (with Jan)