Planet Queries I (CSES) | Binary Lifting Explained from Scratch скачать в хорошем качестве

Planet Queries I (CSES) | Binary Lifting Explained from Scratch

🪐 In this video, we take on Planet Queries I from the CSES Problem Set — a classic problem that introduces us to one of the most powerful techniques in competitive programming: Binary Lifting. You're given a teleportation setup where each planet points to another, and the goal is to quickly compute where you'll land after k jumps from any given planet. Instead of simulating all k jumps (which would be too slow), we use the concept of jumping in powers of 2 — also known as Binary Lifting. This reduces our time complexity from O(k) to O(log k) per query. 🎯 What you’ll learn: The intuition behind binary lifting How to precompute ancestor tables using 2^i jumps How to handle up to 1e5 queries efficiently Why this technique is essential for problems like LCA, jumps in trees, and power jumps in graphs Whether you're solving trees, jumps, or fast-forwarding through states — Binary Lifting is a must-have trick in your CP toolkit, and this problem is the perfect place to start. 📄 𝐍𝐨𝐭𝐞𝐬: https://github.com/yash7xm/cp_notes/t... 📘 This video is part of the CSES Graphs + Advanced Techniques Series, where you don't just memorize — you understand.