Moving Tables
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7097Accepted Submission(s): 2396
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.
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
看到一个恐怖的代码
以下是正常一点的代码,也很恐怖
【解题思路】这道题最少花多少时间,实际上我们只要考虑哪一段重合度最高,重合度最高的地方,也就是我们至少要移动的次数了。
因为有400间房间,1-2对应一段走廊,3-4对应一段走廊,如此我们可以把走廊分成200段,标记为a[1]-a[200],之后我们根据输
进的房间序号,就可以算出要用到哪几段的走廊,之后给对应的a[n]值加1就好,最后求出a[n]最大值就是移动的次数了。
分享到:
相关推荐
北大POJ1083-Moving Tables 解题报告+AC代码
java 实现moving Tables
可以使用ANSYS对移动热源进行数值仿真,常用在材料加工工程的焊接领域,运用高斯移动热源来模拟焊接过程
Moving Hadoop to The Cloud 英文epub 本资源转载自网络,如有侵权,请联系上传者或csdn删除 本资源转载自网络,如有侵权,请联系上传者或csdn删除
On The Electrodynamics Of Moving Bodies,爱因斯坦著,英文原版 .pdf
moving nest wrf ncl file
moving-window algorithm we developed to fulfill these requirements. This algorithm uses pattern matching of the images of the areas around each minutia. it is fast and uses a stepping stone scan. it ...
Life in moving fluids : the physical biology of flow Steven Vogel ; illustrated by Sally A. Schrohenloher Princeton University Press
exp moving average的matlab代码
scanners.This paper focuses on an algorithm for moving-object detection and tracking,given a sequence of distributed laser scan data of an intersection.The goal is to detect each moving object that ...
The Expert Adviser Moving Average uses for trade signal generation one moving average.
course_notes_moving_frostbite_to_pbr_v32
Tracking a Moving Target in Cluttered Environments with Ranging Radios
分享一个JQuery背景插件,有动态效果,类似于深海气泡的效果。我也是摘自某DIV+CSS的前端模板(具体是出自哪里的模板记不清了),感觉不错,在此分享一下。
Moving to Responsive Web Design English | August 31, 2016 | ISBN-10: 1484219864 | 149 pages | PDF | 9.28 MB This book shows you how to redesign your static website into a modern, fully responsive ...
The Moving Average Indicator shows the mean instrument price value for a certain period of time.
MLS算法论文,We provide an image deformation method based on Moving LeastSquares using various classes of linear functions including affine,similarity and rigid transformations. These deformationsare ...
modeling moving objects over multiple granularities, a classics in GIS area.
指标Volume with Custom Moving Average
通过移动的最小二乘法改变和自定义的控制点操作图片。Image Deformation Using Moving Least Squares 移动最小二乘法 图像变形(matlab实现)