My website

I’ll show you how I ended up implementing a sparse Lazy Segment Tree to solve a problem. There is a problem on oj.uz called Monkey and Apple-trees that involves range updates and range queries, but there is a small issue: the constraints are too large to build a data structure... [Read More]

Today I’ll talk about a trick that I learned in the Maratona de Programação Brasil group that I call the $(x + y, x - y)$ trick. This trick rotates a 2D grid by 45° and enables you to answer queries involving Manhattan distances, because after applying this transformation to... [Read More]

If you don’t know Yosupo, it’s a site for testing Competitive Programming libraries. For that, there are some problems on ranges, geometry, data structures, strings, and others. Here I’m going to talk about one problem called Range Kth Smallest, which is basically about finding the k-th element inside an interval... [Read More]

Today, I’m here to talk about a nice problem from Beecrowd called Daenerys’ Game of Trust . It’s a string and game problem, it has level 10, and at the time I’m writing this blog, only 97 out of 400 people have solved it. [Read More]

C++20/C++23 introduced new tools, and one of them is the ranges library, inspired by the well-known range-v3. This standard library made it possible to work with ranges in a way never seen before. Now you can use functions such as transform, filter, drop, take, join, and many others. All of... [Read More]