zoukankan      html  css  js  c++  java
  • 1017. Queueing at Bank (25)

    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


     1 #include<stdio.h>
     2 #include<vector>
     3 #include<algorithm>
     4 using namespace std;
     5 struct cus
     6 {
     7     int arrive_time,cost;
     8 };
     9 struct win
    10 {
    11     win():win_time(8*60*60){}
    12     int win_time;
    13 };
    14 
    15 win wins[200];
    16 
    17 bool cmparrive(cus a,cus b)
    18 {
    19     return a.arrive_time < b.arrive_time;
    20 }
    21 int main()
    22 {
    23     int n,w_num,hh,mm,ss;
    24     cus ctem;
    25     vector<cus> vv;
    26     scanf("%d%d",&n,&w_num);
    27     for(int i = 0 ;i < n;++i)
    28     {
    29         scanf("%d:%d:%d%d",&hh,&mm,&ss,&ctem.cost);
    30         if(ctem.cost > 60)
    31             ctem.cost = 60;
    32         ctem.cost *= 60;
    33         ctem.arrive_time = hh*60*60 + mm*60 + ss;
    34         if(ctem.arrive_time <= 17 * 60 * 60)
    35             vv.push_back(ctem);
    36     }
    37     sort(vv.begin(),vv.end(),cmparrive);
    38     int cnt = 0;
    39     double sum = 0.0;
    40     n = vv.size();
    41     while(cnt < n)
    42     {
    43         int MIN = 99999999;
    44         int MINindex = -1;
    45         for(int i = 0 ;i < w_num;++i)
    46         {
    47             if(MIN > wins[i].win_time)
    48             {
    49                 MIN = wins[i].win_time;
    50                 MINindex = i;
    51             }
    52         }
    53         if(MIN > vv[cnt].arrive_time)
    54         {
    55             sum += (MIN - vv[cnt].arrive_time);
    56             wins[MINindex].win_time += vv[cnt].cost;
    57             ++cnt;
    58         }
    59         else
    60         {
    61             for(int i = 0 ;i < w_num;++i)
    62             {
    63                 if(vv[cnt].arrive_time >= wins[i].win_time)
    64                 {
    65                     MINindex = i;
    66                     break;
    67                 }
    68             }
    69             wins[MINindex].win_time = vv[cnt].arrive_time + vv[cnt].cost;
    70             ++ cnt;
    71         }
    72     }
    73     if(n == 0)
    74         printf("0.0
    ");
    75     else
    76         printf("%.1lf
    ",sum/60.0/n);
    77     return 0;
    78 }


  • 相关阅读:
    监听键盘弹出 隐藏
    状态栏 设置白色字体
    UITextField 属性详解
    支付宝集成SDK 报错
    UIWebView
    app上传 需要的icon
    百度云推送 pem
    百度地图
    info.plist 属性讲解
    静态库 动态库
  • 原文地址:https://www.cnblogs.com/xiaoyesoso/p/5178544.html
Copyright © 2011-2022 走看看