Ask AI
Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.
Open Claude Desktopbinary-search · prefix-sums · graph-algorithms · trees · data-structures · simulation
The organizer’s problem statement is available at the official source link.
sample trace
Max Flow: binary search walkthrough
Max Flow: use the linked editorial?s binary search, prefix sums idea on the published sample, then verify the displayed output.
Published input5 10
3 4
1 5
4 2
5 4
5 4
5 4
3 5
4 3
4 3
1 3
3 5
5 4
1 5
3 4modelAlgorithm ideaSearch a monotone boundary by repeatedly testing a midpoint with the editorial?s feasibility condition.task resultExpected output9
- 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.