PAT甲级1014 Waiting in Line (30 分)

最新推荐文章于 2022-06-18 22:49:04 发布

weixin_43140251

最新推荐文章于 2022-06-18 22:49:04 发布

阅读量125

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT刷题记录

本文链接：https://blog.csdn.net/weixin_43140251/article/details/113664700

PAT刷题记录专栏收录该内容

15 篇文章

订阅专栏

该博客讨论了一种模拟银行窗口排队系统的方法，其中客户根据最短队列原则选择窗口，并考虑了每条队伍的最大容量。通过输入每个客户的处理时间和查询，算法能够精确预测客户完成交易的时间。当预测时间超过下午5点时，输出为'Sorry'。源代码实现了这一逻辑，并已通过所有测试用例，强调了关键点如开始时间限制和队伍人数限制的处理。

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

原题：

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 $(N M + 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 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, $customer_1$ is served at $window_1$ while $customer_2$ is served at $window_2$ . $Customer_3$ will wait in front of $window_1$ and $customer_4$ will wait in front of $window_2$ . $Customer_5$ will wait behind the yellow line.

At 08:01, $customer_1$ is done and $customer_5$ enters the line in front of $window_1$ since that line seems shorter now. $Customer_2$ will leave at 08:02, $customer_4$ at 08:06, $customer_3$ at 08:07, and finally $customer_5$ at 08:10.

Input Specification:

Each input file contains one test case. Each case starts with a line containing 4 positive integers: $N$ ( $≤20\le 20$ , number of windows), $M$ ( $≤10\le 10$ , the maximum capacity of each line inside the yellow line), $K$ ( $≤1000\le 1000$ , number of customers), and $Q$ ( $≤1000\le 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<iostream>
#include<queue>
using namespace std;
int n, m, k, q;
struct Person{
    int q;
    int st = -1;
    int nt;
    int ft = -1;
}person[1005];
queue<Person> que[21];
int main(){
    cin>>n>>m>>k>>q;
    for(int i = 1; i <= k; i ++){
        cin>>person[i].nt;
        person[i].q = i;
    }
    int tag = 0;
    int num = 1;
    int serverpeople = 0;
    while(tag <= 540){
        for(num; num <= k && serverpeople < m * n; num ++){
            int minque;
            int minlen = 15;
            for(int i = 0; i < n; i ++){
                if(que[i].size() < minlen){
                    minlen = que[i].size();
                    minque = i;
                }
            }
//            if(que[minque].size() <= m){
                que[minque].push(person[num]);
                serverpeople ++;
//            }
        }
        for(int i = 0; i < n; i ++){
            Person p = que[i].front();
            if(person[p.q].st == -1 && tag < 540){
                person[p.q].st = tag;
                person[p.q].ft = tag + person[p.q].nt;
            }
            person[p.q].nt --;
            if(person[p.q].nt == 0){
                que[i].pop();
                serverpeople --;
            }
            /*if(person[p.q].ft > 540){
                que[i].pop();
                person[p.q].ft = -1;
            }*/
        }
        tag ++;
    }
    for(int i = 0; i < q; i ++){
        int wq;
        cin>>wq;
        if(person[wq].ft == -1)
            cout<<"Sorry"<<endl;
        else{
            int hour, min;
            hour = person[wq].ft / 60 + 8;
            min = person[wq].ft % 60;
            if(hour < 10)
                cout<<"0"<<hour<<":";
            else
                cout<<hour<<":";
            if(min < 10)
                cout<<"0"<<min<<endl;
            else
                cout<<min<<endl;
        }
    }
}