xtu read problem training 4 A - Moving Tables

標籤：des   style   blog   http   color   java   os   io   

Moving TablesTime Limit: 2000msMemory Limit: 65536KBThis problem will be judged on ZJU. Original ID: 1029
64-bit integer IO format: %lld      Java class name: Main 

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

Output for the Sample Input

10 
20 
30

 SourceAsia 2001, Taejon (South Korea) 解題：比較有意思的題目，求交點的問題。搬桌子！！！！！！！第2k個房間與第2k-1個房間是正對著的，他們共用門前的走廊的部分。所以假設他們共用的走廊為y .  y = (2k+1)/2 或者 y = (2k-1+1)/2 搬桌子，搬桌子的最長時間是由衝突最多的一次搬運決定的，要是搬桌子的時間儘可能的短，那麼需要使最長的那部分時間 儘可能的短！所以求出衝突次數最多的走廊。次數*10就是結果  

 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cmath> 5 #include <algorithm> 6 #include <climits> 7 #include <vector> 8 #include <queue> 9 #include <cstdlib>10 #include <string>11 #include <set>12 #include <stack>13 #define LL long long14 #define INF 0x3f3f3f3f15 using namespace std;16 int a[201];17 int main() {18     int k,s,t,j,mx,n;19     scanf("%d",&k);20     while(k--) {21         mx = 0;22         memset(a,0,sizeof(a));23         scanf("%d",&n);24         while(n--) {25             scanf("%d%d",&s,&t);26             if(s > t) swap(s,t);27             s = (s+1)/2;28             t = (t+1)/2;29             for(j = s; j <= t; j++) {30                 ++a[j]; if(a[j] > mx) mx = a[j];31             }32         }33         printf("%d\n",mx*10);34     }35     return 0;36 }

View Code