The problem statement says (emphasis is mine):

If so, the program finds one of the shortest routes without left turns and writes it in the standard output.

For some input sets, there can be multiple shortest routes. Does this problem have a checker to check if the printed route is a shortest valid route? My AC code on szkopul for this problem gets WA here, so I have reason to believe that right now to get AC you must match the reference solution's output.