Ask AI
Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.
Open Claude Desktopgraph-algorithms
The organizer’s problem statement is available at the official source link.
sample trace
Breakdown: graph algorithms walkthrough
Breakdown: use the linked editorial?s graph algorithms idea on the published sample, then verify the displayed output.
Published input3 4
10 4 4
9 5 3
2 1 6
3 1
2 3
2 1
3 2
2 2
1 3
3 3
1 1
1 2modelAlgorithm 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 output11
18
22
22
22
-1
-1
-1
-1
- 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.