PAT甲级1017

最新推荐文章于 2025-01-22 23:38:46 发布

原创最新推荐文章于 2025-01-22 23:38:46 发布 · 463 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #C++程序设计 #程序设计 #算法

PAT 专栏收录该内容

200 篇文章

订阅专栏

本文介绍了一个银行排队模拟系统的实现细节，该系统通过模拟顾客在银行的排队情况来计算平均等待时间。采用优先队列和时间戳的方式进行高效计算。

1017. Queueing at Bank (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wait in line behind the yellow line, until it is his/her turn to be served and there is a window available. It is assumed that no window can be occupied by a single customer for more than 1 hour.

Now given the arriving time T and the processing time P of each customer, you are supposed to tell the average waiting time of all the customers.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 numbers: N (<=10000) - the total number of customers, and K (<=100) - the number of windows. Then N lines follow, each contains 2 times: HH:MM:SS - the arriving time, and P - the processing time in minutes of a customer. Here HH is in the range [00, 23], MM and SS are both in [00, 59]. It is assumed that no two customers arrives at the same time.

Notice that the bank opens from 08:00 to 17:00. Anyone arrives early will have to wait in line till 08:00, and anyone comes too late (at or after 17:00:01) will not be served nor counted into the average.

Output Specification:

For each test case, print in one line the average waiting time of all the customers, in minutes and accurate up to 1 decimal place.

Sample Input:

7 3
07:55:00 16
17:00:01 2
07:59:59 15
08:01:00 60
08:00:00 30
08:00:02 2
08:03:00 10

Sample Output:

8.2

#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 10000 + 10;
const int maxk = 100 + 10;
int N, K;
int startTime = 8 * 60 * 60;
int endTime = 17 * 60 * 60;//按秒来算
int lastTime[maxk];//保存每个窗口上次顾客完成事务的时间
struct customer
{
	int id;
	int hh, mm, ss;
	int processtime;//按分钟输入,但直接换算成秒
	int donetime;//按秒来计
	int timeToInt()
	{
		return hh * 60 * 60 + mm * 60 + ss;//换算成秒
	}
	customer():donetime(-1){}
}customers[maxn];
struct compare
{
	bool operator()(customer c1, customer c2)
	{
		if (c1.hh != c2.hh)
			return c1.hh > c2.hh;
		else if (c1.mm != c2.mm)
			return c1.mm > c2.mm;
		else
			return c1.ss > c2.ss;
	}
};
priority_queue<customer, vector<customer>, compare>Q;
int main()
{
	fill(lastTime, lastTime + maxk, startTime);
	scanf("%d%d", &N, &K);
	for (int i = 0; i < N; i++)
	{
		scanf("%d:%d:%d %d", &customers[i].hh, &customers[i].mm, 
			&customers[i].ss, &customers[i].processtime);
		customers[i].processtime *= 60;
		customers[i].id = i;
		Q.push(customers[i]);
	}
	int minLastTime = 1000000000,window;
	while (!Q.empty())
	{
		customer temp = Q.top();
		int arrivetime = temp.timeToInt();
		int id = temp.id;
		minLastTime = 1000000000;//这里注意更新一下
		for (int i = 0; i < K; i++)
		{
			if (minLastTime > lastTime[i])
			{
				minLastTime = lastTime[i];
				window = i;
			}
		}
		if (arrivetime <= endTime)
		{
			customers[id].donetime = max(minLastTime, arrivetime) + customers[id].processtime;
			lastTime[window] = customers[id].donetime;
			//printf("%02d:%02d:%02d\n", lastTime[window] / 3600, (lastTime[window] / 60) % 60, lastTime[window] % 60);
		}
		Q.pop();
	}
	int waitingtime = 0;
	int countw = 0;
	for (int i = 0; i < N; i++)
	{
		if (customers[i].donetime != -1)
		{
			waitingtime += customers[i].donetime - customers[i].processtime - customers[i].timeToInt();
			countw++;
		}
	}
	printf("%.1f\n", (double(waitingtime) / 60) / countw);
	return 0;
}