HDU 1350(最小路径覆盖)
来源:互联网 发布:李强强 网络基础视频 编辑:程序博客网 时间:2024/05/22 01:38
Taxi Cab Scheme
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 87 Accepted Submission(s): 46
Problem 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
- HDU 1350(最小路径覆盖)
- hdu 1350+hdu 1960(最小路径覆盖)
- hdu-1350-最小路径覆盖(二分图)
- hdu 3991(最小路径覆盖)
- hdu 3335 (最小路径覆盖)
- hdu 3335(最小路径覆盖)
- hdu 4160(最小路径覆盖)
- 【最小路径覆盖】HDU 4160
- hdu 1151 最小路径覆盖
- hdu 1151 最小路径覆盖
- HDU - 4160 最小路径覆盖
- 最小路径覆盖 hdu 1151 hdu 3335
- Hdu 1350 Taxi Cab Scheme【最小路径覆盖】
- HDU-1350 Taxi Cab Scheme(最小路径覆盖)
- HDU 1151 Air Raid(最小路径覆盖)
- hdu Matrix(二分图的最小路径覆盖)
- hdu 1151 Air Raid(最小路径覆盖)
- hdu 4606(线段相交 + 最短路 + 最小路径覆盖)
- 这几天。。。
- IT名站录
- JavaScript 获取客户端计算机硬件及系统信息
- Android多國語言
- 常用正则表达式
- HDU 1350(最小路径覆盖)
- 在HomeScreen上添加指定应用图标
- 在c#使用Windows IOCP(完成端口)编程研究
- 手机网站重构经验分享(S60V3篇)
- 常用正则表达式
- 这几天。。。
- 制作Mobile地图缓存的方法
- oracle中rownum用法的总结(转)
- 开发