Not Frequent
0/1
Treaps
Author: Benjamin Qi
?
| Resources | |||
|---|---|---|---|
| GCP | splitting & merging with code | ||
Splitting
Merging
Merging (Arbitrary Keys)
Tree Rotations 2 Solution
Optional
This CF post describes a more general version of the problem above.
Tutorial
Notes
- For speed / memory, use arrays of fixed size rather than pointers.
Problems
Nested
IOI 2013 Game - https://oj.uz/submission/242393
A2OJ: https://a2oj.com/category?ID=14
https://szkopul.edu.pl/problemset/problem/2yK6zUTXvAjhxSDfbjE4Zx7k/site/?key=statement
?
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!