# Greedy: Nothing to say. Pay attention to the details.

Source: Internet
Author: User
Moving tablesthe 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 provided des 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 has strated 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 abve.

Output

The output shoshould 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

102030, that is, moving the table for 10 minutes, I will sort y as big as small, just like in X. Note that four, five, six, and seven are counted twice because five and six are detailed in the same place, see the table.

# Include <stdio. h>
# Include <string. h>
Main ()
{
Int I, n, m, G, T, sum, Max, min;
Int X [300];
Int y [300];
Int Z [300];
Scanf ("% d", & N );
While (n --)
{
Scanf ("% d", & M );
Sum = 0;
Memset (z, 0, sizeof (z ));
For (I = 1; I <= m; I ++)
{Scanf ("% d", & X [I], & Y [I]);
If (X [I]> Y [I])
{
T = x [I];
X [I] = Y [I];
Y [I] = T;
}}
For (I = 1; I <m; I ++)
For (G = I + 1; G <= m; G ++)
{
If (Y [I] <Y [g])
{T = x [I];
X [I] = x [g];
X [g] = T;
T = Y [I];
Y [I] = Y [g];
Y [g] = T ;}
}
For (I = 1; I <m; I ++)
For (G = I + 1; G <= m; G ++)
{
If (Y [I] = Y [g] & X [I] <X [g])
{T = x [I];
X [I] = x [g];
X [g] = T ;}
}
For (I = 1; I <m; I ++)
{Max = x [I];
If (Z [I] = 0 ){
For (G = I + 1; G <= m; G ++)
{
If (Y [g] <= max & Z [g] = 0 ){
If (max-y [g] = 1 & Y [g] % 2 = 1)
Z [g] = 0;
Else {z [g] = 1; max = x [g];}
}
}
Sum ++ ;}}
If (Z [m] = 0)
Sum ++;
Printf ("% d \ n", sum * 10 );
}
}

Related Keywords:

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

## A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

• #### Sales Support

1 on 1 presale consultation

• #### After-Sales Support

24/7 Technical Support 6 Free Tickets per Quarter Faster Response

• Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.