Moving Tables
来源:互联网 发布:淘宝2016好评返现新规 编辑:程序博客网 时间:2024/05/17 02:25
Moving Tables
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 3 Accepted Submission(s) : 3
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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 <iostream>using namespace std;int main(){ int M,N,from,to,maxCount; cin>>M; int count[201]; while(M--) { int i; cin>>N; memset(count,0,sizeof(count)); for(i=1;i<=N;i++) { cin>>from>>to; from = (from-1)/2; to = (to-1)/2; if(from>to) {int tmp=from;from=to;to=tmp;} for(int j=from;j<=to;j++) count[j]++; } maxCount = -1; for(i=0;i<200;i++) if(count[i] > maxCount) maxCount=count[i]; cout<<maxCount*10<<endl; } return 0;}
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- Moving Tables
- moving tables
- Moving Tables
- Moving Tables
- Moving Tables
- Core Text Tutorial for iOS: Making a Magazine App(中文)
- OCP-1Z0-053-V12.02-79题
- js的简单模板解析
- jiqiao
- 1007Database PPT:introduction
- Moving Tables
- STL空间配置器-第二级配置器
- Looking or a promotion: Tips to make it happen
- DOS下的串口编程
- dwz tree组件 取得所选择的值
- 多寄存器寻址与堆栈寻址
- 黑马程序员--JAVA内部类、异常、包
- C++ 智能指针详解
- 网络编程socket之bind函数