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.
- Customeri will take Ti 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 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 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 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
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <queue>
using namespace std;
const int maxn = ;
int n, m, k, q, now = ;
int t[maxn] = { };
int done[maxn] = { };
int pre[maxn] = { };
struct people {
int id;
int time;
int time_const;
};
queue<people*> que[];
int main() {
scanf("%d %d %d %d", &n, &m, &k, &q);
if (n == || m == ) {
for (int i = ; i < q; i++) {
printf("Sorry\n");
}
}
for (int i = ; i <= k; i++) {
int time;
scanf("%d", &time);
people *p = new people;
p->id = i;
p->time = time;
p->time_const = time;
if(i<=n*m)que[(i-)%n].push(p);
else {
int first = , first_j = ;
for (int j = ; j < n; j++) {
if (que[j].front()->time < first) {
first = que[j].front()->time;
first_j = j;
}
} for (int j = ; j < n; j++) {
que[j].front()->time -= first;
}
people* tmp_p = que[first_j].front();
que[first_j].pop();
now += first;
done[tmp_p->id] = now;
que[first_j].push(p);
pre[tmp_p->id] = now - tmp_p->time_const;
delete(tmp_p);
}
}
for (int i = ; i < n; i++) {
int tmp_now = now;
while (!que[i].empty()) {
people* tmp_p = que[i].front(); que[i].pop();
tmp_now += tmp_p->time;
pre[tmp_p->id] = tmp_now - tmp_p->time_const;
done[tmp_p->id] = tmp_now;
delete(tmp_p);
}
}
for (int i = ; i < q; i++) {
int j;
scanf("%d", &j);
//printf("%d %d\n", pre[j], done[j]);
if (pre[j]>=)printf("Sorry\n");
else {
printf("%02d:%02d\n", +done[j]/,done[j]%);
}
}
system("pause");
}
注意点：考察队列知识，相对比较简单，有一个坑就是结束时间在17点后但开始时间17点前还是要输出时间的，一开始没注意就错了三个测试点。