Normal sudoku rules apply.
In this puzzle, the solver must help a red and a blue car reach their destination. Both cars have their starting point (in row 1), driveways (lines) and destinations marked with their respective color. From both starting points, draw a path that must traverse exactly 9 grey dots (repeated digits are allowed on these dots). Digits on grey dots along a path must oscillate in parity. Both paths move between cells orthogonally, do not branch, do not intersect with themselves or with each other and cannot go directly from one cell containing a grey dot to another. Any path may only enter any 3x3 box once and must pass trough the minimum amount of cells to reach their destination, while still obeying any other rule.
The solver must also figure out which driver is sober and which driver is drunk ;
When exiting his driveway, the drunk driver's path must strictly have more right turns than left turns in the box it enters. This statement reverses each time a box border is crossed (ie. it must strictly have more left turns than right turns in the second box it enters) When exiting his driveway, the sober driver's path must either have no turn or have a higher amount of right turns than left turns in any box it enters.
Digits along an arrow must sum to that arrow's circle. Adjacent digits separated by a V must sum to 5. Adjacent digits separated by an X must sum to 10.
Solution code: The 9 digits in box 9, from left to right and top to bottom.