把房间号映射在一条坐标上,然后排序,最后找从左到右找一次可行的计划,最后找从左到右找一次可行的计划,最后找从左到右找一次可行的计划,最后找从左到右找一次可行的计划,

............

次数*10就是答案

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
struct node
{int s,e;
};
istream & operator >>(istream &is,node &a)
{is>>a.s>>a.e;return is;
}
bool cmp(node a,node b)
{return a.s!=b.s?a.s<b.s:a.e<b.e;
}
int cg(int x)
{return x&1?(x+1)>>1:x>>1;
}
int main()
{// freopen("in","r",stdin);bool vis[210];int T,i,j,n,ans;node box[210];node p;cin>>T;while(T--){cin>>n;for(i=0;i<n;i++){cin>>box[i];box[i].s=cg(box[i].s);box[i].e=cg(box[i].e);if(box[i].s>box[i].e)swap(box[i].s,box[i].e);}ans=0;memset(vis,0,sizeof(vis));sort(box,box+n,cmp);for(i=0;i<n;i++){if(vis[i])continue;ans+=10;p=box[i];for(j=i+1;j<n;j++){if(vis[j])continue;if(box[j].s>p.e||box[j].e<p.s){vis[j]=1;p=box[j];}}}cout<<ans<<endl;}return 0;
}

mous ACM (Advanced Computer Maker) Company has rented a floor ofa building whose shape is inthe following figure. The floor has 200 rooms each on the north side and south side along thecorridor. Recently the Companymade a plan to reform its system. The reform includes moving a lot oftables between rooms. Because thecorridor is narrow and all the tables are big, only one table can passthrough the corridor. Some plan is neededto make the moving efficient. The manager figured out the followingplan: Moving a table from a room toanother room can be done within 10 minutes. When moving a table fromroomi to room j, the part of thecorridor between the front of room i and the front of room jis used. So, during each 10 minutes, severalmoving between two rooms not sharing the same part of the corridor willbe done simultaneously. To make itclear the manager illustrated the possible cases and impossible casesof simultaneous moving.

For each room, at most one table will be either moved in or moved out.Now, the manager seeks out a methodto minimize the time to move all the tables. Your job is to write aprogram 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 file. Eachtest case begins with a line containing an integerN , 1<=N<=200 , that represents thenumber of tables to move.Each of the followingN lines contains two positive integers sand t, representing that a table is to move fromroom numbers to room number t (each room numberappears at most once in theN lines). From the N+3-rdline, the remaining test cases are listed in the same manner as above.

Output

The output should contain the minimum time in minutes to complete themoving, 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