Ask AI
Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.
Open Claude Desktopbinary-search · trees · sorting
The organizer’s problem statement is available at the official source link.
sample trace
Grass Segments: binary search walkthrough
Grass Segments: use the linked editorial?s binary search, trees idea on the published sample, then verify the displayed output.
Published input2
3 6 3
4 7 2
4
3 6 1
2 5 1
4 10 1
1 4 1
5
8 10 2
4 9 2
3 7 4
5 7 1
2 7 1modelAlgorithm ideaSearch a monotone boundary by repeatedly testing a midpoint with the editorial?s feasibility condition.task resultExpected output0
1
3
3
2
2
0
3
1
3
3
- 1
Range
Set the candidate interval for the quantity the task asks to minimize or maximize. - 2
Test
Evaluate the task?s feasibility condition at the midpoint. - 3
Narrow
Keep the half containing the true boundary until the answer is determined. - 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.