← CSES Better

Table Recovery

USACO · 2025 · January · silver-3

Open official problem ↗
Ask AI

Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.

Open Claude Desktop

graph-algorithms · combinatorics

The organizer’s problem statement is available at the official source link.

sample trace

Table Recovery: graph algorithms walkthrough

Table Recovery: use the linked editorial?s graph algorithms, combinatorics idea on the published sample, then verify the displayed output.

Published input1 2 3 3 4 2 5 2 3 6 3 5 6 8 10 5 6 7 4 12 11 10 4 8 2 5 4 6 7 9 8 10 2 4 8 5 12 6 8 7 9 3 5 4 12 8 5 6 10modelAlgorithm ideaRepresent the task?s objects and connections as a graph, then use the editorial?s traversal or path method to obtain the requested property.task resultExpected output2 4 2 3 5 3 4 6 4 5 7 5 8 9 10 6 4 2 5 6 7 3 8 6 9 10 11 7 5 3 6 7 8 4 9 7 10 11 12 8 6 4 7 8 9 5
  1. 1

    Model

    Make one vertex per task object and add an edge for each permitted relationship.
  2. 2

    Process

    Traverse or relax the graph according to the task?s path or reachability rule.
  3. 3

    Read

    Use the reached set or path result to produce the requested output.
  4. 4

    Verify the sample

    Use the published sample output to check the result of this idea on the displayed input.
Tools
1
2
3
4
5
6
7
8
9
10
11
12
Draft saved locally
|12 lines, 156 chars

Run output

Run your code to see output.