2024 December Gold · "Cowdependence"
Stretch problem — write-up pending. Gold is above the division I'm competing in right
now, so I'm reading this problem for exposure rather than racing the clock on it. The title is
confirmed against the official December 2024 results, but I haven't finished a solve, so I'm not
putting a fake walkthrough here. Statement on
usaco.org.
What I want to take away from Gold problems at this stage
- Notice which Gold-level data structures show up: Union-Find, segment / Fenwick trees, Dijkstra on layered states, tree DP, etc.
- Read one editorial fully and re-implement it without looking — even if I couldn't have solved the original cold.
- Build a mental "Gold patterns" file that I'll lean on once I promote.
Plan
- First pass: read the statement, write what algorithm family I'd reach for, and estimate complexity needed for the constraints.
- Second pass: read the official editorial. Compare to my initial guess.
- Third pass: implement the editorial's solution in C++, then come back and write up what I learned in my own words.