### FreeHit's blog

By FreeHit, history, 7 months ago,

I want to code A. Get together with approach by limiting value of f(t) ? but i cant get through it ? can i use sweep line algorithm.... after limiting value?and how to code it?here is link to question https://codeforces.com/edu/course/2/lesson/6/3/practice/contest/285083/problem/A

• +1

 » 7 months ago, # |   0 You can binary search on the answer, and maintain a segment that everyone can reach. If the segment is non-empty then the value is ok.
•  » » 7 months ago, # ^ |   0 i find function to be unimodal so ternary search is most optimal then binary search.
•  » » » 7 months ago, # ^ |   0 How is the function unimodal?
•  » » » » 7 months ago, # ^ | ← Rev. 3 →   0 by general intution plot will be minima type where at local minima there will be minimum time requird for all peoples to collect at place.still can get more precise
•  » » » » » 7 months ago, # ^ |   0 What is your definition of $f(t)$?
•  » » 7 months ago, # ^ |   0 how to find out that segment where everyone can reach
 » 7 weeks ago, # |   0 Even I amn't able to get this, we know that my valid answer will be between [ xi — vi*t , vi*t + xi ], but how to binary search on this?? Also, the problem states that the absolute error should be less than 1e-6. Can someone tell how to proceed with it??