Moving Tables

 FJNU.1815

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

Source

Asia 2001, Taejon (South Korea)

YOYO's Note: ┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄它是华丽的分隔线

【题意简述】 

ACM公司有400间办公室，它的布局如图所示。
现在有N张办公桌，要从不同的办公室搬到另一个办公室中。 
这些办公桌很大，一台就占用整个走廊。
在走廊没被占用时可以同时搬运多张桌子，
假设不论搬到哪里，都是花10分钟，求最少消耗的时间。

【粗略分析】 

活动调度问题的贪心嘛囧。
争取每次将能同时搬运的桌子一起搬运。

【C++源代码】

#include<iostream>
#include<algorithm>
using namespace std;
typedef struct{
	int start,end;
	bool ok;
}table;

bool compare(table a,table b){
	if(a.start<b.start)return true;
	if(a.start>b.start)return false;
	if(a.end<b.end)return true;
	if(a.end>b.end)return false;
	return true;
}

int main(){
	int t;cin>>t;
	while(t--){
		int n,x,i;cin>>n;table a[205];
		for(i=0;i<n;i++){
			cin>>a[i].start>>a[i].end;
			if(a[i].start%2)a[i].start++;
			if(a[i].end%2)a[i].end++;
			a[i].start/=2;a[i].end/=2;
			if(a[i].start>a[i].end){
				x=a[i].start;
				a[i].start=a[i].end;
				a[i].end=x;
			}
			a[i].ok=false;
		}
		sort(a,a+n,compare);
		int all=0,now=0;x=0;
		while(all<n){
			for(i=0;i<n;i++)
			if(!a[i].ok&&a[i].start>now){
					now=a[i].end;
					a[i].ok=true;
					all++;
				}
			x+=10;now=0;
		}
		cout<<x<<endl;
	}
	return 0;
}

所以有以下代码：

【C++源代码】

#include<iostream>
#include<algorithm>
using namespace std;

int main(){
	int t;cin>>t;
	while(t--){
		int n,i,j,l,r;cin>>n;
	int cr[205]={0};
		for(i=0;i<n;i++){
			cin>>l>>r;
			if(l%2)l++;if(r%2)r++;
			l/=2;r/=2;
			if(l>r){j=l;l=r;r=j;}
			for(j=l;j<=r;j++)cr[j]++;
		}
		for(i=1,j=0;i<=200;i++)
			if(cr[i]>cr[j])j=i;
		cout<<cr[j]*10<<endl;
	}
	return 0;
}