PTA甲级 1014 Waiting in Line (C++)

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.
• $Custome{r}_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, $custome{r}_1$ is served at $windo{w}_1$ while $custome{r}_2$ is served at $windo{w}_2$. $Custome{r}_3$ will wait in front of $windo{w}_1$ and $custome{r}_4$ will wait in front of $windo{w}_2$. $Custome{r}_5$ will wait behind the yellow line.

At 08:01, $custome{r}_1$ is done and $custome{r}_5$ enters the line in front of $windo{w}_1$ since that line seems shorter now. $Custome{r}_2$
will leave at 08:02, $custome{r}_4$ at 08:06, $custome{r}_3$ at 08:07, and finally $custome{r}_5$ at 08:10.

Input Specification:

Each input file contains one test case. Each case starts with a line containing 4 positive integers: $N$ ($\le 20$, number of windows), $M$ ($\le 10$, the maximum capacity of each line inside the yellow line), $K$ ($\le 1000$, number of customers), and $Q$ ($\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

Caution:

需要注意的是如果一个顾客在17:00之前开始处理业务，那么会一直处理完，不会在17:00被中止，这是导致我第一次没有AC的主要原因。

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-12 10:08:20
// All rights reserved.

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int main(){
    int n, m, k, q;
    // n 是柜台数，m 是每个柜台前可以容纳的等待顾客数，k 是顾客数，q 是询问的顾客数 

    scanf("%d %d %d %d", &n, &m, &k, &q);
    int hour = 8, minute = 0;

    vector<queue<vector<int>>> bank(n);
    queue<int> waiting; // int 表示顾客编号
    vector<vector<int>> customers(k, vector<int>(3, -1)); // [0] 表示需要服务的时间，[1] 表示结束服务的小时，[2] 表示结束服务的分钟

    for(int i = 0; i < k; ++i) scanf("%d", &customers[i][0]);

    int nowAt = 0; // 安排 8 点钟的时候柜台的顾客分布

    for(int i = 0; i < min(k, m * n); ++i){
        if(nowAt == n) nowAt = 0;

        bank[nowAt].push({i + 1, customers[i][0]});

        nowAt++;
    }

    if(k > n * m){
        for(int i = n * m; i < k; ++i) waiting.push(i + 1);
    }

    while(true){
        if(hour == 17){
            for(int i = 0; i < n; ++i){
                if(!bank[i].empty()){
                    int cus = bank[i].front()[0];
                    customers[cus - 1][1] = 17;
                    customers[cus - 1][2] = minute + bank[i].front()[1];
                }
            }

            break;
        }

        for(int i = 0; i < n; ++i){
            if(!bank[i].empty()){
                if(bank[i].front()[1] == 0){
                    int customer = bank[i].front()[0];

                    customers[customer - 1][1] = hour;
                    customers[customer - 1][2] = minute;
                    bank[i].pop();
                    
                    // 处理好出队的这位后看还有没有正在等待的顾客，有的话入队，这个时候需要考虑挑选最小的柜台编号入队么？
                    // 不用，因为我们保证了只要有人还在等待，那么每个柜台前一定是满的，并且我们是每一分钟都是从小到大遍历柜台，
                    // 那么当我们遍历到 i 柜台发现有出队后，之前的 i - 1 个柜台一定是满的
                    if(!waiting.empty()){
                        int customer = waiting.front();

                        waiting.pop();

                        bank[i].push({customer, customers[customer - 1][0]});
                        
                    }

                    if(!bank[i].empty()) bank[i].front()[1]--;
                }

                else bank[i].front()[1]--;
            }
        }

        hour = (minute == 59 ? hour + 1 : hour);
        minute = (minute == 59 ? 0 : minute + 1);
    }

    int toAsk = 0;
    for(int i = 0; i < q; ++i){
        scanf("%d", &toAsk);

        if(customers[toAsk - 1][1] > 0) printf("%02d:%02d\n", customers[toAsk - 1][1], customers[toAsk - 1][2]);
        else printf("Sorry\n");
    }

    return 0;
}