report VI VI EN
Register | Login
  • HOME
  • PROBLEMSET
  • ROADMAP
  • COMPETITION
  • TOPIC
  • RANKING
  • GUIDE
  • MASHUP
  • ABOUT
  • CONTACT
Module Rerooting

Rerooting

**Frequency: 3/10** Reroot the tree to calculate new answer for the new root.

Resources

- [USACO: DP on Trees - Solving For All Roots ](https://usaco.guide/gold/all-roots?lang=cpp)

Problems

Tree distance 214 / 229 1400
Tree distance 2 207 / 207 1500
Tree weight 154 / 162 1600
World tree 22 / 31 2000

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)