杭电1050
来源:互联网 发布:淘宝怎样找在线客服 编辑:程序博客网 时间:2024/05/29 12:02
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26420 Accepted Submission(s): 8744
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.
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
3 4 10 20 30 40 50 60 70 80 2 1 3 2 200 3 10 100 20 80 30 50
Sample Output
102030
Source
Asia 2001, Taejon (South Korea)
Recommend
We have carefully selected several similar problems for you:1051 1052 1789 1045 1053
这个是用的一个新的映射(1和2对应一个,3和4对应一个.......),两个房间中间有个走廊,一共有200个走廊,走廊被使用的最多次数即为使用的时间
<pre name="code" class="html"><pre name="code" class="html"><span style="font-size:32px;"></span><pre name="code" class="csharp">#include<stdio.h>#include<string.h>int main(){int n,a,m,f,i,j,t,s[220];scanf("%d",&n);while(n--){memset(s,0,sizeof(s)); 开始放在了while外面scanf("%d",&m);for(i=1;i<=m;i++){scanf("%d%d",&f,&t);f=(f-1)/2;t=(t-1)/2;if(f>t){a=f;f=t;t=a;}for(j=f;j<=t;j++)s[j]++;} int max=0;for(i=0;i<=200;i++)if(s[i]>max) max=s[i];printf("%d\n",max*10);}return 0;}
0 0
- 杭电1050
- 【杭电1050】Moving Tables
- 杭电 HDU 1050 HangOver
- 杭电1050-Moving Tables
- 杭电1050解题报告
- 杭电
- 杭电
- 杭电
- 杭电1050 贪心+不相交区间
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电ACM1466
- 杭电ACM1003
- 杭电ACM1225
- iOS动画和特效(三)MotionEffects
- LeetCode 160:Intersection of Two Linked Lists
- Window下搭建hbase开发环境
- 数据结构实验之链表九:双向链表
- POJ 1141 Brackets Sequence 添加括号进行匹配
- 杭电1050
- 第八周 C++实践 分支程序设计
- 在linux上手动安装最新版的redis数据库
- 折线分割平面
- Android Glide图片库优缺点及使用
- Golang 学习,第一篇:环境配置
- iOS开发-在pch文件中添加全局宏可以打印控制器地址方便调试
- 求最大公约数
- 论Swift开发入门:滑块(UISlider)