poj1083Moving Tables(区间覆盖)
2016-11-23 20:12
253 查看
题目链接
Moving Tables
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
Sample Output
解题思路:
Moving Tables
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 30917 | Accepted: 10302 |
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
解题思路:
用数组d[205]记录每个房间前的走廊被用过多少次,然后排个序则答案即为d[0]*10;每扫描一个点将数组这个范围内的值加1,注意,范围的确定,上限s=(a[i].left+1)/2, 下限e=(a[i].right+1)/2。还应注意输入的两个值的大小问题。
#include #include #include using namespace std; struct node{ int right; int left; }; bool compare(const int a,const int b) { return a>b; } int main(){ int i,max,sum,n,t,b[205]; node a[100005]; scanf("%d",&t); while(t--){ scanf("%d",&n); for(int i=0;ia[i].right){ int temp=a[i].left; a[i].left=a[i].right; a[i].right=temp; } } memset(b,0,sizeof(b)); for(int i=0;i
相关文章推荐
- uvalive 2326 - Moving Tables(区间覆盖问题)
- uvalive 2326 - Moving Tables(区间覆盖问题)
- Moving Tables(贪心 区间覆盖)
- HDU 1050 Moving Tables 【区间覆盖】
- hdoj 1050 Moving Tables【贪心区间覆盖】
- uvalive 2326 - Moving Tables(区间覆盖问题)
- hdu 1050 Moving Tables(贪心算法---区间覆盖,重叠数)
- HDU ACM 1050 Moving Tables(贪心 + 区间覆盖问题)
- POJ 2528(线段树,区间覆盖,离散化思想)
- 基于贪心算法的几类区间覆盖问题
- HDU 2037 今年暑假不AC 区间覆盖 贪心
- [SDUT](2074)区间覆盖问题 ---贪心
- 基于贪心算法的几类区间覆盖问题
- 区间覆盖问题(贪心)
- [2074]区间覆盖问题 sdutOJ
- Far Relative’s Problem【 区间覆盖】
- NYOJ 12 喷水装置(2)贪心之区间覆盖问题
- POJ 1328 Radar Installation(贪心+区间覆盖)
- 基于贪心算法的几类区间覆盖问题
- 区间覆盖问题