PAT (Advanced Level) Practice 1017 Queueing at Bank(Python)

class Customer:
    def __init__(self, coming, cost):
        self.coming = coming  # 到来时间
        self.cost = cost  # 花费时间
        self.start = 0  # 开始服务时间

    def get_difference(self):
        return self.start - self.coming


def main():
    line = input().strip().split()
    n, k = int(line[0]), int(line[1])
    queue = []
    for i in range(n):
        line = input().strip().split()
        line[0] = line[0].split(':')
        coming = int(line[0][0]) * 3600 + int(line[0][1]) * 60 + int(line[0][2])
        if coming > 61200:
            continue
        cost = min(int(line[1]), 60) * 60
        queue.append(Customer(coming, cost))
    queue = sorted(queue, key=lambda x: x.coming)
    end_times = [28800 for _ in range(k)]  # 结束时间
    # 处理顾客业务
    for i in range(len(queue)):
        queue[i].start = max(min(end_times), queue[i].coming)
        t = end_times.index(min(end_times))  # 结束服务的窗口
        end_times[t] = queue[i].start + queue[i].cost  # 修改结束时间
    # 计算平均时间
    sum_time = 0.0
    for i in range(len(queue)):
        sum_time += queue[i].get_difference()
    print('0.0') if sum_time == 0 else print('%.1f' % (sum_time / len(queue) / 60), end='')


if __name__ == '__main__':
    main()

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 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、付费专栏及课程。

余额充值