acm之贪心算法题目2

最新推荐文章于 2018-12-06 20:00:09 发布

Jancy1072

最新推荐文章于 2018-12-06 20:00:09 发布

阅读量1.3k

点赞数 1

分类专栏： acm 文章标签： acm 贪心

本文链接：https://blog.csdn.net/shelly1072/article/details/51761571

版权

本文介绍了一家名为ACM的公司在一栋楼层进行房间改革的计划，涉及大量表格的移动。由于走廊狭窄，每次只能移动一张桌子。为提高效率，管理层提出了每10分钟内可以同时进行不共用走廊部分的多个移动操作的策略。任务是找出最小的时间来完成所有表格的移动。输入包含测试用例，每个用例给出要移动的表格数量和起点终点房间号，输出是完成所有移动所需的最短时间。样例输入和输出展示了不同情况下的时间需求。

摘要由CSDN通过智能技术生成

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 simultaneou