1014 Waiting in Line

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 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 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 
#include 
#include 
#include 
using namespace std;

struct win {
	queueq;
	int et; //最后一位顾客的结束时间
	int st;//该窗口第一位顾客的结束时间，即该窗口由满变为不满的时间

} w[25];

int kc[1010], ke[1010]; //每个顾客花费时间，每个顾客结束时间
int main() {
	int n, m, k, t;
	cin >> n >> m >> k >> t;
	for (int i = 1; i <= k; i++) {
		cin >> kc[i];
		if (i <= n) {
			w[i].et = 0;
			w[i].st = kc[i];
		}
	}
	int cnt = 1;
	for (int i = 1; i <= k && i <= n * m; i++, cnt++) {
		if (cnt == n + 1) {
			cnt = 1;
		}
		w[cnt].q.push(i);
		w[cnt].et += kc[i];
		ke[i] = w[cnt].et;
	}
	for (int i = n * m + 1; i <= k; i++) {
		int minn = w[1].st;
		int ind = 1;
		for (int j = 1; j <= n; j++) {
			if (w[j].st < minn) { //选出一个结束 时间最早的作为下一个人的窗口
				ind = j;
				minn = w[j].st;
			}
		}
		w[ind].q.pop();
		int fir = w[ind].q.front();
		w[ind].st += kc[fir];
		w[ind].q.push(i);
		w[ind].et += kc[i];
		ke[i] = w[ind].et;
	}
	while (t--) {
		int x;
		cin >> x;
		if (ke[x] - kc[x] >= 9 * 60) {
			cout << "Sorry";
		} else {
			int hh = ke[x] / 60 + 8;
			int mm = ke[x] % 60;
			if (hh < 10) {
				cout << 0;
			}
			cout << hh << ':';
			if (mm < 10) {
				cout << 0;
			}
			cout << mm;
		}
		if (t) {
			cout << endl;
		}
	}
	return 0;
}