Contest Core Switching 01¶
This pack is for breadth and gear-switching once the main contest-core families already feel familiar.
Who This Is For¶
Use this pack if:
- you have already solved several focused ladder problems
- switching between data structures, graphs, DP, strings, and math still feels slow
- you want a light contest-style drill without committing to a full contest set
Entry Gate¶
Try this pack only if at least most of these already feel like review, not first exposure:
Pack Shape¶
- Type:
contest-style drill - Topic mix:
Data structures + graphs + DP + strings + math - Problems:
5 - Suggested time:
2.5-3.5 hours
Topics Under Test¶
- update/query invariant recall
- directed dependency modeling
- state-transition reset speed
- string-pattern recognition
- modular-identity recall under pressure
Suggested Order¶
| Slot | Problem | Topic | Why it is here |
|---|---|---|---|
| 1 | Dynamic Range Sum Queries | Segment tree |
Starts with a clean update/query data-structure loop. |
| 2 | Course Schedule | Toposort |
Changes the mental model from range maintenance to dependency structure. |
| 3 | Book Shop | Knapsack DP |
Forces a state-transition reset and disciplined iteration order. |
| 4 | Finding Periods | Strings / Z-function |
Injects a pattern-recognition problem instead of raw simulation. |
| 5 | Exponentiation II | Modular arithmetic |
Finishes with a formula-heavy task where the key is using the right identity quickly. |
How To Run It¶
- treat this as one sitting if possible
- only open topic refreshers between problems, not during implementation
- keep a short scratch log of the first wrong instinct for each slot
- if recognition is still missing after about
15 minutes, allow one refresher page and restart once - if one slot still goes nowhere after about
30 minutes, log it and move on instead of letting the whole session collapse
Allowed Refreshers¶
- Data structures cheatsheet
- Graph cheatsheet
- DP cheatsheet
- String cheatsheet
- Number theory cheatsheet
Debrief¶
This pack is doing its job if you can answer these after the round:
- which problem took the longest to recognize, not to code?
- where did you lose time to syntax vs to modeling?
- which topic still needs one more focused ladder pass before more mixed practice?
Go Back Next¶
- back to Ladders if one topic clearly felt weak
- into Graphs And DP Switching 01 if the graph/DP slots were the real bottleneck
- into Strings, Math, And Counting 01 if the symbolic topics were the real bottleneck
- or into Contest Playbooks if the switching itself felt manageable