题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1050
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 40291 Accepted Submission(s): 13273
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.
题意:在一个狭窄的走廊里将桌子从一个房间移动到另一个房间,走廊的宽度只能允许一个桌子通过。给出t,
表示有t组测试数据。再给出n,表示要移动n个桌子。n下面有n行,每行两个数字,表示将桌子从a房间
移到b房间。走廊的分布图如一图所示,每移动一个桌子到达目的地房间需要花10分钟,问移动n个桌子
所需要的时间。
解题思路:若移动多个桌子时,所需要经过的走廊没有重合处,即可以同时移动。若有一段走廊有m个桌子都
要经过,一次只能经过一个桌子,则需要m*10的时间移动桌子。设一个数组,下标值即为房间号。
桌子经过房间时,该房间号为下标对应的数组值即加1。最后找到最大的数组值,最大值*10即为移动完桌子
需要的最短时间。
可以做的优化:
可以把一对面对面相邻的房间(例如room3、room4)看成一个房间,所以总共400个房间可以看成200个房间。
数组的下标为1到200,1表示room1-room2,2表示room3-room4
代码:
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int Count[210];
int main()
{
int T,n,i,j,temp;
int from,to;
cin>>T;
while(T--)
{
int max=0;
int ans;
memset(Count,0,sizeof(Count));
cin>>n;
for(i=1;i<=n;i++)
{
cin>>from>>to;
if(from>to)swap(from,to);
if(from%2==1)
{
from=(from+1);
}
if(to%2==1)
{
to=(to+1);
}
from=from/2;
to=to/2;
for(j=from;j<=to;j++)Count[j]++;
}
for(j=1;j<=200;j++)
{
if(Count[j]>max)max=Count[j];
}
cout<<max*10<<endl;
}
return 0;
}
遇到的坑:
一开始写完代码后一直编译失败,后来是因为把一个数组名设置成了count (应该是c++的一个内置函数)导致的。
低级错误,下次要注意