USACO 2023 January — full contest set

Four divisions, three problems each, twelve problems total. A 4-hour window in late January 2023. This page is the index; each division has its own write-up linked below.

4 hcontest length (all divisions)
12problems · Bronze → Platinum
Jan 27–30, 2023contest window
3000 ptsper division max (1000 / problem)

← All past problems

Canonical source. Official results, problem PDFs, test data, and editorials all live at usaco.org/index.php?page=jan23results. Anything paraphrased on these pages should be cross-checked against that page before relying on it for a contest run.

The twelve problems

Each card below summarises one division and links to my full write-up for that division. Problem titles are taken from the official results page; paraphrases are my own.

Bronze

Bronze division

1. Leaders — count pairs of cows that can each lead the other's breed under a window rule.

2. Air Cownditioning II — minimum air conditioners (each covers a range, with a power budget) to cool every stall.

3. Moo Operations — minimum edits to turn a string into a concatenation of MOOs.

Open Bronze write-up →
Silver

Silver division

1. Air Cownditioning II — same setup as Bronze, larger N — choose a subset of ACs minimising total cost while covering every stall's demand.

2. Spelling Bee — count strings that can be reduced to a target via stack-style "double consecutive" rules.

3. Find and Replace — minimum global letter-replace operations to turn S into T, treating "rename all a→b" as one move.

Open Silver write-up →
Gold

Gold division

1. Find and Replace — Silver's puzzle with bigger N and tougher cycle/cascade reasoning on the letter graph.

2. Mana Collection — collect mana on a graph where pools regenerate over time; queries ask the maximum mana achievable ending at a given node.

3. Tractor Paths — shortest reachability and counting paths on intervals that overlap on a number line.

Open Gold write-up →
Platinum

Platinum division

1. Tractor Paths — Gold's interval-graph problem extended with edge-count queries between specific intervals.

2. Mana Collection — full version: arbitrary start, query (start, end-time) pairs over a graph with regenerating pools.

3. Subset Sort — count permutations sortable by a restricted set of swaps / segment operations.

Open Platinum write-up →

How I'm reading this contest