1014 Waiting in Line （30 point(s)）

最新推荐文章于 2024-10-10 18:30:56 发布

原创最新推荐文章于 2024-10-10 18:30:56 发布 · 231 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Pat甲级

Pat甲级专栏收录该内容

152 篇文章

订阅专栏

本文介绍了一个银行排队系统的模拟算法，通过优先级队列实现客户在多个窗口间的最优分配，确保每位顾客选择等待时间最短的队伍。考虑到银行每天17:00关门，对于无法在关门前进店的顾客，系统会输出'Sorry'。文章提供了完整的C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题解

说是编程题，但是感觉就是一道英语题。看题仔细点就简单了。。。

Each customer will choose the shortest line to wait in when crossing the yellow line.

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. （this does not include the person being served）

#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int MAXN = 1010;
const int MAXM = 21;
struct node {
	int window;
	int start;
	int finish;
	bool operator < (const node& rhs) const {
		return rhs.finish == finish ? window > rhs.window : finish > rhs.finish; 
	}
}cus[MAXN];
int t[MAXN], winLast[MAXM];
int n, m, k, q;
int main() {
	scanf("%d%d%d%d", &n, &m, &k, &q);
	for(int i = 1; i <= k; ++i) scanf("%d", &t[i]);
	int cnt = 0;
	priority_queue<node> p;
	for(int i = 1; i <= m && cnt < k; ++i) {
		for(int j = 1; j <= n && cnt < k; ++j) {
			++cnt; // 
			cus[cnt].window = j;
			cus[cnt].start = winLast[j];
			cus[cnt].finish = winLast[j] = cus[cnt].start + t[cnt];
			p.push(cus[cnt]);
		}
	}
	for(int i = cnt + 1; i <= k; ++i) {
		node u = p.top(); p.pop();
		int win = u.window;
		cus[i].window = win;
		cus[i].start = winLast[win];
		cus[i].finish = winLast[win] = cus[i].start + t[i];
		p.push(cus[i]);
	}
	for(int i = 0; i < q; ++i) {
		int query;
		scanf("%d", &query);
		node u = cus[query];
		if(u.start >= (17 - 8) * 60) printf("Sorry\n");
		else printf("%02d:%02d\n", u.finish / 60 + 8, u.finish % 60); 
	}
	return 0;
}