• 1017 Queueing at Bank

    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 (≤104) - 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:

    1. 7 3
    2. 07:55:00 16
    3. 17:00:01 2
    4. 07:59:59 15
    5. 08:01:00 60
    6. 08:00:00 30
    7. 08:00:02 2
    8. 08:03:00 10

    Sample Output:

    8.2

    题目大意

    有K个窗口为客户办理业务，有N位客户需要办理业务，只要这位客户抵达时间早于等于17:00:00，就必须为其办理完业务，抵达晚于17:00:00的客户无需办理且不记录等待人数

    求 : 总等待时间/等待人数，结果保留一位小数

    思路

    window[z]记录窗口z的最后结束工作时间，

    所有窗口中最早结束的那个窗口记为当前时间

    总等待时间 = 该人开始办理业务时间 - 该人抵达时间

    C/C++ 

    1. #include
    2. using namespace std;
    3. int main()
    4. {
    5.     setint,int>> line; // 抵达时间 + 办理业务所需时间
    6.     int N,K,window[101]={0},nowTime=28800,waitSum=0,hh,mm,ss,work,sum;
    7.     
    8.     cin >> N >> K;
    9.     while (N--){
    10.         scanf("%d:%d:%d %d",&hh,&mm,&ss,&work);
    11.         sum = hh*3600+mm*60+ss;
    12.         work = min(work,60)*60;
    13.         if(sum<61201) line.insert({sum,work});
    14.     }
    15.  
    16.     for(pair<int,int> x:line){
    17.         int key = 0;
    18.         for(int z=1;z
    19.             if(window[z]
    20.                 key = z;
    21.             }
    22.         }
    23.         nowTime = max(window[key],nowTime);
    24.         if(nowTime<=x.first) window[key] = x.first+x.second;
    25.         else
    26.         {
    27.             waitSum += nowTime - x.first;
    28.             window[key] = nowTime + x.second;
    29.         }
    30.     }
    31.     
    32.     printf("%.1f",waitSum*1.0/(line.size()*60));
    33.     return 0;
    34. }

  • 相关阅读:
    自动化测试---即selenium
    Java诊断利器Arthas安装和使用
    通讯网关软件014——利用CommGate X2HTTP实现HTTP访问OPC Server
    1. MongoDB概览
    面试总结-Redis篇章(十二)——Redis是单线程的，为什么还那么快
    李宏毅深度学习--《Unsupervised Learning: Word Embedding》
    如何在linux系统下快速上手调试器gdb
    2022-08-11 学习日记（31st day）网络通信（网络编程）
    强化学习实战（一）—— 使用BaslineDQN学习飞船降落
    python基于PHP+MySQL高校资产管理系统
  • 原文地址：https://blog.csdn.net/daybreak_alonely/article/details/127669468