Moving Tables

最新推荐文章于 2021-05-09 20:02:24 发布

原创最新推荐文章于 2021-05-09 20:02:24 发布 · 235 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#ACM训练

ACM集训专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一种解决大型办公环境中高效移动桌子问题的算法。该算法通过分析走廊使用情况，确保多个桌子移动过程中的最小冲突，从而实现整体移动效率的最大化。

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.

	Table moving	Reason
Possible	( room 30 to room 50) and (room 60 to room 90)	no part of corridor is shared
Possible	(room 11 to room 12) and (room 14 to room 13)	no part of corridor is shared
Impossible	(room 20 to room 40) and (room 31 to room 80)	corridor in front of room 31 to room 40 is shared
	(room 1 to room 4) and (room 3 to room 6)	corridor in front of room 3 is shared
	(room 2 to room 8) and (room 7 to room 10)	corridor in front of room 7 is shared

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.

输入

The input consists of T test cases. The number of test cases ( T) is given in the first line of the input file. 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.

输出

The output should contain the minimum time in minutes to complete the moving, one per line.

样例输入

10 20

30 40

50 60

70 80

1 3

2 200

10 100

20 80

30 50

样例输出

#include <stdio.h>
 
int main(){
    int T, N, i, j, sum, from, to;
     
    scanf("%d", &T);
    while(T--){
        scanf("%d", &N);
        int max = 0;
        int a[400] = {0};
        for(j = 0; j < N; j++){
            scanf("%d%d", &from, &to);
        if(from > to){
            int k = from;
            from = to;
            to = k;
        }
        if(from % 2 == 0)
               from -= 1;
            if(to % 2 == 1)
               to +=1;
        for(i = from; i <= to;i++){
            a[i] += 10;
        }
        }
        for(j = 0; j < 400; j++){
            if(max < a[j])max = a[j];
        }
        printf("%d\n", max);
    }
    return 0;
}