hdu-1050 Moving Tables

                                                         Moving Tables

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

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
  
  
  
  


  
  
  
  

   
   解题思路：题目大意就是说酒店大装修，须有搬房间，但是走廊太窄，一次只能搬一个房间。测试案例有T组,每一组有n次搬迁，每一次搬迁有两个数，s和t，即搬迁的始末房间号。每次搬迁无论远近都要十分钟。问最快要多久才能搬完。
  
  
  
  

   
   这是一道贪心题，但是有规律可寻，只要找出重叠次数最多的走廊，即最长搬运次数等于最大重叠数。
  
  
  
  

   
   代码如下：
  
  
  
  

   
   #include<stdio.h>   
#include<string.h>  
int a[500];  
int ans[300];  
int main()  
{  
   int i,j=0;  
   for(i=1;i<=400;i++)   //房间对应的过道  
   {  
       if(i%2==1)j++;  
       a[i]=j;                 
   }  
   int x,s,t,n,temp;  
   scanf("%d",&x);  
   while(x--)  
   {  
      memset(ans,0,sizeof(ans));    //初始化过道为0    
      scanf("%d",&n);  
        
      while(n--)  
      {  
          scanf("%d %d",&s,&t);  
          if(s>t){temp=s;s=t;t=temp;}  //将移桌子都是从左向右移动的  
          for(i=a[s];i<=a[t];i++)      //看看过道被占用了多少次  
          {  
              ans[i]++;                  
          }                         
      }            
      int max=0;  
      for(i=1;i<=200;i++)            //统计被占用过道的最大值  
      {  
        if(max<ans[i])max=ans[i];                                
      }  
      printf("%d\n",max*10);    //乘以时间得出正确答案  
   }   
}