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.
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 customer 2 is served at window2. Customer 3 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 customer 5 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.

输入

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.

输出

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.

思路

题目意思是大概有N个窗口，没个窗口能最多排M个人。在早上8点一次性来了K个人，其中NM个人能依次排到窗口前，之后的人就在大厅外等。最后要算出每个人走的时候所对应的时间。
既然是排队，那么就用数据结构–队列实现窗口。首先先让NM个人依次排列到对应的窗口（每个人选择最短的）。之后我们考虑剩余人的请况。网上有的人以一分钟一分钟遍历，其实没有必要，我们可以求当前正在被服务的那个顾客剩余时间为多少，取一个剩余时间最短的（假设是t分钟），让时钟向后走t分钟，此时只有这个客户被服务完了，而其他窗口还依旧正在被服务（因此这些正在被服务的剩余时间应该减去t）。在这种情况下，只要将剩余人依次加入到对应队列即可。
由于超过（或等于）17点的人无法被服务，所以我存的时间为该顾客被服务的时间，方便判断，而最后答案只需要加上他们请求的时间即可。
废话少说，上代码。

代码

#include<iostream>
#include<cstdio>
#include<stdlib.h>
#include<queue>
#include<vector>
using namespace std;
#define INF 10000000
int times[1100];
int ans[1100];
int last[1100];
queue<int> server[30];
int main()
{
	int N, M, K, Q;
	cin >> N >> M >> K >> Q;
	for (int i = 1; i <= K; i++)
	{
		cin >> times[i];
		last[i] = times[i];
	}
	int start = 480;
	int now = 1;
	for (int i = 0; i < M; i++)
	{
		for (int j = 0; j < N; j++)
		{
			server[j].push(now);
			ans[now] = start;
			now++;
			if (now > K)
			{
				break;
			}
		}
		if (now > K)
		{
			break;
		}
	}
	while(1)
	{
		if (now > K)
		{
			break;
		}
		int mmin = INF;
		int cur = -1;
		for (int j = 0; j < N; j++)
		{
		
			if (last[server[j].front()] < mmin)
			{
				mmin = last[server[j].front()];
				cur = j;
			}
		}
		start += mmin;
		for (int j = 0; j < N; j++)
		{
			last[server[j].front()] -= mmin;
		}
		server[cur].pop();
		ans[server[cur].front()] = start;
		server[cur].push(now);
		now++;
	}
	for (int i = 0; i < N; i++)
	{
		int t = start;
		while (!server[i].empty())
		{
			t += last[server[i].front()];
			last[server[i].front()] = 0;
			server[i].pop();
			if (!server[i].empty())
			{
				ans[server[i].front()] = t;
			}
		}
	}
	for (int i = 0; i < Q; i++)
	{
		int temp;
		cin >> temp;
		if (ans[temp] < 1020)
		{
			printf("%02d:%02d\n", (ans[temp]+times[temp]) / 60, (ans[temp] + times[temp]) % 60);
		}
		else
		{
			printf("Sorry\n");
		}
	}
}