hdu 1050
7500 ワード
Moving TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21879 Accepted Submission(s): 7356
Problem DescriptionThe 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.
InputThe 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.
OutputThe output should contain the minimum time in minutes to complete the moving, one per line.
Sample Input3 4 10 20 30 40 50 60 70 80 2 1 3 2 200 3 10 100 20 80 30 50
Sample Output102030
SourceAsia 2001, Taejon (South Korea)
最初はアルゴリズムが少し問題を考えていました.
穴は廊下の両側に部屋があります
つまりroom 1とroom 2の対応する位置は同じです
1 to 3 4 to 6は同時に完成できません.
やり方は全体をスキャンして、どの位置の繰り返し回数が一番大きいかを見て、*10が答えです.
Problem DescriptionThe 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.
InputThe 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.
OutputThe output should contain the minimum time in minutes to complete the moving, one per line.
Sample Input3 4 10 20 30 40 50 60 70 80 2 1 3 2 200 3 10 100 20 80 30 50
Sample Output102030
SourceAsia 2001, Taejon (South Korea)
最初はアルゴリズムが少し問題を考えていました.
穴は廊下の両側に部屋があります
つまりroom 1とroom 2の対応する位置は同じです
1 to 3 4 to 6は同時に完成できません.
やり方は全体をスキャンして、どの位置の繰り返し回数が一番大きいかを見て、*10が答えです.
1 #include <iostream>
2 #include <algorithm>
3 #include <cmath>
4 #include<cstdio>
5 #include <cstring>
6
7 using namespace std;
8
9 int main()
10 {
11 int t,n,a[300],b[300];
12 int p[300];
13 int ans;
14 scanf("%d",&t);
15 while (t--)
16 {
17
18 scanf("%d",&n);
19 memset(p,0,sizeof(p));
20 memset(a,0,sizeof(a));
21 memset(b,0,sizeof(b));
22 for (int i=1;i<=n;i++)
23 {
24 scanf("%d %d",&a[i],&b[i]);
25 if (a[i]>b[i])
26 swap(a[i],b[i]);
27 for (int j=(a[i]+1)/2;j<=(b[i]+1)/2;j++)
28 p[j]++;
29 }
30 ans=0;
31 for (int i=1;i<=200;i++)
32 if (p[i]>ans)
33 ans=p[i];
34 printf("%d
",ans*10);
35 }
36 return 0;
37 }