ZOJ-1029(POJ-1083、HDU-1050) Moving Tables
来源:互联网 发布:40不惑50知天命60 编辑:程序博客网 时间:2024/06/01 10:00
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. 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 N+3-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
Output for the Sample Input
10
20
30
Source: Asia 2001, Taejon (South Korea)
/****************************************/ #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <cmath> #include <stack> #include <queue> #include <vector> #include <map> #include <string> #include <iostream> using namespace std;/****************************************///只看过道,就是一个长度200的区间,被经过最大次数的区间就是最小消耗的时间//如图:横轴表示区间,纵轴表示必须花费时间的次数,次数仅取决于最多的那个//————————————————————————// ------------//-------------------// ------------- -----------//-struct Table{int from, to;}a[210];int vis[210];bool cmp(int a, int b){return a > b;}int main(){int cas;scanf("%d", &cas);while(cas--) {int n, s, t;scanf("%d", &n);for(int i = 0; i < n; i++) {scanf("%d%d", &s, &t);int u = s + t;s = min(s, t);t = u - s;a[i].from = (s + 1)>>1;a[i].to = (t + 1)>>1;}memset(vis, 0, sizeof(vis));for(int i = 0; i < n; i++) {if(a[i].from != a[i].to) {for(int k = a[i].from; k <= a[i].to; k++)vis[k]++;}elsevis[a[i].from]++;}int maxi = -1;for(int i = 0; i < 210; i++) {maxi = max(maxi, vis[i]);}printf("%d\n", maxi*10);}return 0;}
- ZOJ-1029(POJ-1083、HDU-1050) Moving Tables
- HDU 1050 ZOJ 1029 Moving Tables
- HDU 1050 POJ 1083 Moving Tables
- POJ 1083 && HDU 1050 Moving Tables (贪心)
- POJ 1083 && HDU 1050 Moving Tables(贪心)
- ZOJ-1029-Moving Tables
- zoj 1029 Moving Tables
- zoj 1029 Moving Tables
- ZOJ - 1029 Moving Tables
- ZOJ 1029:Moving Tables
- Moving Tables(POJ 1083)
- ZOJ 1029 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
- GPS Camera网络相机
- 设计模式:工厂方法模式
- shell的应用程序:监视系统用户(详解)
- Android静态注册内部类广播BroadcastReceiver
- ant 打包生成APK与eclipse打包生成APK比较
- ZOJ-1029(POJ-1083、HDU-1050) Moving Tables
- MySQL 存储过程的基本用法
- Memaker model relationship
- DSR on Openstack POC
- AMQP
- tmux 初体验
- 移动端开发流程
- Hibernate和IBatis对比 .
- 东芝在中国台湾申述4家台企半导体专利侵权