Xenia - Algorithm

Here's your approach:

$1.$ Read $n$ (number of houses) and $m$ (number of tasks).

$2.$ Create a vector to store the $m$ house numbers you need to visit.

$3.$ Initialize your current position to $1$ and total time to $0$.

$4.$ Loop through each task in the vector.

$5.$ For each target house, compute the clockwise distance using the formula from the previous unit.

$6.$ Add this distance to your total time.

$7.$ Update your current position to the target house.

$8.$ Output the total time.