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 10Sample Output:
8.2
#include <iostream>
#include <algorithm>
using namespace std;
///
//
//has a buggggggg
//bug ishere ::those who comes later than 17:00 will not beserviced,excluding those whose start service time
// is later than 17:00
///
const int SIZE =10004;
const int NUM =102;
const int START = 8*3600;
const int END =17*3600;
struct Iterm{
int last;
int time;
// void display();
};
/*
void Iterm::display(){
printf("%02d:%02d:%02d %d\n",hour,min,sec,last);
}
*/
Iterm persons[SIZE];
int leave[NUM];
bool cmp(const Iterm &it1,const Iterm &it2){
return it1.time < it2.time ;
}
/*
void display(Iterm per[],int n){
for(int i=0;i<n;i++)
per[i].display();
}
*/
int main()
{
int N,K;
// freopen("test.txt","r",stdin);
scanf("%d%d",&N,&K);
for(int i=0;i<N;i++){
int hour,min,sec,last;
scanf("%02d:%02d:%02d %d",&hour,&min,&sec,&last);
persons[i].last = last*60;
persons[i].time = (hour*60+min)*60+sec;
}
sort(persons,persons+N,cmp);
// display(persons,N);
int j,count=0;
long long total_time=0;
for(j=0;j<N&&j<K;j++){ //distribute first K customers
int time = persons[j].time;
if(time <= END){
if(time < START){
total_time += START - time;
leave[j] = START+persons[j].last;
}else{
leave[j] = time +persons[j].last;
}
count++;
}else
goto LABEL;
}
for(;j<N;j++){ //distribute remaining ones accorting to previous leave time
int mini = leave[0],index=0;
for(int k=1;k<K;k++)
if(mini > leave[k]){
mini = leave[k];
index =k;
}
int time = persons[j].time;
if(time <=END){ //it is time<=END not leave[index] <=end && time <=end
if(leave[index] > time){
total_time += leave[index] - time;
leave[index] += persons[j].last;
}else
leave[index] =time + persons[j].last;
count++;
}else
break;
}
LABEL: if(count){
double average = total_time*1.0/count/60;
printf("%.1lf\n",average);
}else
printf("0.0\n");
// fclose(stdin);
return 0;
}