PAT (Advanced Level) Practice 1017 Queueing at Bank

记一个坑,银行上午8点到下午5点关门,我的认知是:5点以后来或者5点后还不能得到服务的人要从总人数里删去。然而,这道题它认为5点前来的人都计入总的服务了的人数 ,哪怕你等到5点后才得到服务,但是5点后来的就不行。

#include <iostream>
#include  <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
struct Person{
    string arrive;
    int h,m,s,last;
    Person(){}
    Person(string arrive,int last){
        this->arrive = arrive;
        this->last = last;
        sscanf(arrive.c_str(),"%d:%d:%d",&h,&m,&s);
    }
};
vector<Person> v;
int window[101]={0};
int n,k;
int getwin(){
    int min = window[0];
    int index = 0;
    for(int i=1;i<k;i++){
        if(window[i] < min){
            index = i;
            min = window[i];
        }
    }
    return index;
}
bool cmp(Person p1,Person p2){
    return p1.arrive <p2.arrive;
}
int main()
{
    scanf("%d%d",&n,&k);
    string arrive;
    int last;
    for(int i=0;i<n;i++){
        cin>>arrive>>last;
        if(last > 60) last = 60;
        v.push_back(Person(arrive,last));
    }
    for(int i=0;i<k;i++)
        window[i] = 3600*8;

    sort(v.begin(),v.end(),cmp);
    int index = 0;
    float acc = 0;//acumulate time
    int server = n;
    while(index < n){
        int win = getwin();
        int arriveTime = 3600*v[index].h+60*v[index].m+v[index].s;//start from 00:00:00
        if(arriveTime >3600*(12+5)){
            server--;//超过时间段,服务人数减一
        }else if(window[win] < arriveTime){
            window[win]  = arriveTime+v[index].last*60;
        }else{
            acc+= window[win] - arriveTime;
            window[win] += v[index].last*60;
        }
        index++;
    }
    if(server != 0)
        printf("%.1f\n",acc/60/server);
    else
        printf("0.0\n");
    return 0;
}

 

Queueing theory is a mathematical study of waiting lines or queues that arise in various real-life scenarios, such as customer service, traffic congestion, hospital emergency rooms, and telecommunications networks. Basic queueing theory involves the following concepts: 1. Arrival Process: This is the process of customers arriving at the queue. The arrival process can be modeled using different distributions, such as Poisson or exponential. 2. Service Process: This is the process of serving customers in the queue. The service process can also be modeled using different distributions, such as Poisson or exponential. 3. Queue Length: This is the number of customers waiting in the queue at any given time. 4. Queue Occupancy: This is the proportion of time that the server is busy serving customers. 5. System Capacity: This is the maximum number of customers that the system can handle at any given time. 6. Utilization: This is the proportion of time that the server is busy serving customers compared to the total time. 7. Waiting Time: This is the time that a customer spends waiting in the queue before being served. 8. Service Time: This is the time that a customer spends being served by the server. 9. Queueing Models: There are different queueing models that can be used to analyze queueing systems, such as the M/M/1 model, M/M/c model, M/G/1 model, and M/D/1 model. 10. Performance Measures: Different performance measures can be used to evaluate queueing systems, such as average waiting time, average queue length, and system throughput.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值