1017. Queueing at Bank (25)
来源:互联网 发布:mac的caj阅读器 编辑:程序博客网 时间:2024/06/07 03:16
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 307:55:00 1617:00:01 207:59:59 1508:01:00 6008:00:00 3008:00:02 208:03:00 10Sample Output:
8.2
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;struct node{ int h,m,s; int pross; int sumSec;}tim[11000];int que[11000];int cmp(node a, node b){ return a.sumSec < b.sumSec;}int findMinque(int m){ int M = 9999999; int u = 0; for(int i= 0; i < m; i++) { if(que[i] < M) { M = que[i]; u = i; } } return u;}int main(){ int n,m; scanf("%d%d", &n, &m); for( int i = 0; i < n; i++) { scanf("%d:%d:%d%d",&tim[i].h,&tim[i].m,&tim[i].s,&tim[i].pross); tim[i].sumSec = tim[i].h*3600+tim[i].m*60+tim[i].s; } sort(tim, tim+n, cmp); memset(que, 0, sizeof(que)); int sum = 0; int eightSec = 8*60*60; int nightfiveSec = 17*60*60; int ending = 0; for(int i =0; i<m; i++) { que[i] = eightSec; } int num = 0; for( int i= 0; i < n; i++) { if(tim[i].sumSec > nightfiveSec) break; int bestque = findMinque(m); if(que[bestque] <= tim[i].sumSec) { que[bestque] = tim[i].sumSec + tim[i].pross*60; } else { sum += (que[bestque] - tim[i].sumSec); que[bestque] += tim[i].pross*60; } num++; } printf("%.1f\n",sum*1.0/(num*60));}
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- 1017. Queueing at Bank (25)
- android RecyclerView一步步打造分组效果、类似QQ分组、折叠菜单、分组效果(一)
- Toolbar使用注意事项与setContentView的调用顺序
- hive启动异常:Cannot create directory /tmp/hive/。。。Name node is in safe mode.
- LeetCode-33-Search in Rotated Sorted Array 水题
- 欢聚时代2017校招笔试题目(JAVA基础类)A卷--7
- 1017. Queueing at Bank (25)
- 百行go代码构建p2p聊天室
- MVVM和RAC介绍
- 从URDF到KDL(C++&Python)
- Redux-API
- Java内部类
- mybatis内的一些区别
- 最大类间方差法
- cudnn 免登陆下载