2. The Meeting Place Cannot Be Changed

Getting Started with Competitive Programming

(an NPTEL course)

Module 2. The Meeting Place Cannot Be Changed

This lecture is based on the problem called “The Meeting Place Cannot Be Changed” (Codeforces #403), and you can find a link to it here.

In this problem we are trying to get some friends on a line to meet at a common point as quickly as possible. Once you recast it in terms of intersecting intervals, a binary search over potential times does the trick finally!

The code discussed in the video can be found here.

super-embed:<div id="hyvor-talk-view"></div><script async defer type="text/javascript" src="//talk.hyvor.com/web-api/embed.js"></script>