Moving Tables
来源:互联网 发布:什么是云计算和云服务 编辑:程序博客网 时间:2024/06/05 19:07
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5978 Accepted Submission(s): 1659Problem 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分钟 我们可以那问题转化一下 求重叠的区间的个数
即 求一个区间出现的最大次数 乘以10就可以了 这样问题就简单了
#include <iostream>#include<string.h>#include<algorithm>using namespace std;int main(){ int t,n; int i,a,b; int num[210]; cin>>t; while(t--) { cin>>n; memset(num,0,sizeof(num)); for(i=0;i<n;i++) { cin>>a>>b; if(a>b) {int c=a;a=b;b=c;} a=(a+1)/2; //下线 b=(b+1)/2; //上线 for(int j=a;j<=b;j++) num[j]++; //记录该数据 出现的次数 } int max=-1; for(i=0;i<210;i++) //寻找最大次数 if(num[i]>max) max=num[i]; cout<<max*10<<endl; } return 0;}
阅读全文
0 0
- 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
- moving tables
- Moving Tables
- Moving Tables
- Moving Tables
- 167. Two Sum II
- 构建链表、输出链表元素、删除链表…
- 用队列和栈的功能实现回文的判定
- WPF学习感受
- 未声明的标识符SurfFeatureDetecto…
- Moving Tables
- java8(1)lambda表达式
- Matlab中Simulink的Bus/Mux/Dumx模块详解
- vue 引入echarts画中国地图 Map china not exists
- javascript获取地址栏参数的方法
- js中表单提交进行校验
- nodejs异常之-Error: listen EACCES 127.0.0.1:8000
- C#剪刀 石头 布
- Django Models