Problem

-------

Blue and Orange are friendly robots. An evil computer mastermind has locked them up in separate hallways to test them, and then possibly give them cake.

Each hallway contains 100 buttons labeled with the positive integers {1, 2, ..., 100}. Button k is always k meters from the start of the hallway, and the robots both begin at button 1. Over the period of one second, a robot can walk one meter in either direction, or it can press the button at its position once, or it can stay at its position and not press the button. To complete the test, the robots need to push a certain sequence of buttons in a certain order. Both robots know the full sequence in advance. How fast can they complete it?

For example, let's consider the following button sequence:

O 2, B 1, B 2, O 4

Here, O 2 means button 2 in Orange's hallway, B 1 means button 1 in Blue's hallway, and so on. The robots can push this sequence of buttons in 6 seconds using the strategy shown below:

Time | Orange | Blue

-----+------------------+-----------------

1 | Move to button 2 | Stay at button 1

2 | Push button 2 | Stay at button 1

3 | Move to button 3 | Push button 1

4 | Move to button 4 | Move to button 2

5 | Stay at button 4 | Push button 2

6 | Push button 4 | Stay at button 2

Note that Blue has to wait until Orange has completely finished pushing O 2 before it can start pushing B 1.

Input

-----

The first line of the input gives the number of test cases, T. T test cases follow.

Each test case consists of a single line beginning with a positive integer N, representing the number of buttons that need to be pressed. This is followed by N terms of the form "Ri Pi" where Ri is a robot color (always 'O' or 'B'), and Pi is a button position.

Output

------

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is the minimum number of seconds required for the robots to push the given buttons, in order.

Limits

------

1 ≤ Pi ≤ 100 for all i.

Small dataset

-------------

1 ≤ T ≤ 20.

1 ≤ N ≤ 10.

Large dataset

-------------

1 ≤ T ≤ 100.

1 ≤ N ≤ 100.

Sample Input

------------

3

4 O 2 B 1 B 2 O 4

3 O 5 O 8 B 100

2 B 2 B 1

Output

------

Case #1: 6

Case #2: 100

Case #3: 4

The solution to the problem can be easily coded, after understanding the fact that the robot (which was not scheduled to press the switch) can freely move to it's destination (next switch), so as to make the time required to solve the problem, as minimal as possible. Both the robots start at 1. So, for example, if one robot has to press the switch at 10 (first move), it takes 9 seconds (10 - 1) to move and 1 to press the switch...So, it takes a total of 10 seconds...In these 10 seconds, the other robot can move as long as possible and stay-put there, waiting for its turn. I used Java datastructures 'Queue' and 'Deque' to solve the problem.

Below is my solution, in Java:

Babji Prashanth, really I don't understand the description of the problem "Bob Trust" .. I don't know what it must do or what's the goal ... can you explain a little better the problem ?

ReplyDeleteThank you ... by the way, great post.

Hello Shanghong,

ReplyDeleteThe problem says that 2 robots need to press those switches in order and complete that in minimal time. For example: "0 2 B 8 O 5" input means that Robot 'O' has to press switch 2 first, then the Robot 'B' has to press switch 8..and then the Robot 'O' has to press switch 5, to solve the problem. The order should be maintained, but when it is one robot's turn to press the switch, the other robot can freely move towards its destination (next switch to press), to take as minimal time as possible.