Xtu read problem training 4 A-moving tables

Moving tablestime limit: 2000 msmemory limit: 65536 kbthis problem will be judged on zju. Original ID: 1029
64-bit integer Io format: % LLD Java class name: Main

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

Output for the sample input

10
20
30

Sourceasia 2001, Taejon (South Korea) Problem Solving: Interesting questions, intersection problem. Move the table !!!!!!! Room 2k-1 and room 2k-1are opposite. They share the corridor in front of the door. So suppose the corridor they share is Y. y = (2 k + 1)/2 or Y = (2k-1 + 1)/2 move the table. The longest time to move the table is determined by the most conflicting one, if you want to move the table as short as possible, you need to make the longest part of the time as short as possible! Find the corridor with the most conflicts. The number of times * 10 is the result

 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cmath> 5 #include <algorithm> 6 #include <climits> 7 #include <vector> 8 #include <queue> 9 #include <cstdlib>10 #include <string>11 #include <set>12 #include <stack>13 #define LL long long14 #define INF 0x3f3f3f3f15 using namespace std;16 int a[201];17 int main() {18     int k,s,t,j,mx,n;19     scanf("%d",&k);20     while(k--) {21         mx = 0;22         memset(a,0,sizeof(a));23         scanf("%d",&n);24         while(n--) {25             scanf("%d%d",&s,&t);26             if(s > t) swap(s,t);27             s = (s+1)/2;28             t = (t+1)/2;29             for(j = s; j <= t; j++) {30                 ++a[j]; if(a[j] > mx) mx = a[j];31             }32         }33         printf("%d\n",mx*10);34     }35     return 0;36 }

View code