hdoj1050 Moving Tables
来源:互联网 发布:淘宝店现在还挣钱么 编辑:程序博客网 时间:2024/06/11 01:49
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25716 Accepted Submission(s): 8511
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思路:把每段路程中的过道数+10分钟,最后求过道被占时间中的最大时间。代码:#include<cstdio>//algorithm using namespace std;#include<algorithm>using namespace std;int ss(int t){if (t%2==0)t=t/2;elset=t/2+1;return t;}int main(){int t,n,i,kai,jie,y,yy;scanf("%d",&t);for (y=1;y<=t;y++){int x[240]={0};scanf("%d",&n);for (yy=1;yy<=n;yy++){scanf("%d%d",&kai,&jie);if (ss(kai)>ss(jie))for (i=ss(jie);i<=ss(kai);i++){x[i]+=10;}elsefor (i=ss(kai);i<=ss(jie);i++){x[i]+=10;}}sort(x,x+200);printf("%d\n",x[199]);}return 0;}
0 0
- HDOJ1050 Moving Tables 贪心
- HDOJ1050 Moving Tables
- hdoj1050 Moving Tables
- hdoj1050 Moving Tables(贪心算法?)
- hdoj1050 moving tables 贪心 最大重叠区间数
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- 二叉树的链表存储
- Objective-C内存管理第四弹:循环引用
- ZooKeeper 典型应用场景一览
- LDA perplexity计算
- Android基础之Handler
- hdoj1050 Moving Tables
- 带头节点链表和不带头节点链表的初始化
- 光照_向量点积_背面剔除
- RESTORE数据时10G+ASM遇到ORA-4031及ORA-00600 KSSRMP1错误
- 哈夫曼树的定义和基本概念(从百度百科copy)
- Android基础Fragment以及动画
- maven3实战之仓库(maven仓库分类)
- Java NIO 聊天室实例
- 实战c++中的string系列--函数返回局部变量string(引用局部string,局部string的.c_str()函数)