Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 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.
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

解答

#include <cstdio>
#include <queue>
using namespace std;

struct Cust { int st, ed, t; } cust[1005];
struct Wind 
{
	int cur; queue<int> q;
	Wind() : cur(8*60) {};
} wind[21];


int main()
{
	int n, m, k, q; scanf("%d%d%d%d", &n, &m, &k, &q);
	for (int i = 0; i < k; i++) scanf("%d", &cust[i].t);

	int id = 0;
	for (int i = 0; id < n*m && id < k; i = (i+1) % n, id++) //排满n条队
		cust[id].st = wind[i].cur, cust[id].ed = cust[id].st + cust[id].t,
		wind[i].q.push(id), wind[i].cur += cust[id].t;

	while (1)
	{
		int mn = 1 << 30, mnid;
		for (int i = 0; i < n; i++) //最早的一个出队
			if (!wind[i].q.empty() && cust[wind[i].q.front()].ed < mn)
				mn = cust[wind[i].q.front()].ed, mnid = i;
		if (mn == 1 << 30) break;

		wind[mnid].q.pop();
		if (id < k) //加入一个剩下的人,如果还有的话
			cust[id].st = wind[mnid].cur, cust[id].ed = cust[id].st + cust[id].t,
			wind[mnid].q.push(id), wind[mnid].cur += cust[id].t, id++;
	}

	while (q--)
	{
		int x; scanf("%d", &x);
		if (cust[--x].st >= 17*60)
			printf("Sorry\n");
		else
			printf("%02d:%02d\n", cust[x].ed/60, cust[x].ed%60);
	}
	return 0;
}
上一篇: 下一篇:

我的博客

NoAlGo头像编程这件小事牵扯到太多的知识,很容易知其然而不知其所以然,但真正了不起的程序员对自己程序的每一个字节都了如指掌,要立足基础理论,努力提升自我的专业修养。

站内搜索

最新评论