usaco-guide
usaco-guide copied to clipboard
New topic - Parallel Binary Search
This should be probably in Gold or Platinium.
Usually you can use this techinique when you can do a single query in $O(n \cdot log_2(MaxAns))$, you can sweep through the array and prosess all the queries in a parallel way, So usually the total complexity is: $O((n + q) \cdot log_2(MaxAns))$
Problems:
- CSES - New Road Queries (Parallel Binary search, DSU) [Easy]
- AtCoder - Stamp Rally (Parallel Binary search, DSU) [Easy]
- DMOJ - COCI'20 - Index (Parallel Binary search, Segtree) [Medium]
Probably also add problem SZKOpul - Meteors, but I'm not sure about it.
For joining CPI team as a content writer, I am willing to write this content for my one of two pull requests requirement. Can you assign me?
This should be probably in Gold or Platinium.
Or maybe Advanced, given that I can't think of any USACO Gold or Platinum example problems for this.
@bqi343 I have added the first draft of parallel binary search module. If you can check it out and let me know where I fell short and maybe you can fix some issues