usaco-guide icon indicating copy to clipboard operation
usaco-guide copied to clipboard

New topic - Parallel Binary Search

Open Muaath5 opened this issue 1 year ago • 3 comments

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:

Probably also add problem SZKOpul - Meteors, but I'm not sure about it.

Muaath5 avatar Apr 20 '23 17:04 Muaath5

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?

Talha-Taki002 avatar Jun 08 '23 12:06 Talha-Taki002

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 avatar Jun 20 '23 20:06 bqi343

@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

Talha-Taki002 avatar Jun 28 '23 21:06 Talha-Taki002