PAT(A) 1014 Waiting in Line (30 point(s)) C++ 题意理解-CSDN博客

本文链接：https://blog.csdn.net/Anpotan/article/details/119960852

题意理解：

可看做八点前所有的顾客都已等在银行门外，排队依次进入
for those customers who cannot be served before 17:00, you must output Sorry instead. 17点以前可开始被服务的输出服务结束的时间，服务结束时间可能晚于17点；17点后才轮到的输出Sorry

#include<cstdio>
#include<vector>
#include<climits>
using namespace std;

#define OPEN 8*60
#define CLOSE 17*60

int main(void){
    int N, M, K, Q;
    scanf("%d %d %d %d", &N, &M, &K, &Q);
    
    vector<int> pro(K+1);
    for(int i = 1; i <= K; i++)
        scanf("%d", &pro[i]);
    
    vector<int> cus(K+1);
    vector<vector<int>> line(N+1);
    int i;
    //初始黄线内第一排
    for(i = 1; i <= N && i <= K; i++){
        cus[i] = OPEN;
        line[i].push_back(cus[i] + pro[i]);
    }
    //初始黄线内第2至M排
    for(int j = 0; j < M-1 && i <= K; j++){
        for(int k = 1; k <= N && i <= K; k++){
            cus[i] =line[k][j];
            line[k].push_back(cus[i] + pro[i]);
            i++;
        }
    }
    //黄线内有顾客离开才能进入黄线排队
    for(i; i <= K; i++){
        int u, minn = INT_MAX;
        for(int j = 1; j <= N; j++){
            if(line[j][0] < minn){
                u = j;
                minn = line[j][0];
            }
        }
        cus[i] = line[u][M-1];
        line[u].erase(line[u].begin());
        line[u].push_back(cus[i] + pro[i]);
    }
    
    for(int j = 0; j < Q; j++){
        int q;
        scanf("%d", &q);
        if(cus[q] < CLOSE) printf("%02d:%02d\n", (cus[q]+pro[q])/60, (cus[q]+pro[q])%60);
        else printf("Sorry\n");
    }
    
    return 0;
}