bgopc's blog

By bgopc, history, 8 months ago, In English
  • Vote: I like it
  • +14
  • Vote: I do not like it

»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Gatcha,

"binary search problems that are worth solving"

  • »
    »
    8 months ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    it's solvable using bs, doesn't require it, (that blog by is-this-fft who told us not to limit ourself etc)

»
8 months ago, # |
  Vote: I like it +5 Vote: I do not like it

One of the best binary search problems to start with is CodeChef - QHOUSE. An interactive problem that make you feel binary search.

Also, 670D2 - Magic Powder - 2 is very good for starters.

  • »
    »
    8 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    added

  • »
    »
    8 months ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    For the first problem do we need more than 30 queries?

    Spoiler
    • »
      »
      »
      8 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Which one?

      • »
        »
        »
        »
        8 months ago, # ^ |
        Rev. 2   Vote: I like it 0 Vote: I do not like it

        I was talking about QHOUSE suggested by arpa

        since codechef is not supporting interactive due to migration of new judge

        i was wondering if my approach is correct or not

  • »
    »
    6 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks, interesting problems, helped.

»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Can you tell some source where i can take hint of step3 of BS of EDU section?

»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

1486D — Max Median appears twice in your list.

Also, can you recommend some harder (2100+) binary search problems

  • »
    »
    8 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You know their idea, it makes that way easier

    I'll edit the list

  • »
    »
    8 months ago, # ^ |
    Rev. 2   Vote: I like it +1 Vote: I do not like it

    Here are the problems:

    Range Deleting
    Microtransactions (hard version)
    Mr. Kitayuta vs. Bamboos
    Thoroughly Bureaucratic Organization
    Lemmings
    Degenerate Matrix
    Guess The Maximums

»
8 months ago, # |
Rev. 2   Vote: I like it +5 Vote: I do not like it

I liked the last div3, binary search E. Definitely, a good practice problem for BS.

How I solved (don't open unless u tried)