Queueing at Bank (25)

最新推荐文章于 2024-12-15 11:19:17 发布

原创最新推荐文章于 2024-12-15 11:19:17 发布 · 285 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个银行排队系统的模拟实现，通过使用优先队列来计算顾客平均等待时间。具体包括输入顾客到达时间和处理时间，模拟顾客在不同窗口的服务过程，并最终输出所有被服务顾客的平均等待时间。

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

题目描述

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.

输入描述:

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.

输出描述:

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.

输入例子:

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

输出例子:

8.2

我的代码：

（使用优先队列）

#include<iostream>
#include<queue>
using namespace std;
struct Window
{
    int hh,mm,ss;
    Window(int h=8,int m=0,int s=0):hh(h),mm(m),ss(s){}
    bool operator<(const Window &a)const
    {
        if(hh!=a.hh) return hh>a.hh;
        else if(mm!=a.mm) return mm>a.mm;
        else return ss>a.ss;
    }
};
struct Customer
{
    int h,m,s,last;
    bool operator<(const Customer &a)const
    {
        if(h!=a.h) return h>a.h;
        else if(m!=a.m) return m>a.m;
        else return s>a.s;
    }
};
priority_queue<Window>bank;
priority_queue<Customer>cu;
int main()
{
    int n,m,i,x=0;
    cin>>n>>m;
    Window w;
    for(i=0;i<m;i++) bank.push(w);
    Customer cust;
    for(i=0;i<n;i++)
    {
        scanf("%d:%d:%d %d",&cust.h,&cust.m,&cust.s,&cust.last);
        cu.push(cust);
    }
    double sum=0;
    while(!cu.empty())
    {
        cust=cu.top();
        cu.pop();
        if(cust.h>17||(cust.h==17&&cust.m>0)||(cust.h==17&&cust.m==0&&cust.s>0)) break;
        x++;
        w=bank.top();
        bank.pop();
        if(cust.h<w.hh||(cust.h==w.hh&&cust.m<w.mm)||(cust.h==w.hh&&cust.m==w.mm&&cust.s<w.ss))
        {
            sum=sum+(w.hh-cust.h)*60.0+(w.mm-cust.m)+(w.ss-cust.s)/60.0;
            w.mm=w.mm+cust.last,w.hh=w.hh+w.mm/60,w.mm=w.mm%60;
        }
        else w.ss=cust.s,w.mm=(cust.m+cust.last)%60,w.hh=cust.h+(cust.m+cust.last)/60;
        bank.push(w);
    }
    printf("%.1f\n",sum/x);
    return 0;
}