HDU 1050 Moving Tables

Moving Tables

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

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

102030

 

Source

Asia 2001, Taejon (South Korea)

这个题目意思是说公司的办公楼里有400个房间 其中中间有一个走廊，走廊两边是房子，分别一边是以奇数另一边是以偶数的为编号的房子，现在想把桌子搬到另外一个房子里去，如果是对着的，不产生冲突，花费时间10分，如是不是对着的，会产生冲突，但是是依次进行的。。。不同一个花费10分钟。最后输出搬完所有房子一共花了多长时间。

网上有一个很好的图说明（贴下来）：

需要注意的是房间与走廊的位置关系，就如图中所给的图片所示

 

相对门的两个房间占用同一处走廊，所以例如有1——3和4——6移动方式时，它们是共享了同一段走廊的，即3号房间门前的走廊。

分析过程有如下图所示

 

#include<iostream>#include<cstring>using namespace std;int main(){int t,n;int a,b,max;int cn[210];while(cin>>t){while(t--){cin>>n;memset(cn,0,sizeof(cn));max=0;for(int i=0;i<n;i++){             cin>>a>>b; if(a>b){int t=a;a=b;b=t;} a=(a-1)/2; b=(b-1)/2; for(int j=a;j<=b;j++)cn[j]++; }for(i=0;i<210;i++)   if(max<cn[i])   max=cn[i];   cout<<max*10<<endl;}}return 0;}