🔍 Binary Search + Greedy
USACO C++ Book · Interactive Visualizer
🔍 Binary Search on Answer + Greedy Check — Convention Problem
Binary Search on Answer
Greedy Check
Step 0/9
📊 Binary Search Range (N=6 cows, M=2 buses, capacity C=3)
🗂 Current State
Binary Search Range
canDo(mid) Result
Iteration Log
Outer binary search:
O(log W)
Inner greedy:
O(N)
Total:
O(N log W)
💻 Code
◀ Prev
Next Step ▶
↺ Reset
0/9
Keyboard:
→
Next
←
Prev
R
Reset