zoj 1029 Moving Tables

Moving Tables

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

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

Output for the Sample Input

10 
20 
30

题意：

ACM公司租用了以下模型的一层楼层。这层楼两边都各有200个房间，近期公司打算改良这个系统。把桌子从房间内搬来搬去，因为走廊是狭窄的而且桌子是非常大的，只有一顶桌子能够从走廊里面通过。一些计划要求移动是有效的，经理计算出了以下的计划：把一顶桌子从一个房间搬到另一个房间需要10分钟，当把第i个房间移动到前面的J房间使用。有些是可以同时移动的。比如两个桌子移动的时候不经过同一个房间。

求移动的最少的时间。

 

输入：

第一个数字是测试的组数，每组的第一个数字是桌子的数量，接下来是每顶桌子的移动的两个房间。

 

输出：

要求输出最少的使用的时间。

思路：将每个房间之间的走廊作为一个统计单位，当所有的办公室搬运完后，看看这段走廊需要占用多少次，然后统计占用最多的次数，这个值就是要单独安排搬运的次数。（尽可能地使搬运办公室同时进行，以便是安排单独搬运的次数最少（让占用次数最多的不占用，就有更多地搬运可以同时进行））。

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
    int n,N,f1,f2;
    int a[200];     //走廊编号
    cin>>n;
    while (n--)
    {
        cin>>N;
        memset(a, 0, sizeof(a));
        for (int i=0; i<N; i++)
        {
            cin>>f1>>f2;
            f1=(f1-1)/2;   //将房间号转换为走廊号
            f2=(f2-1)/2;
            if(f1>f2)
            {
                swap(f1, f2);
            }
            for (int j=f1; j<=f2; j++)
            {
                a[j]++;
            }
        }
        int Max=-1;
        for (int i=0; i<200; i++)
        {
            if(a[i]>Max)
            {
                Max=a[i];
            }
        }
        cout<<Max*10<<endl;
    }
    return 0;
}