Freaks City

Problem A: Treasure Chest We need to calculate the minimum time to reach the chest and return to the start, given the ability to pull the chest towards the key for a maximum distance of k. There are two scenarios based on the relative positions of the chest pos_chest and the key pos_key: If pos_key <= pos_chest: We pickup the key on the way ...