PAT 1026

1026. Table Tennis (30)

时间限制

400 ms

内存限制

32000 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.当有多个乒乓球台空闲时，vip顾客到了会使用最小id的vip球台，而不是最小id的球台，测试以下用例：

2
10:00:00 30 1
12:00:00 30 1
5 1
3

输出正确结果应为：

10:00:00 10:00:00 0

12:00:00 12:00:00 0

0 0 2 0 0

2.题目要求每对顾客玩的时间不超过2小时，那么当顾客要求玩的时间>2小时的时候，应该截断控制，测试以下用例：

2
18:00:00 180 1
20:00:00 60 1
1 1
1

输出的正确结果应为：

18:00:00 18:00:00 0

20:00:00 20:00:00 0

2

3.虽然题目中保证客户到达时间在08:00:00到21:00:00之间，但是根据最后的8个case来看，里面还是有不在这个时间区间内到达的顾客，所以建议还是稍加控制，测试以下用例：

1
21:00:00 80 1
1 1
1

输出的正确结果应为：

0

4.题目中说的round up to an integer minutes是严格的四舍五入，需要如下做：

wtime = (stime - atime + 30) / 60

而不是：

wtime = (stime - atime + 59) / 60

（额，这个可能是我自己的白痴问题，纠结了近一个小时就这个。。。）

---

完整通过的代码如下（Python）：

tm2secs = lambda t: t[0] *  + t[] *  + t[]
secs2tm = lambda s: '%02d:%02d:%02d' % (s/, s/%, s%)
N = input()
players = [raw_input() for i in xrange(N)]
players.sort()
for i, player in enumerate(players):
    player = player.split()
    atime = tm2secs(map(int, player[0].split(':')))
    ptime, isvip = map(int, player[:])
    if ptime > : ptime =
    players[i] = atime, ptime, isvip

N, M = map(int, raw_input().split())
vips = map(int, raw_input().split())
now = tm2secs((,0,0))
create_table = lambda i: [0, True if i+ in vips else False, now]
tables = [create_table(i) for i in xrange(N)]

def get_a_table(atime):
    for table in tables:
        if table[-] <= atime:
            return table

def get_a_vip_table(atime):
    for table in tables:
        if table[-] <= atime and table[]:
            return table

def print_record(atime, stime):
    wtime = (stime - atime + ) /
    atime = secs2tm(atime)
    stime = secs2tm(stime)
    print atime, stime, wtime

def serv_table(table, atime, ptime):
    table[0] +=
    table[-] = max(table[-], atime)
    print_record(atime, table[-])
    table[-] += ptime * 

def get_earliest_table():
    tmp = [table[-] for table in tables]
    return tables[tmp.index(min(tmp))]

def get_a_vip_player(index, table):
    for player in players[index+:]:
        if player[-] and player[0] <= table[-]:
            players.remove(player)
            players.insert(index, player)
            return player

for i, player in enumerate(players):
    atime, ptime, isvip = player
    if atime >= tm2secs((, 0, 0)): break
    if isvip:
        vip_table = get_a_vip_table(atime)
        if vip_table:
            serv_table(vip_table, atime, ptime)
            continue
    table = get_a_table(atime)
    if table:
        serv_table(table, atime, ptime)
        continue
    else:
        table = get_earliest_table()
        if table[-] >= tm2secs((, 0, 0)): break
        if not isvip and table[]:
            vip_player = get_a_vip_player(i, table)
            if vip_player:
                atime, ptime, isvip = vip_player
                serv_table(table, atime, ptime)
                continue
        serv_table(table, atime, ptime)

for table in tables:
    print table[0],