Moving Tables(贪心 区间覆盖)
2016-07-10 16:23
363 查看
D - Moving Tables
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
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
题意:奇数一排,偶数一排,计算最多相交区间数量
代码
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
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
题意:奇数一排,偶数一排,计算最多相交区间数量
代码
#include<stdio.h> #include<iostream> #include<algorithm> #include<string.h> #include<math.h> #include<queue> using namespace std; const int maxn=100000; int main() { int T; scanf("%d",&T); while(T--) { int N; scanf("%d",&N); int num[maxn]= {0}; int left_left=maxn; int right_right=0; for(int i=0; i<N; i++) { int num_1,num_2; scanf("%d%d",&num_1,&num_2); int left=min(num_1,num_2); int right=max(num_1,num_2); left%2==0?left=left/2:left=left/2+1; right%2==0?right=right/2:right=right/2+1; for(int j=left; j<=right; j++) num[j]++; left_left=min(left_left,left); right_right=max(right_right,right); } int min_time=0; for(int i=left_left; i<=right_right; i++) min_time=max(min_time,num[i]); printf("%d\n",min_time*10); } return 0; }
相关文章推荐
- msgX消息发送增强工具[下载]
- 特殊权限-SUID,SGID,Sticky 学习笔记
- 交叉编译移植 FFMPEG X264 XVID 到 hi3531
- HDOJ 3938 Portal (离线并查集)
- 【Python学习笔记】python高级特性:生成器
- 邮件传输协议 —— 从 SMTP 到 MIME
- 我的实训
- cpp环境【Uva10129】【VIJOS2863】玩弄单词
- PhpStorm (强大的PHP开发环境)2016.1.2 附注册方法
- logback的配置和使用
- B. Mike and Shortcuts(cf#361)
- PHP正则表达式详解(三)
- Mysql插入数据里有中文字符出现Incorrect string value的错误
- scan design rules
- 计算机网络--每一层的具体协议
- fio使用指南
- markdown语法简析
- Java对象序列化
- 18.3节练习
- 大数据环境下,征信,真的那么美好吗?