HDU Moving Tables
2016-03-04 19:37
337 查看
Moving Tables
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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 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
34
10 20
30 40
50 60
70 80
2
1 3
2 200
3
10 100
20 80
30 50
Sample Output
1020
30
Source
Asia 2001, Taejon (South Korea)#include<cstdio>
#include<algorithm>
#include<cstring>
int main()
{
int t,room[201]={0};
scanf("%d",&t);
while(t--)
{ memset(room,0,sizeof(room));
int i;
int n;
scanf("%d",&n);
int a,b;
for(i=1;i<=n;i++)
{scanf("%d%d",&a,&b);
a=(a+1)/2;
b=(b+1)/2; 偶数加1后除二无影响;
int t;
if(a>b)
{
t=a;
a=b;
b=t;
}
int j;
for(j=a;j<=b;j++)
{room[j]++;
}
}
int max=0;
for(i=1;i<=200;i++)
{
if(room[i]>max)
max=room[i];
}
printf("%d\n",max*10);
}
}
相关文章推荐
- 文本挖掘之聚类算法之CLARA聚类算法
- Mysql 基础
- hdu 4586 概率dp
- Fibonacci Numbers on Tree
- VS中的预编译器参数设置
- Socket编程
- 计算机硬件的五大单元 & CPU的种类 & 计算机的运行流程
- Java多线程
- [转]如何学习新东西-孟岩
- OUR D3.JS 数据可视化专题站(转)
- RIL开发过程
- offsetLeft,Left,clientLeft详解(…
- Cache-Control: no-cache,Cac…
- charSet 和PageEncoding的区…
- Hashtable和HashMap类有三个重要的…
- 用java实现在命令方式清屏(native&…
- Python基础——实现对关键字的抓取
- 获取类成员函数地址和调用的方法
- C++ 虚函数表解析(难点*)
- iOS监听拨打电话回调函数