注册 登录  
 加关注
   显示下一条  |  关闭
温馨提示!由于新浪微博认证机制调整,您的新浪微博帐号绑定已过期,请重新绑定!立即重新绑定新浪微博》  |  关闭

告别迷茫

梦想与现实的差距,就是我们生活的意义。因为我们有差距,我们才会一直积累,在努力。

 
 
 

日志

 
 

HDU 1050 Moving Tables  

2014-03-08 15:28:04|  分类: 贪心算法 |  标签: |举报 |字号 订阅

  下载LOFTER 我的照片书  |

Moving Tables

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


Problem Description
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.

HDU 1050 Moving Tables - 983433479 - 983433479的博客


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.

HDU 1050 Moving Tables - 983433479 - 983433479的博客


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
20
30
10
40

70 80
50 60
2
1
3
0 100
2 200
3

1
20 80
30 50
 

Sample Output
10
20
30
 
#include<iostream>
#include<cstring>
using namespace std;


int main()
{
int N,M,s,d,tem,min;
int p[200];
cin>>N;
while(N--)
{
        memset(p,0,sizeof(p));
cin>>M;
for(int i=0;i<M;i++)
{
             cin>>s>>d;
s=(s-1)/2;
d=(d-1)/2;
if(s>d)//防止坑
{
tem=s;
s=d;
d=tem;
}
for(int j=s;j<=d;j++)//求桌面的重合度的问题啊;
{
p[j]++;
}
}
min=-1;
for(int k=0;k<200;k++)
{
if(min<p[k])
min=p[k];
}
cout<<min*10<<endl;
}
 return 0;
}
         
  评论这张
 
阅读(1)| 评论(0)
推荐 转载

历史上的今天

在LOFTER的更多文章

评论

<#--最新日志,群博日志--> <#--推荐日志--> <#--引用记录--> <#--博主推荐--> <#--随机阅读--> <#--首页推荐--> <#--历史上的今天--> <#--被推荐日志--> <#--上一篇,下一篇--> <#-- 热度 --> <#-- 网易新闻广告 --> <#--右边模块结构--> <#--评论模块结构--> <#--引用模块结构--> <#--博主发起的投票-->
 
 
 
 
 
 
 
 
 
 
 
 
 
 

页脚

网易公司版权所有 ©1997-2017