Moving Tables HDU 1050

来源:互联网 发布:一物降一物 知乎 编辑:程序博客网 时间:2024/06/14 18:58

Moving Tables

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35550    Accepted Submission(s): 11700


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
102030
 题意+解析:移动桌子,从这400个房间中,但是有个限制,就是移动桌子要在走廊中移动,但是走廊只能移动一张桌子,所以不同的移动路线中使用到了同一块走廊,必定只能一个个走,不能一起走,那么把走廊分成200块,成一个数组,储存这块走廊被重复使用了几次,那么次数最多的,就是使用率最高的,当使用这一块走廊时,只能允许一种路线通过 耗时10 minute,所以只要找到使用次数最多的一块走廊,它的使用次数就是搬运所有桌子所耗费的最大时间。
AC 代码:
#include<iostream>#include<string.h>#include<algorithm>using namespace std;int main(){int n,m,a[205]={0};cin>>n;int x,y;int i,j,k,d,_max;for(i=0;i<n;i++){cin>>m;_max=0;memset(a,0,sizeof(a));for(j=0;j<m;j++){cin>>x>>y;if(x>y)swap(x,y);for(k=(x+1)/2;k<=(y+1)/2;k++)a[k]++;}for(d=1;d<=200;d++)_max=max(_max,a[d]);cout<<_max*10<<endl;}return 0;}


 
原创粉丝点击