HDU Moving Tables
来源:互联网 发布:福利软件 编辑:程序博客网 时间:2024/05/20 05:46
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5640 Accepted Submission(s): 1577Problem 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 <cstdio>#include <cstring>#include <iostream>#include <algorithm>#define MAXN 100005using namespace std;/*struct Room{ int s; int t; bool operator < (const Room &other) const{ return this->s < other.s; }};*///Room room[MAXN];int counter[MAXN];int main(){ int T, n; int s, t; int ans; cin >> T; while(T--){ /* init */ ans = 0; memset(counter, 0, sizeof(counter)); cin >> n; /* div 200, because opposite rooms can't be moved at the same time */ for (int i = 0; i < n; i++) { cin >> s >> t; s = (s+1) / 2; t = (t+1) / 2; if (s > t) swap(s, t); //room[i].s = s; //room[i].t = t; /* ans is the max of the overlapping interval */ for (int i = s; i <= t; i++) { counter[i]++; ans = max(ans, counter[i]); } } //sort(room, room+n); cout << ans*10 << endl; } return 0;}
0 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 Moving Tables
- hdu 1050 Moving Tables
- HDU 1050 Moving Tables
- hdu-1050 Moving Tables
- hdu 1050 Moving Tables
- vue 动画过渡
- 算法提高 输入输出格式练习
- 在Eclipse中显示.project和.classpath和.setting目录
- SPOJ_LEXSTR:Lexicographically_Smallest(并查集)
- 模拟Spring的AOP
- HDU Moving Tables
- 趣味百题之逻辑推理
- java中的instanceof
- BufferedInputFile
- 线程的创建和终止
- 【设计模式】—-(5)原型模式(创建型)
- 标准IO输出_api和格式控制
- Linux下无法使用add-apt-repository命令
- 【JZOJ 3823】 遇见