Moving Tables(POJ 1083)
来源:互联网 发布:linux环境变量的作用 编辑:程序博客网 时间:2024/05/01 00:20
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
思考:s不一定比t要小,一定要先比一下再往下做。
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>using namespace std;int main(){ int t, n; cin >> t; int a[300]; while (t--) { int n; cin >> n; memset (a, 0, sizeof(a)); int s, t; int num = 1; while (n--) { cin >> s >> t; if (s % 2) s++; if (t % 2) t++; s /= 2; t /= 2; if (s > t) swap(s, t); for (int i = s; i <= t; i++) { a[i]++; if (a[i] > num) num = a[i]; } } cout << num * 10 << endl; } return 0;}
- 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
- poj 1083 Moving Tables
- POJ 1083 Moving Tables
- Nsight Monitor无法正常打开
- 51 NOD 1521 一维战舰(并查集)
- HBase的WAL机制
- 分别计算0-n中0-9出现的次数
- 神经网络:术语
- Moving Tables(POJ 1083)
- 在排序数组中查找和为给定值的两个数字
- windows 10聚焦无法更新锁屏壁纸
- Spring MVC之@RequestParam @RequestBody @RequestHeader 等详解
- DOM中的event对象详解 — 第13.3.1节
- 機器人學總結(1) —— 機器人的描述
- Java Web程序开发入门--读书笔记(一)
- Php +Redis 做消息队列
- java基础一 作用域问题、值传递、引用传递