1.26英语翻译打卡

链接：Moving Tables | JXNUOJ

The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.
 

The floor has 200 rooms each on the north side and south side along the corridor. Recently the Company made a plan to reform its system. The reform includes moving a lot of tables between rooms. Because the corridor is narrow and all the tables are big, only one table can pass through the corridor. Some plan is needed to make the moving efficient. The manager figured out the following plan: Moving a table from a room to another room can be done within 10 minutes. When moving a table from room i to room j, the part of the corridor between the front of room i and the front of room j is used. So, during each 10 minutes, several moving between two rooms not sharing the same part of the corridor will be done simultaneously. To make it clear the manager illustrated the possible cases and impossible cases of simultaneous moving.

For each room, at most one table will be either moved in or moved out. Now, the manager seeks out a method to minimize the time to move all the tables. Your job is to write a program to solve the manager’s problem.

每层楼的南北面各有200个房间，如图所示。最近公司决定改变这个布局，因为过道（走廊）非常狭窄，以及桌子很大，过道只能容许一个桌子通过。所以计划是使桌子移动的效率更高。以下计划：搬一张桌子到另一个房间需要十分钟。当把桌子从房间i搬到房间j时，房间i和j前面的过道被占用了。所以在每个十分钟里，只要是某两个房间前面的空间不同时被占用，几个桌子的移动是可以同时进行的。为了搞清楚，经理列出来可能同时移动的例子和不能同时移动的情况。

输入：

The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.

输入包括T组测试数据。第一行输入T。每行测试数据包括N，需要移动的桌子的数量。接下来的N行，每行包括s,t，代表桌子从s房间移到t房间的房间号。每个房间号只能出现一次。

输出：

The output should contain the minimum time in minutes to complete the moving, one per line.

每行各输出所用的最短时间。