hdoj.1050 Moving Tables 20140811
来源:互联网 发布:窃听噐在淘宝叫什么 编辑:程序博客网 时间:2024/05/29 19:47
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19258 Accepted Submission(s): 6579
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>#include<stdlib.h>int cmp(const void *a,const void *b){ return *(int *)b-*(int *)a;}int main(){ int T,n,a,b,i; int room[210]; scanf("%d",&T); while(T--) { scanf("%d",&n); memset(room,0,sizeof(room)); while(n--) { scanf("%d%d",&a,&b); int min=a<b?a:b; int max=a>b?a:b; for(i=(min+1)/2;i<=(max+1)/2;i++) room[i]++; } qsort(room,201,sizeof(room[0]),cmp); printf("%d\n",room[0]*10); } return 0;}
0 0
- hdoj.1050 Moving Tables 20140811
- hdoj 1050 Moving Tables
- hdoj 1050 Moving Tables
- HDOJ 1050 Moving Tables
- HDOJ 1050 Moving Tables
- HDOJ 1050 Moving Tables
- HDOJ 1050 Moving Tables
- HDOJ 1050 Moving Tables
- HDOJ--1050Moving Tables!!
- HDOJ 1050 Moving Tables 【贪心】
- HDOJ 1050 Moving Tables (贪心)
- HDOJ HDU 1050 Moving Tables
- HDOJ Moving Tables JAVA 1050
- HDOJ 1050 Moving Tables解题报告
- HDOJ 1050:Moving Tables 解题报告
- HDOJ 1050 Moving Tables 贪心so easy!!
- HDOJ 1050 Moving Tables(贪心)
- HDOJ 1050 Moving Tables(经典贪心)
- LED明装筒灯厂家直销,明装LED筒灯第一品牌
- waf编译浅学
- poj2485Highways——————【 Prim 】
- 用ajax实现预览链接
- 引用类型的赋值、浅拷贝和深拷贝的区别
- hdoj.1050 Moving Tables 20140811
- hdu1213 - How Many Tables (基础并查集)
- 解决sliverlight,非button控件保存,光标未移开,binding的值不提交问题
- JQ tab 切换-局部刷新(关于index)
- 如何评估一个类是否是高质量的?
- REST介绍
- 关于typedef的用法总结
- hdu2819 Swap
- Android 众多的布局属性详解