1014 Waiting in Line （30 分）

1014 Waiting in Line （30 分）

Suppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are:

• The space inside the yellow line in front of each window is enough to contain a line with M customers. Hence when all the N lines are full, all the customers after (and including) the (NM+1)st one will have to wait in a line behind the yellow line.
• Each customer will choose the shortest line to wait in when crossing the yellow line. If there are two or more lines with the same length, the customer will always choose the window with the smallest number.
• Customer​i​​ will take T​i​​ minutes to have his/her transaction processed.
• The first N customers are assumed to be served at 8:00am.

Now given the processing time of each customer, you are supposed to tell the exact time at which a customer has his/her business done.

For example, suppose that a bank has 2 windows and each window may have 2 custmers waiting inside the yellow line. There are 5 customers waiting with transactions taking 1, 2, 6, 4 and 3 minutes, respectively. At 08:00 in the morning, customer​1​​ is served at window​1​​ while customer​2​​ is served at window​2​​. Customer​3​​ will wait in front of window​1​​ and customer​4​​ will wait in front of window​2​​. Customer​5​​ will wait behind the yellow line.

At 08:01, customer​1​​ is done and customer​5​​ enters the line in front of window​1​​ since that line seems shorter now. Customer​2​​ will leave at 08:02, customer​4​​ at 08:06, customer​3​​ at 08:07, and finally customer​5​​ at 08:10.

Input Specification:

Each input file contains one test case. Each case starts with a line containing 4 positive integers: N (≤20, number of windows), M (≤10, the maximum capacity of each line inside the yellow line), K (≤1000, number of customers), and Q (≤1000, number of customer queries).

The next line contains K positive integers, which are the processing time of the Kcustomers.

The last line contains Q positive integers, which represent the customers who are asking about the time they can have their transactions done. The customers are numbered from 1 to K.

Output Specification:

For each of the Q customers, print in one line the time at which his/her transaction is finished, in the format HH:MM where HH is in [08, 17] and MM is in [00, 59]. Note that since the bank is closed everyday after 17:00, for those customers who cannot be served before 17:00, you must output Sorry instead.

Sample Input:

2 2 7 5
1 2 6 4 3 534 2
3 4 5 6 7

Sample Output:

08:07
08:06
08:10
17:00
Sorry

题解：

假设一家银行有N个窗口提供服务。窗前的黄线将等候区域分成了两部分。客户在线内等候的规则是：

1、黄线到窗口的区域可以容纳M个客户。因此当N个线都满了之后，会有一些客户需要在黄线以外等候。

2、当客户数目超过MN+1时，客户总是选择排队长度最短的，若有两个或多队长度一样，则选取编号较小的那个。

3、客户交易时长为Ti；

4、最先的N个客户在8:00am开始接受服务；

现在，给定每个客户的处理时长，你需要求出客户办理完时的确切时间。

比如说，假设一个银行有2个窗口并且每个窗口有2个客户在黄线内。有5个客户，他们的交易时间分别为1,2,6,4以及3分钟。早上8点的时候，客户1在第一个窗口，客户2在第二个窗口，客户3和客户4分别在窗口1和窗口2的黄线内等待，客户5排在黄线外。

08:01分的时候， 客户1完成交易，客户5进入了窗口1的黄线内。客户2将在08:02离开，客户4将在08:06离开，客户三将在08:07离开，最终客户5将在08:10离开。

输入规范：

每个输入文件包含一个测试用例。 每个案例以包含4个正整数的行开头：N（≤20，窗口数），M（≤10，黄线内每行的最大容量），K（≤1000，客户数量）和Q （≤1000，客户查询数量）。

下一行包含K个正整数，这是K个客户的处理时间。

最后一行包含Q正整数，表示询问他们可以完成交易的时间的客户。 客户编号从1到K.

输出规格：
对于每个Q客户，在一行中打印他/她的交易完成的时间，格式为HH：MM，其中HH在[08,17]中，MM在[00,59]中。 请注意，由于银行每天17:00后关闭，对于那些在17:00之前无法提供服务的客户，您必须输出"sorry"。

 

 

 

 

 

 

 

 

 

 

08:07
08:06
08:10
17:00
Sorry