#QCJ1. Mountain Walking
Mountain Walking
In this problem your task is to program a robot that will output some data about a terrain after traversing it. Input will be in the form a 2D picture containing only 4 types of characters :-
Additionally there will be only SPACE (Ascii value = 32) charecters. ( Refer the below figure).
The robot starts its journey at bottom left corner of the terrain and after traversing stops at the bottom right corner. Also note that the robot will always start and end at the SAME LEVEL.
Given the picture as input you will have to output 2 things. The "Total Walk Distance" i.e, the total length of the path and the type of steps taken to complete the Journey. For the sake of simplification we will assume that each charecter('/' , '\' & '_') has length = 1.
Now Consider the following example:
_
/ \/\
/ \
/ \
The robot starts at the bottom left corner and takes the following path:
and robot ends it journey at bottom right corner (At the same level). The Total Walk Distance = 9.
Input
First line of input will be an integer N (N<20). The next line will be an empty. Then exactly N lines follow describing the terrain.
You can assume the following for the input (terrain).
Output
First line of output should be the Total Walk Distance followed by the description the the the terrain. Each line must be ONE of the following
Where xx is an integer.
Refer Examples for exact specification.
Example
Input:
3
/\
/ \
/ \
Output:
Total Walk Distance = 6
Up 3 steps
Down 3 steps
Input:
2
_____ ___
/ \/ \
Output:
Total Walk Distance = 12
Up 1 steps
Walk 5 steps
Down 1 steps
Up 1 steps
Walk 3 steps
Down 1 steps
Input:
5
_
/\__/ \
/ \
/ \/\_
/ \
Output:
Total Walk Distance = 16
Up 4 steps
Down 1 steps
Walk 2 steps
Up 1 steps
Walk 1 steps
Down 3 steps
Up 1 steps
Down 1 steps
Walk 1 steps
Down 1 steps