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

分析：

一開始以為是貪心，題目沒好好讀就開始用結構體排序。交了兩發wa又想到題目資料一共400就暴力算重還是wa。因為我沒有好好的看圖看題目。題目說的是走廊而我直接理解成直線，其實這題就是簡單的資料壓縮處理但是我一直wa,多麼痛的領悟~~~。

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<string.h>
using namespace std;

int main()
{
    int t,n,i;
    scanf("%d",&t);
    while(t--)
    {
            scanf("%d",&n);
            int p[205],sum=0;memset(p,0,sizeof(p));
            for(i=0;i<n;i++)
            {
                    int a,b;
                    scanf("%d%d",&a,&b);
                    int j;
                    if(a>b)
                    {
                            j=a;a=b;b=j;
                    }
                    for(j=(a+1)/2;j<=(b+1)/2;j++)
                    {
                         p[j]++;
                         if(sum<p[j])
                                sum=p[j];
                    }
            }
            printf("%d\n",sum*10);
    }
    return 0;
}