1017 Queueing at Bank
题目大意
和前几道类似,也是银行窗口排队,不过是需要计算等待时间,而且有可能提前到达,之后到达的不算。
算法思想
- 这道题没用模拟时间,用的排序,然后依次进行计算每个窗口的结束时间
- 结束时间最早的窗口会优先有空位,再把后面来的顾客进行排队,此时要修改这个窗口的结束时间,也就是加上该顾客的服务时间
- 有可能顾客不需要排队的情况,只需比较一下最早结束的窗口的结束时间和该顾客的到达时间,不需要等待也要修改窗口的结束时间
- 有个坑好像是,只要是17点前到达,哪怕服务到下班,也会给你做。
代码
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
struct customer
{
int hour=8, minute=0, second=0, setime;
};
bool cmp(customer a, customer b)//自定义比较函数
{
if (a.hour != b.hour)
return a.hour < b.hour;
else
{
if (a.minute != b.minute)
return a.minute < b.minute;
else
return a.second < b.second;
}
}
int least(vector<customer>w)//找到最早结束的窗口
{
customer sm = w[0];
int k = 0;
for (int i = 1; i < w.size(); i++)
{
if (cmp(w[i], sm))
{
sm = w[i];
k = i;
}
}
return k;
}
double wait(customer end, customer cust)//计算时间差
{
double wa = (end.hour - cust.hour) * 60 * 60 + (end.minute - cust.minute) * 60 + end.second - cust.second;
return wa/60;
}
void change(customer& win, customer ban)
{
if (win.minute + ban.setime >= 60)//更改当前窗口结束服务时间
{
win.hour++;
win.minute = (win.minute + ban.setime) % 60;
}
else
win.minute += ban.setime;
}
int main()
{
int n, k;
cin >> n >> k;
vector<customer>bank(n);
vector<customer>window(k);
for (int i = 0; i < n; i++)
{
string s;
cin >> s >> bank[i].setime;
sscanf(s.c_str(), "%d:%d:%d", &bank[i].hour, &bank[i].minute, &bank[i].second);
}
sort(bank.begin(), bank.end(), cmp);//按先来后到排序
int j = 0;
double waittime = 0;
int sum = 0;
for (int i = 0; i < n; i++)
{
if (bank[i].hour < 17 || (bank[i].hour == 17 && bank[i].minute == 0 && bank[i].second == 0))//下班前服务
{
sum++;
j = least(window);//找到最早结束的窗口
if (cmp(window[j], bank[i]))//不需要等待,直接赋值
{
window[j].hour = bank[i].hour;
window[j].minute = bank[i].minute;
window[j].second = bank[i].second;
change(window[j], bank[i]);
}
else//需要等待
{
waittime += wait(window[j], bank[i]);
change(window[j], bank[i]);
}
}
}
printf("%.1f", waittime / sum);
}