tumenbay's blog

Help with this problem!
By tumenbay, history, 2 months ago, In English

https://codeforces.net/edu/course/2/lesson/6/3/practice/contest/285083/problem/A How can I solve this with bs?

  • Vote: I like it
  • 0
  • Vote: I do not like it

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

You have to make a binary search on time, and your checker function returns true if it is possible to gather all people at a point; otherwise, it returns false. (This way, the problem is solved using BS.)

my submission

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

    I cant see your submission, how can I find relevant point?

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

      you do not have to find the point where they meet

      you have to find the range of each person where they can travel in the given time and find the intersection of each person's range if there is the intersection between all then this time is valid

      check this

      → Reply