HDOJ--1050Moving Tables！！

Moving Tables

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
   
   

 

        大概题意：有一层楼有400个房间，现在需要从不同的房间搬运桌子到另一个房间，由于过道狭窄，过道只能同时搬运一张桌子，每张桌子搬运的时间是10min，问移动n张桌子所需要的最短时间！

    解题思路：不交叉搬运的桌子可以同时搬运，例如：10-20，30-40，可以同时在某一个单位时间内搬运。而20-40，50-30需要交叉搬运，要更多的时间，设一个数组，数组下标代表房间号，每次桌子经过的房间+10！

代码：

#include
    
    
     
     
#include
     
     
      
      

#define roomnum 401

int main()
{
	int T;
	int i,j,n;
	int start,end,temp,max;
	int room[roomnum];
	scanf("%d",&T);
	while(T--)
	{
		memset(room,0,sizeof(int)*roomnum);
		max=0;
		scanf("%d",&n);
		for(i=0;i
      
      
       
       end)
			{
				temp=start;
				start=end;
				end=temp;
			} 
			if(start%2==0)
			{
				start-=1;
			}
			if(end%2==1)
			{
				end+=1;
			}
			for(j=start;j<=end;j++)
			{
				room[j]+=10;
			}
		}
		for(i=1;i<=roomnum;i++)
		{
			if(room[i]>max)
			max=room[i];
		}
		printf("%d\n",max);
	}
}
      
      
     
     
    
    

传送门