PAT-A-1017. Queueing at Bank (25)
来源:互联网 发布:淘宝香云纱 编辑:程序博客网 时间:2024/06/03 00:04
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<vector>#include<algorithm>using namespace std;const int maxn = 10010;const int maxw = 110;const int inf = 1000000000;struct customer{ int atime, stime;}newc;vector<customer> c;int endtime[maxw] = { 0 };int convert(int hh, int mm, int ss){ return hh * 3600 + mm * 60 + ss;}int cmp(customer a, customer b){ return a.atime < b.atime;}int main(){ int n, w; cin >> n >> w; int ed = convert(17, 0, 0); int st = convert(8, 0, 0); for (int i = 0; i < w; i++) { endtime[i] = st; } int hh, mm, ss, stime; for (int i = 0; i < n; i++) { //scanf_s("%d:%d:%d %d", &hh, &mm, &ss, &stime); scanf("%d:%d:%d %d", &hh, &mm, &ss, &stime); int time = convert(hh, mm, ss); if (time>ed) continue; newc.atime = time; newc.stime = stime*60<=3600?stime*60:3600; c.push_back(newc); } sort(c.begin(), c.end(), cmp); int mintime = inf; double tot = 0; int num = c.size(); int win; for (int i = 0; i < num; i++) { mintime = inf; win = -1; for (int j = 0; j < w; j++) { if (endtime[j] < mintime) { mintime = endtime[j]; win = j; } } if (c[i].atime>endtime[win]) { endtime[win] = c[i].atime + c[i].stime; } else { tot = tot + endtime[win] - c[i].atime; endtime[win] += c[i].stime; } } if (num == 0) cout << "0.0" << endl; else { printf("%.1f\n", tot / 60 / num); } system("pause"); return 0;}
- PAT A 1017.Queueing at Bank (25)
- PAT-A-1017. Queueing at Bank (25)
- pat 1017. Queueing at Bank (25)
- pat 1017. Queueing at Bank (25)
- 【PAT】1017. Queueing at Bank (25)
- PAT 1017. Queueing at Bank (25)
- PAT (Advanced) 1017. Queueing at Bank (25)
- PAT 1017. Queueing at Bank (25)
- PAT 1017. Queueing at Bank (25)
- PAT 1017. Queueing at Bank (25)
- PAT 1017. Queueing at Bank (25)
- 【PAT】1017. Queueing at Bank (25)
- PAT 1017. Queueing at Bank (25)
- 【PAT甲级】1017. Queueing at Bank (25)
- PAT甲级1017. Queueing at Bank (25)
- PAT 1017. Queueing at Bank (25)
- PAT甲级 1017. Queueing at Bank (25)
- PAT 甲级 1017. Queueing at Bank (25)
- Codeforces 557D
- event的使用例子
- 如何往Github上提交项目(二)—SSH方式
- bzoj 1016: [JSOI2008]最小生成树计数
- C#窗口控件大小随窗口大小而改变
- PAT-A-1017. Queueing at Bank (25)
- 整除个数
- 单例模式类型(一)
- 标签入门
- 方法(打印m行n列)
- 在IBM bluemix公有云上部署容器
- 微信小程序快速开发:视频指导版
- static 使用
- Go RPC