POJ-1083 Moving Tables
来源:互联网 发布:hc sr04 51单片机程序 编辑:程序博客网 时间:2024/04/29 09:47
Moving Tables
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30977 Accepted: 10322
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
Source
Taejon 2001
理解题意很重要
理解题意很重要
理解题意很重要
本题思路是
取被占用次数最多的区间,求时间,也就是乘10
还有个坑的地方是考虑区间起始结束的奇偶性。
起始为奇数时,加一。
结束为奇数时,加一。
AC代码:
#include<stdio.h>#include<stdlib.h>#include<math.h>#include<string.h>int a[405];int main(){int m,n,i,j,t,y,max,sum;scanf("%d",&m);while(m--){memset(a,0,sizeof(a));scanf("%d",&n);max=0;while(n--){scanf("%d %d",&i,&j);if(i>j){t=i;i=j;j=t;}for(t=(i+1)/2;t<=(j+1)/2;t++){a[t]++;if(a[t]>max)max=a[t];}}printf("%d\n",max*10);}return 0;}
0 0
- 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
- POJ 1083 Moving Tables
- CodeForces 148D-Bag of mice概率DP
- 50天全民听力输入训练:Green Apple
- win10下vs2015的OpenCV3.1配置方法
- 摸爬滚打DirectX11_day03——DirectX9中的固定功能渲染流水线体系(已移除,了解)
- android studio 高级设置--驼峰选择,命名前缀,快速导包,Log 颜色等等
- POJ-1083 Moving Tables
- junit3和junit4的一个入门例子程序
- FastJson简单使用
- 算法竞赛入门经典第二版 第二章
- 如何开发你的第一个Java Google App Engine 程序
- Android 操作JSON数据
- 一些名词解释 关于iOS编程的“国际化与本地化”
- 51nod 1043 幸运号码【dp+滚动数组】
- 词法分析程序设计