report VI VI EN
Register | Login
  • HOME
  • PROBLEMSET
  • ROADMAP
  • COMPETITION
  • TOPIC
  • RANKING
  • GUIDE
  • MASHUP
  • ABOUT
  • CONTACT
Module Small-to-large

Small-to-large

**Frequency: 5/10** This technique enables merging data structures really fast.

Resources

- [USACO: Small-To-Large merging](https://usaco.guide/plat/merging?lang=cpp)

Problems

Distinct colors 329 / 356 1400
Picking apples 258 / 318 1700
Frequent color 185 / 240 1800
Path with length k 2 153 / 161 1800
LIS on tree 116 / 143 1900

Data structure

  • Sweep Line
  • Introduction to Trie
  • Square root decomposition

Tree

  • Rerooting
  • Small-to-large
  • Heavy-light decomposition

Graph

  • Strongly connect component
  • Articulation point and bridge
  • Bipartite Matching

Dynamic Programming

  • Digit DP
  • Matrix multiplication

Hashing

  • Hash a set

Others

  • Divide and conquer

Geometry

  • Geometry

Binary search

  • Parallel binary search

Others

  • Additional Problems (Level 5)