1017. Queueing at Bank (25)

最新推荐文章于 2025-01-22 23:38:46 发布

puppet_pyt

最新推荐文章于 2025-01-22 23:38:46 发布

阅读量197

点赞数

分类专栏： pat甲级

本文链接：https://blog.csdn.net/puppet_pyt/article/details/70230553

版权

pat甲级专栏收录该内容

55 篇文章

订阅专栏

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

思路：对每位顾客一次处理，如果他来的比当前最早处理完的窗口时间还要早，那么计算他的等待时间，并且他的结束时间是最早处理完的时间加上他的处理时间,结束时间进入优先队列，如果来的晚那么可以直接开始，等待时间就为0；结束时间就是来的时间加上处理时间

#include <iostream>
#include <queue>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#define MAX 10005

using namespace std;

struct cust{
    int time;
    int cost;
}c[MAX];

bool cmp(const cust &a, const cust &b)
{
    return a.time < b.time;
}
int main()
{
    const int Start = 8*3600;
    const int End = 17*3600;
    int hh, mm, ss;
    int time, cost, totalwait, counter;
    int endtime;
    int n, k;
    priority_queue<int, vector<int>, greater<int> > windows;//优先队列，按处理时间完毕先后表示优先级，先处理完的放在顶端
    cin >> n >> k;
    for(int i=0; i<n; i++)
    {
        scanf("%d:%d:%d %d", &hh, &mm, &ss, &cost);
        time = hh*3600+mm*60+ss;
        c[i].time = time;
        c[i].cost = cost;
    }
    sort(c, c+n, cmp);
    totalwait = 0;
    counter = 0;
    for(int i=0; i<k; i++)//第一批人
    {
        if(c[counter].time < End)
        {
            if(c[counter].time < Start)//如果来的比8点还早那么需要等待
            {
                totalwait += Start-c[counter].time;//等待时间
                endtime = Start+c[counter].cost*60;//处理完的时间
            }
            else{
                endtime = c[counter].time+c[counter].cost*60;//比8点完则不需要等待
            }
            windows.push(endtime);
            counter++;
        }
    }
    for(int i=counter; i<n; i++)
    {
        if(c[counter].time > End)//如果顾客到达时间晚于结束时间则break掉
            break;
        if(windows.size() == k)
        {
            if(windows.top() <= c[counter].time)//当最早处理完的时间不大于下一位顾客到的时间，无需等待
            {
                windows.pop();
                endtime = c[counter].time+c[counter].cost*60;
                windows.push(endtime);
                counter++;
            }
            else{//否则则计算等待时间
                totalwait += windows.top() - c[counter].time;
                endtime = windows.top() + c[counter].cost*60;
                windows.pop();
                windows.push(endtime);
                counter++;
            }
        }
    }
    printf("%.1f\n", 1.0*totalwait/counter/60);
    return 0;
}