Ask AI
Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.
Open Claude Desktopgreedy · trees
The organizer’s problem statement is available at the official source link.
sample trace
Cowntact Tracing: greedy walkthrough
Cowntact Tracing: use the linked editorial?s greedy, trees idea on the published sample, then verify the displayed output.
Published input5
11111
1 2
2 3
3 4
4 5
6
5
4
3
2
1
0
10
1111111111
1 2
2 3
2 4
2 5
2 6
6 7
7 8
8 9
9 10
11
0
1
2
3
4
5
6
7
8
9
10
5
11100
1 2
2 3
3 4
4 5
6
0
1
2
3
4
5modelAlgorithm ideaProcess choices in the order justified by the editorial and maintain the invariant that each accepted choice remains safe.task resultExpected output1
1
1
1
2
5
10
3
2
1
1
1
1
1
1
1
1
3
1
1
-1
-1
-1
- 1
Order
Arrange candidates by the criterion used by the task?s greedy strategy. - 2
Choose
Accept the next locally safe option while preserving the feasibility invariant. - 3
Finish
Read the accumulated result and check it against the sample 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.