POJ 1083 Moving Tables (水题)
来源:互联网 发布:vc编程软件 编辑:程序博客网 时间:2024/05/22 15:21
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.
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.
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
102030
求出重复的线段。
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int main(){int u,v,i,j,t,n,a[444];cin>>t;while(t--) {memset(a,0,sizeof(a));cin>>n;while(n--) {cin>>u>>v;if(u>v) swap(u,v);if(u%2==0) u--;if(v%2==1) v++;for(i=u;i<=v;i++) a[i]++;}sort(a,a+401);cout<<a[400]*10<<endl;}return 0;}
0 0
- POJ 1083 Moving Tables(水题)
- POJ 1083 Moving Tables (水题)
- Moving Tables(POJ 1083)
- poj 1083 Moving Tables
- POJ 1083 Moving Tables
- poj 1083 Moving Tables
- POJ 1083 Moving Tables
- poj 1083-Moving Tables
- POJ 1083 Moving Tables
- POJ 1083 Moving Tables
- POJ 1083 Moving Tables
- poj 1083 Moving Tables
- POJ 1083 Moving Tables
- POJ 1083 Moving Tables
- poj 1083 Moving Tables
- poj 1083 Moving Tables
- POJ-1083-Moving Tables
- POJ 1083 Moving Tables
- highchars项目中的实战,与ajax结合接收后台传过来的数据
- HDU 2582 f(n) (组合数的gcd)
- 【设计模式】从菜鸟到大鸟之命令模式
- 软件测试管理的基本流程
- 对数组Array进行原型prototype扩展后带来的for in遍历问题
- POJ 1083 Moving Tables (水题)
- 三角的写法
- Android Application理解
- GDI+学习记录之遍历系统中所有字体系列
- XML技术须知讲解
- 字符编码笔记:ASCII,Unicode和UTF-8
- 输入/输出流和文件操作
- 将本地工程上传到github
- 扩展正则表达式