1014. Waiting in Line (30)(模拟题)

Posted 2020-09-18

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, customer1 is served at window1 while customer2 is served at window2. Customer3 will wait in front of window1 and customer4 will wait in front of window2. Customer5 will wait behind the yellow line.

At 08:01, customer1 is done and customer5 enters the line in front of window1 since that line seems shorter now. Customer2 will leave at 08:02, customer4 at 08:06, customer3 at 08:07, and finally customer5 at 08:10.

Input

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 K customers.

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

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

 

Code:

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 const int maxn = 1000 + 5;
 4 int n , m , k , q;
 5 struct Customer
 6 {
 7     int line;
 8     int start_time = 0;
 9     int end_time = 0;
10     int process_time;
11     bool operator < (const Customer tmp)const
12     {
13 
14         /*取队列中最早结束的，如果时间一样，取窗口id最小的*/
15 
16         if(end_time == tmp.end_time)
17             return line > tmp.line;
18         else
19             return end_time > tmp.end_time;
20     }
21 }cus[maxn];
22 int query[maxn];
23 int finish_time[maxn];
24 int main()
25 {
26     scanf("%d %d %d %d" , &n , &m , &k , &q);
27     for(int i = 1 ; i <= k ; i++)
28     {
29         scanf("%d" , &cus[i].process_time);
30     }
31     for(int i = 1 ; i <= q ; i++){
32         scanf("%d" , &query[i]);
33     }
34     priority_queue <Customer> queueline;
35     int cnt=0;
36     Customer tmp;
37     int linetime[maxn];
38     memset(linetime , 0 , sizeof(linetime));
39     //对于前m*n个人，往队列里插即可
40     for(int i = 1 ; i <= m && cnt < k ; i++)
41     {
42         for(int j = 0 ; j < n && cnt < k ; j++)
43         {
44             cnt++;
45             tmp.line = j;
46             tmp.start_time = linetime[j];
47             tmp.end_time = linetime[j] = tmp.start_time + cus[cnt].process_time;
48             cus[cnt].line = j;
49             cus[cnt].start_time = tmp.start_time;
50             cus[cnt].end_time = tmp.end_time;
51             queueline.push(tmp);
52         }
53     }
54     Customer c;
55     for(int i = cnt + 1 ; i <= k ; i++)
56     {
57         //取出结束时间最早的
58         tmp = queueline.top();
59         queueline.pop();
60         c.line = tmp.line;
61         c.start_time = linetime[tmp.line];
62         c.end_time = linetime[tmp.line] = c.start_time + cus[i].process_time;
63         cus[i].line = c.line;
64         cus[i].start_time = c.start_time;
65         cus[i].end_time = c.end_time;
66         queueline.push(c);
67     }
68     int cid;
69     int maxtime = (17-8) * 60;
70     for(int i = 1 ; i <= q ; i++)
71     {
72         cid = query[i];
73         ///原来开始的时间包括17:00。。。只要是17:00或者是以后的，就不被服务
74         ///原来写的是>，结果一部分样例一直没过，还以为自己前面写错了
75         if(cus[cid].start_time >= maxtime)
76             printf("Sorry\\n");
77         else
78         {
79             int hour = cus[cid].end_time / 60;
80             int minu = cus[cid].end_time % 60;
81             printf("%02d:%02d\\n" , hour + 8 , minu);
82         }
83     }
84     return 0;
85 }

View Code