Ask AI
Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.
Open Claude Desktopgraph-algorithms · trees · combinatorics
The organizer’s problem statement is available at the official source link.
sample trace
Cereal 2: graph algorithms walkthrough
Cereal 2: use the linked editorial?s graph algorithms, trees idea on the published sample, then verify the displayed output.
Published input8 10
2 1
3 4
2 3
6 5
7 8
6 7
7 5
5 8modelAlgorithm 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 output1
1
3
2
8
4
6
5
7
- 1
Model
Make one vertex per task object and add an edge for each permitted relationship. - 2
Process
Traverse or relax the graph according to the task?s path or reachability rule. - 3
Read
Use the reached set or path result to produce the requested output. - 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 charsRun output
Run your code to see output.