POJ1083--Moving Tables
来源:互联网 发布:hadoop是java写的吗 编辑:程序博客网 时间:2024/05/17 06:51
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
PS:只要知道每个房间前的那小段走廊被用了多少次,然后取最大值就可以。
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int room[408];inline int max(int a,int b){return a>b?a:b;}inline int min(int a,int b){return a>b?b:a;}int main(){//freopen("in.txt","r",stdin);int t;scanf("%d",&t);while(t--){memset(room,0,sizeof(room));int n;scanf("%d",&n);for(int i=1;i<=n;i++){int u,v;scanf("%d%d",&u,&v);int temp1,temp2;temp1 = min(u,v);temp2 = max(u,v);u = temp1,v = temp2;if((u&1)!=0) u++;if((v&1)!=0) v++;for(int j=u;j<=v;j+=2){room[j]++;}}sort(room+1,room+400+1);printf("%d\n",room[400]*10);}return 0;}
- POJ1083 Moving Tables
- poj1083 Moving Tables
- POJ1083 Moving Tables
- POJ1083 Moving Tables
- POJ1083--Moving Tables
- POJ1083 Moving Tables
- poj1083:moving tables
- poj1083 Moving Tables
- poj1083 Moving Tables
- poj1083 Moving Tables
- [POJ1083]Moving Tables
- POJ1083-Moving Tables
- poj1083-Moving Tables-贪心
- POJ1083 Moving Tables
- [POJ1083]Moving Tables
- POJ1083-Moving Tables解题报告
- 【离散化】poj1083 Moving Tables
- POJ1083,Moving Tables,好纠结的题
- WaitCommEvent function
- php判断浏览器名称和版本
- 学习笔记——usb hid
- android开发知识小汇2
- wxPython: Using wx.Timers
- POJ1083--Moving Tables
- Nginx配置中FastCGI的几个命令
- 学习笔记----stm32的usb外设概述
- JAVA枚举类型举例
- 玩转xenstore(1)
- 关于autocomplete的小例子
- c#委托使用 子窗体、父窗体、同级窗体 相互调用函数
- 创业的思想
- Process.waitFor()的返回值含义