HDU 1050 Moving Tables 求最大重复次数
来源:互联网 发布:计算机病毒预防软件 编辑:程序博客网 时间:2024/06/02 00:41
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
#include<iostream>#include<stdio.h>#include<cstring>#include<vector>#include<math.h>#include<sstream>#include<set>#include<map>#include<algorithm>using namespace std;int arr[201];int main(){ int T; cin>>T; while(T--) { memset(arr,0,sizeof(arr)); int N; cin>>N; int Max=0; for(int i=0;i<N;++i) { int s,t; cin>>s>>t; if(s>t) swap(s,t); s=(s+1)/2; t=(t+1)/2; for(int j=s;j<=t;++j) { arr[j]++; Max=max(Max,arr[j]); } } cout<<Max*10<<endl; } return 0;}
- HDU 1050 Moving Tables 求最大重复次数
- HDU 1050 Moving Tables
- hdu 1050 moving tables
- HDU-1050 Moving Tables
- hdu-1050-Moving Tables
- HDU 1050 Moving Tables
- HDU 1050 Moving Tables
- hdu 1050 moving tables
- hdu 1050 Moving Tables
- hdu 1050 Moving Tables
- hdu 1050 Moving Tables
- HDU (1050) Moving Tables
- HDU--1050 -- Moving Tables
- hdu 1050 Moving Tables
- hdu 1050 Moving Tables
- HDU 1050 Moving Tables
- hdu-1050 Moving Tables
- hdu 1050 Moving Tables
- Python中常用的正则表达式处理函数
- Java版抓取网站妹子图片
- dedecms tag 标签调用方法(详细介绍)
- TreeMap和TreeSet在排序时如何比较元素?Collections工具类中的sort()方法如何比较元素?
- BZOJ1854 [Scoi2010]游戏
- HDU 1050 Moving Tables 求最大重复次数
- JavaScript中Element与Node的区别,children与childNodes的区别
- hdu 1052 田忌赛马(贪心)
- 初始JSP表达式语言-EL
- 1002. 写出这个数 (20)
- AngularJS 深入理解 $scope
- 第六天:串口通信概念、原理
- 对封装、抽象、继承、多态的理解?(java四大特性)
- UML的基本元素