# Moving Tables

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

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

#include<stdio.h>
int a[210];
int main()
{
int t,T,n,m,i,j;
int x,y;
scanf("%d",&T);
while(T--)
{
memset(a,0,sizeof(a));
scanf("%d",&n);
int mm=0;
while(n--)
{
scanf("%d%d",&x,&y);
x=(x-1)/2;
y=(y-1)/2;
if(x>y)
{
t=x;x=y;y=t;
}
for(i=x;i<=y;i++)
a[i]++;
}
for(i=0;i<200;i++)
if(a[i]>mm)
mm=a[i];
printf("%d\n",mm*10);
}
return 0;
}

//这是第一次写的，一直WA!WA!WA!,不知为何
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 1010
using namespace std;
struct zz
{
int l;
int r;
}q[N];
int b[N];
int cmp(zz a,zz b)
{
if(a.l==b.l)
return a.r<b.r;
return a.l<b.l;
}
int main()
{
int n,t,i,j,mm,s;
int x,y;
scanf("%d",&t);
while(t--)
{
memset(q,0,sizeof(q));
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&x,&y);
if(x>y)
{
s=x;x=y;y=s;
}
if(x&1)
q[i].l=(x+1)/2;
else
q[i].l=x/2;
if(y&1)
q[i].r=(y+1)/2;
else
q[i].r=y/2;
}
sort(q,q+n,cmp);
mm=10;
for(i=1;i<n;i++)
{
if(q[i].l<=q[i-1].r)
mm+=10;
}
printf("%d\n",mm);
}
return 0;
}

#### 贪心算法-HDU1050-Moving Tables

2016-11-09 20:25:27

#### ACM--移动桌子--贪心--HDOJ 1050--Moving Tables

2016-05-27 21:24:43

#### HDOJ 1050 Moving Tables(经典贪心)

2015-08-19 00:10:12

#### 贪心算法——Hdu 1050 Moving Tables

2012-12-03 13:43:15

#### HDU-1050-Moving Tables(C++ && 贪心初步)

2015-06-19 20:11:48

#### ACM-贪心之Moving Tables——hdu1050

2013-10-21 15:39:41

#### [Wikioi 2618]核电站问题---DP解法与记忆化DFS解法

2014-05-26 17:07:52

#### ROS安装步骤个人经验总结

2018年04月21日 14KB 下载

#### 一万小时Android躲过的“坑

2016年09月28日 15:43

#### 一万小时Android躲过的“坑（直播间已更换，直播地址请看课时安排里）

2016年09月01日 16:55

## 不良信息举报

hdoj Moving Tables 1050 （DP） 坑！坑！坑！