Graphs -> Euler Tour Tree¶

Dynamic-forest subtree structure for online link/cut, reroot by sequence rotation, and subtree-side aggregates on one changing tree forest.

Microtopics¶

Source	Type
OI Wiki Euler Tour Tree	`Reference`
Library Checker Dynamic Tree Vertex Add Subtree Sum statement	`Primary`

Source	Type
Library Checker Dynamic Tree Vertex Add Subtree Sum	`Practice`
Library Checker Dynamic Tree Subtree Add Subtree Sum	`Practice`

Material	Type
Euler Tour Tree hot sheet	`quick reference`
Euler Tour Tree starter route	`starter route`
Dynamic Tree Vertex Add Subtree Sum note	`anchor note`
Link-Cut Tree tutorial	`compare point`
Euler Tour / Subtree Queries tutorial	`compare point`
Treap / Implicit Treap tutorial	`compare point`

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Dynamic Tree Vertex Add Subtree Sum	`Library Checker`	`Very Hard`	Dynamic Trees	Dynamic Trees; Subtree Aggregate; Verifier	Rooted Tree Intuition; Split / Merge Sequence; Make Root By Rotation	Dynamic Forest; Subtree Sum; Vertex Add	The cleanest exact verifier for the first narrow Euler-tour-tree route: dynamic forest, point add on vertices, and subtree-side sums on one existing edge.

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Dynamic Tree Subtree Add Subtree Sum	`Library Checker`	`Very Hard`	Dynamic Trees	Dynamic Trees; Lazy Range Update; Verifier	Euler Tour Tree; Subtree Interval View; Lazy Propagation	Dynamic Forest; Lazy Propagation; Subtree Sum	A natural stretch once the point-add route is trusted and the same subtree-side interval view must carry a stronger lazy update.

Code	Title	Fit	Difficulty	Pattern	Note	Solution
`DYNAMICTREEVERTEXADDSUBTREESUM`	Dynamic Tree Vertex Add Subtree Sum	`primary`	`very hard`	-	Note	Code

python3 scripts/generate_problem_catalog.py