25293번 - I, O Bot 서브태스크다국어

문제

To welcome attendees to a developers' conference on Jupiter's moon of Io, the organizers inflated many giant beach balls. Each ball is in roughly the shape of either a 1ドル$ or a 0ドル,ドル since those look sort of like the letters I and O. The conference just ended, and so now the beach balls need to be cleaned up. Luckily, the beach ball cleanup robot, BALL-E, is on the job!

The conference was held on an infinite horizontal line, with station 0ドル$ in the middle, stations 1,ドル 2, \dots$ to the right, and stations $-1, -2, \dots$ to the left. Station 0 contains the conference's only beach ball storage warehouse. Each other station contains at most one beach ball.

BALL-E has two storage compartments, each of which can hold a single beach ball. One compartment can only hold 1ドル$⁠-shaped balls and the other can only hold 0ドル$⁠-shaped balls. (The 1ドル$⁠-shaped balls are more oblong than the 0ドル$⁠-shaped balls, so neither shape of ball will fit in the other shape's compartment.)

BALL-E initially has both the 0ドル$ and 1ドル$ compartments empty, and it starts off at station 0ドル$. The robot can do the following things:

• Move left one station or right one station. This costs 1 unit of power.
• If there is a ball at the current station, and BALL-E is not already storing a ball of that shape, it can put the ball in the appropriate compartment. This takes 0 units of power.
• If there is a ball at the current station, BALL-E can compress it so that its shape becomes the other shape. That is, a 1ドル$⁠-shaped ball becomes a 0ドル$⁠-shaped ball, or vice versa. It takes $\mathbf{C}$ units of power to do this. Note that BALL-E may not change the shape of a ball that it has already put into one of its compartments.
• If BALL-E is at station 0 and is storing at least one ball, it can deposit all balls from its compartment(s) into the beach ball storage warehouse. This takes 0 units of power and leaves both compartments empty.

Notice that if BALL-E moves to a station and there is a ball there, BALL-E is not required to pick it up immediately, even if the robot has an open compartment for it. Also, if BALL-E moves to the station with the warehouse, it is not required to deposit any balls it has.

Find the minimum number of units of power needed for BALL-E to transfer all of the balls to the warehouse, using only the moves described above.

입력

The first line of the input gives the number of test cases, $\mathbf{T}$. $\mathbf{T}$ test cases follow. The first line of each test case contains two integers, $\mathbf{N}$ and $\mathbf{C}$: the number of balls and the amount of power units needed to change the shape of a ball, respectively. The next $\mathbf{N}$ lines describe the positions (i.e., station numbers) and the shapes of the balls. The $i$-th line contains two integers, $\mathbf{X_i}$ and $\mathbf{S_i}$: the position and the shape of the $i$-th ball, respectively.

출력

For each test case, output one line containing Case #x: y, where $x$ is the test case number (starting from 1) and $y$ is the minimum number of units of power needed to transfer all of the balls to the warehouse, as described above.

제한

• 1ドル \le \mathbf{T} \le 100$.
• 0ドル \le \mathbf{S_i} \le 1,ドル for all $i$.
• $-10^9 \le \mathbf{X_i} \le 10^9,ドル for all $i$.
• 0ドル \le \mathbf{C} \le 10^9$.
• $\mathbf{X_i} ≠ 0,ドル for all $i$.
• All $\mathbf{X_i}$ are distinct.

Test Set 1 (11점)

For at most 15 cases:

• 1ドル \le \mathbf{N} \le 5000$.

For the remaining cases:

• 1ドル \le \mathbf{N} \le 100$.

Test Set 2 (20점)

For at most 15 cases:

• 1ドル \le \mathbf{N} \le 10^5$.

For the remaining cases:

• 1ドル \le \mathbf{N} \le 5000$.

힌트

In Sample Case #1 (illustrated in the statement), there are $\mathbf{N} = 5$ balls and $\mathbf{C} = 0$. One optimal strategy is to make three round trips from (and back to) the warehouse:

• First round trip: Move to station 3ドル,ドル pick up the 0ドル$ ball there and store it in the 0ドル$ compartment, move back to station 0ドル,ドル and deposit the ball in the warehouse. This takes 6ドル$ units of power.
• Second round trip: Move to station 8ドル,ドル pick up the 0ドル$ ball there, and store it in the 0ドル$ compartment. Move to station 6ドル,ドル change the 0ドル$ ball there into a 1ドル$ ball, and pick it up and store it in the 1ドル$ compartment. Move to station 0ドル$ and deposit both balls in the warehouse. This takes 16ドル$ units of power. (Recall that in this case, it takes 0ドル$ units of power to change a ball's shape.)
• Third round trip: Move to station 10ドル$. Change the 1ドル$ ball there into a 0ドル$ ball, and pick it up and store it in the 0ドル$ compartment. Move to station 15ドル$. Pick up the 1ドル$ ball there and store it in the 1ドル$ compartment. Move to station 0ドル$ and deposit both balls in the warehouse. This takes 30ドル$ units of power.

The total number of units of power needed to collect all the balls is 52ドル$.

Sample Case #2 is like Sample Case #1, but now with $\mathbf{C} = 10$. Now BALL-E has to use at least 56ドル$ units of power:

• First round trip: Get the ball from station 3ドル$. This takes 6ドル$ units of power.
• Second round trip: Get the differently-shaped balls from stations 6ドル$ and 10ドル$. (These are a 0ドル$ and a 1ドル,ドル respectively, so there is no need to change the shape of either of them.) This takes 20ドル$ units of power.
• Third round trip: Get the differently-shaped balls from stations 8ドル$ and 15ドル$. This takes 30ドル$ units of power.

Sample Case #3 is also like Sample Case #1, but now with $\mathbf{C} = 1$. Here, BALL-E needs at least 54ドル$ units of power:

• First round trip: Get the ball from station 3ドル$. This takes 6ドル$ units of power.
• Second round trip: Get the ball from station 8ドル$. When passing through station 6ドル$ on the way back, change the shape of the ball there and get it. This takes 17ドル$ units of power.
• Third round trip: Do the same with the balls at stations 15ドル$ and 10ドル$. This takes 31ドル$ units of power.

In Sample Case #4, one optimal strategy is for BALL-E to move to station $-1000000000,ドル get the 1ドル$ ball there, move to station 1000000000ドル,ドル get the 0ドル$ ball there, and then return to station 0ドル$ to deposit both of them.