PrevNext
Somewhat Frequent
 0/26

Binary Jumping

Author: Benjamin Qi

Introduces the problems of finding level ancestors in a tree and computing the lowest common ancestors.

Binary Jumping

Focus Problem – read through this problem before continuing!

Tutorial

Solution

This section is not complete.

Any help would be appreciated! Just submit a Pull Request on Github.

Problems

StatusSourceProblem NameDifficultyTagsSolutionURL
CSESEasyView Solution
CSESNormal
Show Tags

Func Graph

POINormal
CFNormalCheck CF
Baltic OINormalExternal Sol
Baltic OINormal
PlatHard
Show Tags

Binary Jumping

External Sol
Baltic OIVery Hard

Lowest Common Ancestor

Focus Problem – read through this problem before continuing!

Focus Problem – read through this problem before continuing!

Tutorial

Optional: Improvements

Implementation

Resources
Benq

This section is not complete.

Any help would be appreciated! Just submit a Pull Request on Github.

Problems

USACO

StatusSourceProblem NameDifficultyTagsSolutionURL
PlatEasy
Show Tags

LCA

External Sol
PlatNormal
Show Tags

LCA

External Sol
PlatHard
Show Tags

LCA

External Sol
PlatHard
Show Tags

Diameter

External Sol
PlatHard
Show Tags

LCA

External Sol
PlatVery Hard
Show Tags

LCA

External Sol

General

StatusSourceProblem NameDifficultyTagsSolutionURL
CFEasy
Show Tags

BinJump

Check CF
CFNormal
Show Tags

LCA

Check CF
Baltic OINormal
CFNormal
Show Tags

LCA

Check CF
CSANormal
Show Tags

LCA

Check CSA
CFNormal
Show Tags

LCA

Check CF
DMOJNormal
Show Tags

LCA

Check DMOJ
TLXHard
Show Tags

LCA

Check TLX
TLXHard
Show Tags

LCA

Check TLX

This section is not complete.

Any help would be appreciated! Just submit a Pull Request on Github.

figure out a better way to order these, difficulties aren't rlly accurate

Module Progress:

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!

Give Us Feedback on Binary Jumping!

Leave suggestions for us by making a post on the USACO Forum! Ex: Unclear sections, mislabeled problems, etc.

PrevNext