POJ-2060-Taxi Cab Scheme
来源:互联网 发布:软件开发服务费税率 编辑:程序博客网 时间:2024/05/21 01:32
Taxi Cab Scheme
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6506 Accepted: 2743
Description
Running a taxi station is not all that simple. Apart from the obvious demand for a centralised coordination of the cabs in order to pick up the customers calling to get a cab as soon as possible,there is also a need to schedule all the taxi rides which have been booked in advance.Given a list of all booked taxi rides for the next day, you want to minimise the number of cabs needed to carry out all of the rides.
For the sake of simplicity, we model a city as a rectangular grid. An address in the city is denoted by two integers: the street and avenue number. The time needed to get from the address a, b to c, d by taxi is |a - c| + |b - d| minutes. A cab may carry out a booked ride if it is its first ride of the day, or if it can get to the source address of the new ride from its latest,at least one minute before the new ride's scheduled departure. Note that some rides may end after midnight.
For the sake of simplicity, we model a city as a rectangular grid. An address in the city is denoted by two integers: the street and avenue number. The time needed to get from the address a, b to c, d by taxi is |a - c| + |b - d| minutes. A cab may carry out a booked ride if it is its first ride of the day, or if it can get to the source address of the new ride from its latest,at least one minute before the new ride's scheduled departure. Note that some rides may end after midnight.
Input
On the first line of the input is a single positive integer N, telling the number of test scenarios to follow. Each scenario begins with a line containing an integer M, 0 < M < 500, being the number of booked taxi rides. The following M lines contain the rides. Each ride is described by a departure time on the format hh:mm (ranging from 00:00 to 23:59), two integers a b that are the coordinates of the source address and two integers c d that are the coordinates of the destination address. All coordinates are at least 0 and strictly smaller than 200. The booked rides in each scenario are sorted in order of increasing departure time.
Output
For each scenario, output one line containing the minimum number of cabs required to carry out all the booked taxi rides.
Sample Input
2208:00 10 11 9 1608:07 9 16 10 11208:00 10 11 9 1608:06 9 16 10 11
Sample Output
12
Source
Northwestern Europe 2004
0 0
- POJ 2060 Taxi Cab Scheme
- POJ-2060-Taxi Cab Scheme
- POJ 2060 Taxi Cab Scheme
- POJ 2060 Taxi Cab Scheme
- POJ 2060 Taxi Cab Scheme
- POJ 2060-Taxi Cab Scheme
- POJ-2060-Taxi Cab Scheme
- Taxi Cab Scheme POJ && HDU
- POJ--2060[Taxi Cab Scheme] 最小路径覆盖
- poj 2060 Taxi Cab Scheme 二分匹配匈牙利
- POJ 2060 Taxi Cab Scheme (最小路径覆盖)
- POJ-2060 Taxi Cab Scheme 最小路径覆盖(匈牙利)
- POJ 2060 Taxi Cab Scheme(匈牙利—最小路径覆盖)
- POJ 2060 Taxi Cab Scheme DAG最小路径覆盖
- Poj-2060 Taxi Cab Scheme 二分图最小路径覆盖
- poj 2060 Taxi Cab Scheme 最小路径覆盖
- poj 2060 Taxi Cab Scheme 最小路径覆盖
- POJ - 2060 Taxi Cab Scheme 二分图 最小路径覆盖
- mac ssh key 的获取
- rxjava几个关键类的类图
- APP开发流程实例讲解-儒释道网络电台八天开发全程-百度云深度兼容测试并进一步优化排错
- (OK) Problem With Android Configuration - routing table
- 玩无限消乐的设计示例(基础篇)DataGridView控件添加拖放事件方法和委托
- POJ-2060-Taxi Cab Scheme
- 韩顺平.循序渐进学.java.从入门到精通迅雷资源下载地址
- linux进程间通信方法
- Multiple Lights
- sleep()和 wait()有什么区别
- 拒绝对象的赋值与复制做法
- Android中取得手机屏幕的信息
- java.lang.IllegalArgumentException: Wrong state class, expecting View State but received class andro
- 关于android 提示had used a different xxx; during pre-berification