PAT 1026. Table Tennis (30)(待修改)
来源:互联网 发布:免费宠物店收银软件 编辑:程序博客网 时间:2024/05/20 03:39
官网
1026. Table Tennis (30)
时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive, they will be assigned to the available table with the smallest number. If all the tables are occupied, they will have to wait in a queue. It is assumed that every pair of players can play for at most 2 hours.
Your job is to count for everyone in queue their waiting time, and for each table the number of players it has served for the day.
One thing that makes this procedure a bit complicated is that the club reserves some tables for their VIP members. When a VIP table is open, the first VIP pair in the queue will have the priviledge to take it. However, if there is no VIP in the queue, the next pair of players can take it. On the other hand, if when it is the turn of a VIP pair, yet no VIP table is available, they can be assigned as any ordinary players.
Input Specification:
Each input file contains one test case. For each case, the first line contains an integer N (<=10000) - the total number of pairs of players. Then N lines follow, each contains 2 times and a VIP tag: HH:MM:SS - the arriving time, P - the playing time in minutes of a pair of players, and tag - which is 1 if they hold a VIP card, or 0 if not. It is guaranteed that the arriving time is between 08:00:00 and 21:00:00 while the club is open. It is assumed that no two customers arrives at the same time. Following the players’ info, there are 2 positive integers: K (<=100) - the number of tables, and M (< K) - the number of VIP tables. The last line contains M table numbers.
Output Specification:
For each test case, first print the arriving time, serving time and the waiting time for each pair of players in the format shown by the sample. Then print in a line the number of players served by each table. Notice that the output must be listed in chronological order of the serving time. The waiting time must be rounded up to an integer minute(s). If one cannot get a table before the closing time, their information must NOT be printed.
Sample Input:
9
20:52:00 10 0
08:00:00 20 0
08:02:00 30 0
20:51:00 10 0
08:10:00 5 0
08:12:00 10 1
20:50:00 10 0
08:01:30 15 1
20:53:00 10 1
3 1
2
Sample Output:
08:00:00 08:00:00 0
08:01:30 08:01:30 0
08:02:00 08:02:00 0
08:12:00 08:16:30 5
08:10:00 08:20:00 10
20:50:00 20:50:00 0
20:51:00 20:51:00 0
20:52:00 20:52:00 0
3 3 2
解题思路
- 1.烟客旅人
- PAT 1026. Table Tennis (30)(待修改)
- 【PAT】1026. Table Tennis (30) (待改进)
- PAT 1026. Table Tennis (30)
- 1026. Table Tennis (30)-PAT
- PAT 1026. Table Tennis (30)
- PAT 1026. Table Tennis (30)
- pat 1026. Table Tennis (30)
- PAT 1026. Table Tennis (30)
- PAT 1026. Table Tennis
- 【PAT】1026. Table Tennis
- PAT 1026. Table Tennis (30) 【26/30】
- PAT A 1026. Table Tennis (30)
- 【PAT甲级】1026. Table Tennis (30)
- PAT甲级1026. Table Tennis (30)
- 【PAT】【Advanced Level】1026. Table Tennis (30)
- PAT-A-1026. Table Tennis (30)
- PAT 甲级 1026. Table Tennis (30)
- PAT 1026 Table Tennis (30)
- 自白初衷
- Valid Perfect Square
- mybatis 原始dao开发和mapper代理开发的比较
- Leetcode 242. Valid Anagram
- CCF-201312-3-最大的矩形
- PAT 1026. Table Tennis (30)(待修改)
- 网上下载的ios项目运行
- AWK 计算平均值
- UVA 11996 splay
- 忘记开机密码解决办法
- 数据库同时更新多个字段
- 【demo记录】mob短信验证(GUI和无GUI)
- RasUpdateConnection
- eclipse --- 新建JSP页面默认模版设置