xtu read problem training 4 A - Moving Tables
Moving Tables
This problem will be judged on ZJU. Original ID: 1029
64-bit integer IO format: %lld Java class name: Main
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
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <cstdlib>
#include <string>
#include <set>
#include <stack>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
int a[];
int main() {
int k,s,t,j,mx,n;
scanf("%d",&k);
while(k--) {
mx = ;
memset(a,,sizeof(a));
scanf("%d",&n);
while(n--) {
scanf("%d%d",&s,&t);
if(s > t) swap(s,t);
s = (s+)/;
t = (t+)/;
for(j = s; j <= t; j++) {
++a[j]; if(a[j] > mx) mx = a[j];
}
}
printf("%d\n",mx*);
}
return ;
}
最新文章
- 花生壳动态IP域名解析之python自动提交公网IP
- EF CodeFirst 如何通过配置自动创建数据库<;当模型改变时>;
- Linux操作系统奥秘02-系统引导(GRUB)
- 减去border边框
- [Mysql] MySQL配置文件my.cnf的理解
- ZendStudio10 代码格式化 xml
- GitHub使用(二) - 新建文件夹
- 总结XSS与CSRF两种跨站攻击
- Qt UI tips
- VIM:Found a swap file by the name
- java之路 打印1到100之间的数
- 纯小白创建第一个Node程序失败-容易忽略的一个细节
- testng学习-before&;after,parameters,并行,factory,beanshell,监听器,依赖注入
- mysql备份和bin-log日志
- Pod 找不到头文件 解决方法
- Windows上使用telnet测试端口号
- mysql之数据库的介绍和基本的增删改查
- java批量读取多个文件并存入数据库
- C#学习笔记(3)——操作sqlserver数据库增删改查
- 剑指offer四十之数组中只出现一次的数字
热门文章
- New Article For Test
- Hdu 5348 MZL&#39;s endless loop (dfs)
- -Dmaven.multiModuleProjectDirectory system property is not set. Check $M2_HOME environment variable and mvn script match问题处理
- 转-iOS开发系列--地图与定位
- 窗口Dialog
- rhel7安装oracle 11gR2
- jq星星评分
- 读《实战 GUI 产品的自动化测试》之:第四步,高阶技巧
- H.264学习笔记5——熵编码之CAVLC
- 到T-SQL DML 三级的阶梯:在SQL server中实现关系模型