一些项目——Moving Tables
2015-06-08 21:08
337 查看
Problem Description
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. ![](http://acm.hdu.edu.cn/data/images/1050-1.gif)
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.
![](http://acm.hdu.edu.cn/data/images/1050-2.gif)
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 containstwo 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
将纵向每两个房间中间的走廊从1到200编号,赋初值为0,当输入的房间号后,将他们之间的走廊编号加一,如果接下来还会经过就再加一,然后找最大的那一个。数值为1的代表只经过了一次,没有与其他情况发生冲突,而两次以上的代表一定有等10分钟的情况,所以要找出最大的那个n,再n*10分钟就是要等的分钟数
相关文章推荐
- GitHub NetFlow
- 借root之名,行流氓之实,劝告,root需谨慎
- 开源图计算框架GraphLab介绍
- shell中的${},##和%%的使用
- char 型变量中能不能存贮一个中文汉字?为什么?
- Linux root直接登录
- 第13周-项目2-用文件保存的学生名单
- YUM 和 RPM 总结
- QT 4.7.6 驱动 罗技C720摄像头
- cnblogs用户体验评价
- iOS开发网络数据之AFNetworking使用2.0和2.5
- Gabor变换
- 第13周-项目1-小玩文件-用键盘输入文件名,统计输出类似下面的数据
- javascript 之闭包-理解不了来找我
- Combination Sum II
- C#中static void Main(string[ ] args)中的作用及解释
- How do I use Tasker to run a sync in FolderSync?
- 两个视图交互,bitmap绘制重叠时重影问题
- SQL Server ISNULL函数和Coalesce函数替换空值的区别
- Android-TextView