# Moving Tables

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25394    Accepted Submission(s): 8408

Problem Description
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.

Input
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.

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

Sample Input
3 4 10 20 30 40 50 60 70 80 2 1 3 2 200 3 10 100 20 80 30 50

Sample Output
10 20 30

• 本文已收录于以下专栏：

## 贪心算法——Hdu 1050 Moving Tables

Moving Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
• code_pang
• 2012年12月03日 13:43
• 6715

## ACM-贪心之Moving Tables——hdu1050

Moving Tables Problem Description The famous ACM (Advanced Computer Maker) Company has rented a fl...
• lx417147512
• 2013年10月21日 15:39
• 2169

## 贪心算法-HDU1050-Moving Tables

Moving Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
• stack_queue
• 2016年11月09日 20:25
• 754

## hdu1050 Moving Tables

• my1995
• 2014年07月29日 11:31
• 177

## Hdu1050 - Moving Tables - 贪心算法

#include #include using namespace std; struct Go//存储路线的起点房间和终点房间，以及是否使用过 { int st,ed; int move; }g...
• wsxsd94
• 2014年07月13日 12:55
• 388

## HDU1050——Moving Tables（贪心）

The floor has 200 rooms each on the north side and south side along the corridor. Recently the Compa...
• WAR___NING
• 2015年07月28日 14:40
• 363

## Hdu1050 Moving Tables

Moving TablesProblem Description The famous ACM (Advanced Computer Maker) Company has rented a floo...
• Jelly_acm
• 2016年05月19日 16:08
• 176

## HDU1050：Moving Tables

Moving Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
• u013487051
• 2014年07月31日 17:00
• 646

## Moving Tables hdu1050

• u011806194
• 2016年07月07日 13:23
• 105

## HDU1050 Moving Tables(贪心)

• riba2534
• 2017年07月07日 08:51
• 256

举报原因： 您举报文章：HDU1050 Moving Tables 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)