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 customers 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
1 #include <stdio.h> 2 #include<queue> 3 using namespace std; 4 5 struct node 6 { 7 int startime,endtime; 8 queue<int> q; 9 } window[21]; 10 int serve[1001]; //服务时间 11 int ans[1001]; //服务完时间 12 int sorry[1001]; /*标记是否进行服务 13 这里一开始我只是想判断服务完时间是否大于540分，但是有测试点不通过 14 后来想想原因可能是他在没有关门前开始服务，然后到下班还没服务完，应该不算在sorry数组里*/ 15 int main() 16 { 17 int n,m,k,q; 18 int i,j,index=1; //标记人数 19 scanf("%d%d%d%d",&n,&m,&k,&q); 20 for( i=1; i<=k; i++) 21 scanf("%d",&serve[i]); 22 for(i=1; i<=m; i++) 23 { 24 for( j=1; j<=n; j++) 25 { 26 if( index<=k ) 27 { 28 window[j].q.push(serve[index]); //入队 29 if( window[j].endtime>=540) //如果前一个人结束时间超过540，这个人就标记为sorry 30 sorry[index]=1; 31 window[j].endtime += serve[index]; 32 if(i==1) 33 window[j].startime = window[j].endtime; 34 ans[index++] = window[j].endtime; 35 } 36 } 37 } 38 while( index<=k ) //超过黄线的人 39 { 40 int mintime = window[1].startime; 41 int minwindow = 1; 42 for( i=2; i<=n; i++) 43 { 44 if(window[i].startime<mintime) //每次寻找出最先完成服务的窗口 45 { 46 mintime = window[i].startime; 47 minwindow = i; 48 } 49 } 50 window[minwindow].q.pop(); 51 window[minwindow].q.push(mintime); 52 window[minwindow].startime+= window[minwindow].q.front(); 53 if( window[minwindow].endtime>=540) 54 sorry[index]=1; 55 window[minwindow].endtime += serve[index]; 56 ans[index++] = window[minwindow].endtime; 57 } 58 for( i=1; i<=q; i++) 59 { 60 int query,minute; 61 scanf("%d",&query); 62 if( sorry[query]==1) 63 printf("Sorry "); 64 else printf("%02d:%02d ",(ans[query]+480)/60,(ans[query]+480)%60); 65 } 66 return 0; 67 }