Two vehicles collide at the moment the distance between them becomes equal to
the collision distance.
For this problem, the collision distance is defined as 10 meters.
When two vehicles collide, they are vaporized and are removed from the field.
All other vehicles continue.
Your task is to discover all collisions, in the order that they occur, and determine
the surviving vehicles.
Time did not exist before t = 0, so if two vehicles would have collided in the
past, we ignore this event. It never happened.
22 фрилансеров(-а) в среднем готовы выполнить эту работу за ₹388/час
Harit Sandhu BDM Company: GHS INFOTECH PVT LTD. As your requirement i would like to help you with better software. We have experiance in c++ from last 5 years. Let discuss more further
I provide working C++ source that given a csv file with lD locations (x,y) speeds and directions, it will output an ordered list of crashes + time. best regards