Small-To-Large¶

Rooted-tree subtree queries where each child contributes a mergeable container and smaller containers are merged into larger surviving ones.

Microtopics¶

Source	Type
USACO Guide Small-To-Large Merging	`Reference`
OI Wiki DSU on Tree	`Reference`
SOI Wiki Smaller to Larger	`Reference`

Source	Type
CSES Distinct Colors	`Practice`
Codeforces Lomsat gelral	`Practice`

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Distinct Colors	`CSES`	`Hard`	Subtree Queries	Small-To-Large Merging; Subtree Frequency Maps; Offline Aggregation	Rooted Tree; Frequency Maps; Subtree Traversal	Distinct Values; Subtree Aggregation; Small-To-Large	The cleanest first benchmark where each subtree owns a mergeable color-frequency container and the whole optimization is just small-to-large merging.

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Lomsat gelral	`Codeforces`	`Hard`	Subtree Queries	Small-To-Large Merging; Frequency Aggregation; Heavy Child Compare Point	DSU On Tree; Frequency Maps; Subtree Traversal	Color Frequency; Subtree Aggregation; Small-To-Large	A classic follow-up where the merged container must track richer frequency information than just distinct-count size.

Code	Title	Fit	Difficulty	Pattern	Note	Solution
`DISTINCTCOLORS`	Distinct Colors	`primary`	`hard`	-	Note	Code

python3 scripts/generate_problem_catalog.py