We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I tried switching translations and selecting "english". Still got the same gibberish though....
I would really appreciate problem statements written in an understandable form. It would appear that 90% of the challenge is understanding what's expected and only 10% actually implementing it...
Mods, please check problem statements before releasing them on us unsuspecting mortals :)
If the time complexity of calculating U and V is O(n), then the time complexity for calculating 1 dimension is O(n^2) which means the time complexity on the whole is O(dn^2). Your editorial seems to be incorrect.
I tried switching translations and selecting "english". Still got the same gibberish though.... I would really appreciate problem statements written in an understandable form. It would appear that 90% of the challenge is understanding what's expected and only 10% actually implementing it... Mods, please check problem statements before releasing them on us unsuspecting mortals :)
If the time complexity of calculating U and V is O(n), then the time complexity for calculating 1 dimension is O(n^2) which means the time complexity on the whole is O(dn^2). Your editorial seems to be incorrect.
Hi @rawrbob, it seems you missed some parts of editorial. Please check it (mainly optimization portion).
(1) How is this a geometry problem? (2) typo in code: i should be from 1 to n-1.
That's the naive approach. O(dn log n) definitely exists. (Haven't read the editorial)