即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

HDOJ 1050 Moving Tables (贪心)

编程语言 yuanxu716 25℃ 0评论
本文目录
[隐藏]

原题链接


1.一、题目描述

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

2.


二、题目分析

影响搬运时间的因素就是搬运时间的重叠,总的搬运事件就是 重叠次数 * 每次搬运时间。本题中,每次搬运时间相等。如果搬运时间各不相同,又该怎么处理呢?




3.三、AC代码

#include 
#include 
using namespace std;
int p[200];
int main() {
    int T; cin >> T;
    int n, s, t;
    while(T--) {
        cin >> n;
        memset(p, 0, sizeof(p));
        for(int i = 0; i < n; i++) {
            cin >> s >> t;
            s = (s-1)/2;
            t = (t-1)/2;
            if(s > t) {
                s = s ^ t;
                t = s ^ t;
                s = s ^ t;
            }
            for(int j = s; j <= t; j++) {
                p[j]++;
            }
        }
        int min = -1;
        for(int k = 0; k < 200; k++) {
            if(p[k] > min) min = p[k];
        }
        cout << min*10 << endl;
    }
    return 0;
}






转载请注明:CodingBlog » HDOJ 1050 Moving Tables (贪心)

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情