- Time limit: 1.00 s
- Memory limit: 512 MB
The robot will stop when it has performed all commands, or immediately when it returns to a point that it has already visited. Your task is to calculate the total distance the robot moves.
The first input line has an integer $n$: the number of commands.
After that, there are $n$ lines describing the commands. Each line has a character $d$ and an integer $x$: the robot moves the distance $x$ to the direction $d$. Each direction is U (up), D (down), L (left), or R (right).
Print the total distance the robot moves.
- $1 \le n \le 10^5$
- $1 \le x \le 10^6$