HDOJ 1050 Moving Tables
2016-02-11 16:23
483 查看
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26508 Accepted Submission(s): 8775
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
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
Source
Asia 2001, Taejon (South Korea)
题意:在一个狭窄的走廊里将桌子从一个房间移动到另一个房间,走廊的宽度只能允许一个桌子通过。首先输入t,表示有t组测试数据。再给出n,表示要移动n个桌子。n下面有n行,每行两个数字,表示将桌子从a房间移到b房间。走廊的分布图如一图所示,每移动一个桌子到达目的地房间需要花10分钟,问移动n个桌子所需要的时间。
此题是一个经典的贪心题目,思考,若移动多个桌子时,所需要经过的走廊没有重合处,那我就可以同时移动,相反,如果有重合处,怎么样都要移动两次。所以,此题我们其实只需要找出最大重合边,重合的次数就是我们需要搬动的次数。在寻找重合边的时候有个技巧,我们可以定义一个数组,一旦走过这里我们这里的数组元素+1,这样数组元素出现的最大值就是我们的最大重合边。
#include <stdio.h> #include <string.h> int main() { int a[200],i,j,T,t,N,m,n,s1,s2,max; scanf("%d",&T); while(T--) { memset(a,0,sizeof(a)); scanf("%d",&N); while(N--) { scanf("%d%d",&m,&n); s1=(m-1)/2; s2=(n-1)/2; if(s1>s2) { t=s1;s1=s2;s2=t; } for(i=s1;i<=s2;i++) a[i]++; } max=-1; for(i=0;i<200;i++) if(a[i]>max) max=a[i]; printf("%d\n",max*10); } return 0; }
相关文章推荐
- HDU2456(01背包变形)
- 网页调试技巧:抓取马上跳转的页面POST信息或者页面内容
- Nginx 开启 path_info功能
- iOS-XML文档解析(NSXMLParser)
- windowbuilde02 表格创建
- 继KB3035583后微软再发恶意补丁KB3123862、千万不要打!!!
- node stream api的应用,断电续传与秒传的例子
- java volatile详解(转)
- 微软推送Win10 Mobile技术预览版10586.107 Win10 Mobile预览版10586.107更新内容汇总
- GetMemory函数的几种经典考法
- JQ001-认识jQuery 和 JQ002-jQuery选择器
- HDOJ 1009 FatMouse' Trade
- Python+selenium的GUI自动化实现
- Volley学习记录(一)
- JavaBean 和内省
- 在.net桌面程序中自定义鼠标光标
- 春节假期
- static的理解
- QT学习一:菜单
- IOS-网络(文件压缩和解压缩)