Moving Tables
Moving Tables
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 33739 Accepted: 11268

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 file. 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 3 + N -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

解法一:说一下这个题目的坑以及解法:

1.s可能小于t

2.如果s为偶数,则s--;如果t为奇数,则t++

3.有点类似于调度问题吧,按照s排序

#include<iostream>
#include<memory.h>
using namespace std;
int start[210];
int end2[210];
int visited[210];
int pratition(int p,int q){
    int baseStart = start[p];
    int baseend2 = end2[p];
    while(p < q){
        while(p < q && start[q] >= baseStart){
            q--;
        }
        if(p < q){
            start[p] = start[q];
            end2[p] = end2[q];
            p++;
        }
        while(p < q && start[p] <= baseStart)
            p++;
        if(p < q){
            start[q] = start[p];
            end2[q] = end2[p];
            q--;
        }
    }
    start[p] = baseStart;
    end2[p] = baseend2;
    return p;
}
void quickSort(int p,int q){
    if(p < q){
        int r = pratition(p,q);
        quickSort(p,r-1);
        quickSort(r+1,q);
    }
}
int main(){
    int total_case;
    cin>>total_case;

    while(total_case--){
        int total_num;
        cin>>total_num;

        for(int i = 0; i < total_num; i++){
            cin>>start[i];
            cin>>end2[i];
            if(start[i] > end2[i]){
                int temp = start[i];
                start[i] = end2[i];
                end2[i] = temp;
            }
            if(start[i]%2 == 0){
                start[i]--;
            }
            if(end2[i]%2){
                end2[i]++;
            }
        }
        quickSort(0,total_num-1);
        int result = 0;
        memset(visited,0,sizeof(visited));
        for(int i = 0; i < total_num;i++){
            if(!visited[i]){
                visited[i] = 1;
                result++;
                int k = i;
                for(int j = i+1;j < total_num;j++){
                    if(!visited[j] && start[j] > end2[k]){
                        visited[j] = 1;
                        k = j;
                    }
                }
            }
        }
        cout<<10*result<<endl;
    }

}
解法二:最大的重叠,暴力贪心的感觉。
#include<iostream>
#include<memory.h>
using namespace std;
int start[210];
int end2[210];
int visited[210];
int main(){
    int total_case;
    cin>>total_case;

    while(total_case--){
        int total_num;
        cin>>total_num;
        int result = 0;
        memset(visited,0,sizeof(visited));
        for(int i = 0; i < total_num; i++){
            cin>>start[i];
            cin>>end2[i];
            if(start[i] > end2[i]){
                int temp = start[i];
                start[i] = end2[i];
                end2[i] = temp;
            }
            if(start[i]%2 == 0){
                start[i]--;
            }
            if(end2[i]%2){
                end2[i]++;
            }

            for(int j = start[i]; j <= end2[i] ; j++){
                visited[j]++;
            }

        }
        for(int i = 0; i < 210 ; i++){
            if(result < visited[i]){
                result = visited[i];
            }
        }
        cout<<10*result<<endl;
    }

}


阅读更多
文章标签: poj
个人分类: poj
想对作者说点什么? 我来说一句

moving Tables

2010年08月02日 941B 下载

没有更多推荐了,返回首页

不良信息举报

Moving Tables

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭