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

Divide and conquer

**Frequency: 4.5/10**

Resources

- [USACO: Divide & Conquer - SRQ](https://usaco.guide/plat/DC-SRQ?lang=cpp)

Problems

Product 202 / 219 1900
Big board 77 / 86 2000
Segment queries 104 / 117 2000
xor xor xor 93 / 110 2100
Coins flip 41 / 68 2200
Slimes 23 / 81 2200
4D longest path 35 / 45 2200
Good subarray 41 / 135 2300
Shortest path on grid 30 / 37 2300
Dynamic MST 27 / 43 2500

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)