hdu1050 Moving Tables(贪心)
来源:互联网 发布:内推和不内推区别知乎 编辑:程序博客网 时间:2024/04/19 09:27
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16771 Accepted Submission(s): 5742
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
#include<stdio.h>#include<string.h>int r[204];int main(){ int t,n,i,j,s,e,m; while(scanf("%d",&t)!=EOF) { while(t--) { memset(r,0,sizeof(r)); scanf("%d",&n); for(i=0; i<n; i++) { scanf("%d%d",&s,&e); if(s>e) {//如果从门牌号大的房间往门牌号小的移,则调换 int temp=s; s=e; e=temp; } for(j=(s+1)/2; j<=(e+1)/2; j++){//要考虑是走廊被占用,所以走廊两侧的对门门牌号除以二得到相同的“走廊号”r[j]++;} } m=0; for(i=1; i<=200; i++) if(r[i]>m) m=r[i];//找到最多次走过的走廊的走过次数 printf("%d\n",m*10); } } return 0;}
0 0
- hdu1050 Moving Tables(贪心)
- HDU1050 - Moving Tables (贪心)
- 贪心 hdu1050 Moving Tables
- HDU1050 Moving Tables(贪心)
- HDU1050——Moving Tables(贪心)
- HDU1050 Moving Tables搬桌子(贪心)
- Moving Tables hdu1050 贪心算法
- Hdu1050 - Moving Tables - 贪心算法
- hdu1050&&nyoj220 Moving Tables(贪心)
- 贪心算法-HDU1050-Moving Tables
- poj 1083 hdu1050 Moving Tables 贪心问题
- HDU1050 Moving Tables
- HDU1050-Moving Tables
- HDU1050 Moving Tables
- hdu1050 Moving Tables
- HDU1050 Moving Tables
- HDU1050 Moving Tables
- hdu1050 Moving Tables
- 通过交换a,b 中的元素,使[序列a 元素的和]与[序列b 元素的和]之间的差最小
- PopupWindow 实现仿微信底部弹出的分享菜单
- hdu1022栈入门
- HTML 判断 IE 版本的语句
- 互换referSDK--推荐自己的APP的服务
- hdu1050 Moving Tables(贪心)
- 关于手游的文件编码格式
- 问题:emacs在shell模式下出现乱码
- 程序员的心理疾病
- CodeForces 395B iwiwi
- socket
- 兔子月薪5千
- Navicat for Oracle
- web.xml作用