Problem11250--ABC376 - F - Hands on Ring (Hard)

11250: ABC376 - F - Hands on Ring (Hard)

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

Note: This problem has almost the same setting as Problem B. Only the parts in bold in the main text and constraints differ.

You are holding a ring with both hands. This ring consists of $N\ (N \geq 3)$ parts numbered $1,2,\dots,N$, where parts $i$ and $i+1$ ($1 \leq i \leq N-1$) are adjacent, and parts $1$ and $N$ are also adjacent.

Initially, your left hand is holding part $1$, and your right hand is holding part $2$. In one operation, you can do the following:

  • Move one of your hands to an adjacent part of the part it is currently holding. However, you can do this only if the other hand is not on the destination part.

The following figure shows the initial state and examples of operations that can and cannot be made from there. The number written on each part of the ring represents the part number, and the circles labeled L and R represent your left and right hands, respectively.

You need to follow $Q$ instructions given to you in order. The $i$-th ($1 \leq i \leq Q$) instruction is represented by a character $H_i$ and an integer $T_i$, meaning the following:

  • Perform some number of operations (possibly zero) so that your left hand (if $H_i$ is L) or your right hand (if $H_i$ is R) is holding part $T_i$. Here, you may move the other hand not specified by $H_i$.

Under the settings and constraints of this problem, it can be proved that any instructions are achievable.

Find the minimum total number of operations required to follow all the instructions.

Input

The Input is given from Standard Input in the following format:

$N$ $Q$

$H_1$ $T_1$

$H_2$ $T_2$

$\vdots$

$H_Q$ $T_Q$

Output

Print the minimum total number of operations required to follow all the instructions.

Constraints

  • $3\leq N \leq 3000$
  • $1\leq Q \leq 3000$
  • $H_i$ is L or R.
  • $1 \leq T_i \leq N$
  • $N$, $Q$, and $T_i$ are integers.

Sample 1 Input

6 3
R 4
L 5
R 5

Sample 1 Output

6

By performing the following operations, you can follow all $Q$ instructions in order.

  1. Move your right hand as part $2 \rightarrow 3 \rightarrow 4$ to follow the first instruction.
  2. Move your left hand as part $1 \rightarrow 6 \rightarrow 5$ to follow the second instruction.
  3. Move your left hand as part $5 \rightarrow 6$, then move your right hand as part $4 \rightarrow 5$ to follow the third instruction.

In this case, the total number of operations is $2+2+1+1=6$, which is the minimum.

Sample 2 Input

100 2
L 1
R 2

Sample 2 Output

0
There are cases where you can follow the instructions without performing any operations.

Sample 3 Input

30 8
R 23
R 26
R 29
L 20
R 29
R 19
L 7
L 16

Sample 3 Output

58

Source/Category