PAT甲级真题 1017 Queueing at Bank (25分) C++实现 (对比1014 Waiting in Line，不要思维定式)

题目

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

思路

PAT甲级真题 1014 Waiting in Line (30分) 和本题看似挺像，但千万不能受思维定式影响。有以下差别：

1. 前者顾客一个紧接一个接受服务；本题一些窗口可能有“空窗期”，故需要独立记录每个窗口的当前时间。
2. 前者17：00以后轮上的顾客不再对其服务；本题是只要在17：00前排上队，哪怕轮到他时已经过了17：00，都要为其服务。
3. 前者每个窗口前有个队列；本题每个窗口前只有1人，即最近加入的人，故无需再额外存储窗口顾客信息。

一开始按和1014题类似的思路，踩了很多坑，后来参考柳神的方法，修修补补，优化代码，发现最后越来越像柳神的代码了…柳神代码：1017. Queueing at Bank (25)-PAT甲级真题（模拟）

思路是，用vector存储等待顾客信息（晚于17：00的不再考虑），将HH:MM:SS格式的到达时间转为秒数，按时间先后排序。

初始化每个窗口的当前时间是8：00，将顾客按顺序加入当前时间最小的窗口，更新该窗口的当前时间。若顾客来的早于当前时间，则累加顾客等待时间，并将当前窗口时间加上为顾客服务时间；若顾客来的晚于当前时间，则只需将当前窗口时间修改为顾客到来时间+顾客服务时间。

代码

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct C{  //顾客信息
    int arr;  //到达时间
    float dur;  //所需时间
};

bool cmp(C c1, C c2){
    return c1.arr < c2.arr;
}

int main(){
    int n, k;
    cin >> n >> k;
    vector<C> wait;
    for (int i=0; i<n; i++){
        int h, m, s;       
        float dur;
        scanf("%d:%d:%d %f", &h, &m, &s, &dur);
        int arr = 3600 * h + 60 * m + s;  //时间统一转换为秒
        if (arr <= 61200){  //3600 * 17 
            wait.push_back({arr, dur * 60});  //加入早于17:00到达的顾客
        } 
    }
    int len = wait.size();
    sort(wait.begin(), wait.end(), cmp);

    //处理过程
    float sum = 0;  //总等待时间
    vector<int> window(k, 28800);  //3600 * 8，每个窗口上个顾客结束时间
    for (int i=0; i<len; i++){
        //找出当前结束时间最早的窗口
        int minT = window[0];
        int minI = 0;
        for (int j=1; j<k; j++) {
            int t = window[j];
            if (t < minT){
                minT = t;
                minI = j;
            }
        }
        if (window[minI]==minT){
            if (wait[i].arr < window[minI]){  //若顾客到的比上个结束时间早
                sum += (window[minI] - wait[i].arr);
                window[minI] += wait[i].dur;
            }
            else {
                window[minI] = wait[i].arr + wait[i].dur;
            }
        }
    }
    if (len==0){
        printf("0.0\n");
        return 0;
    }
    else {
        printf("%.1f\n", sum / len / 60.0);
    }

    return 0;
}