pat 1014. Waiting in Line
来源:互联网 发布:mac qq怎么发离线文件 编辑:程序博客网 时间:2024/06/04 19:36
Suppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are:
The space inside the yellow line in front of each window is enough to contain a line with M customers. Hence when all the N lines are full, all the customers after (and including) the (NM+1)st one will have to wait in a line behind the yellow line.
Each customer will choose the shortest line to wait in when crossing the yellow line. If there are two or more lines with the same length, the customer will always choose the window with the smallest number.
Customer[i] will take T[i] minutes to have his/her transaction processed.
The first N customers are assumed to be served at 8:00am.
Now given the processing time of each customer, you are supposed to tell the exact time at which a customer has his/her business done.
For example, suppose that a bank has 2 windows and each window may have 2 custmers waiting inside the yellow line. There are 5 customers waiting with transactions taking 1, 2, 6, 4 and 3 minutes, respectively. At 08:00 in the morning, customer1 is served at window1 while customer2 is served at window2. Customer3 will wait in front of window1 and customer4 will wait in front of window2. Customer5 will wait behind the yellow line.
At 08:01, customer1 is done and customer5 enters the line in front of window1 since that line seems shorter now. Customer2 will leave at 08:02, customer4 at 08:06, customer3 at 08:07, and finally customer5 at 08:10.
Input
Each input file contains one test case. Each case starts with a line containing 4 positive integers: N (<=20, number of windows), M (<=10, the maximum capacity of each line inside the yellow line), K (<=1000, number of customers), and Q (<=1000, number of customer queries).
The next line contains K positive integers, which are the processing time of the K customers.
The last line contains Q positive integers, which represent the customers who are asking about the time they can have their transactions done. The customers are numbered from 1 to K.
Output
For each of the Q customers, print in one line the time at which his/her transaction is finished, in the format HH:MM where HH is in [08, 17] and MM is in [00, 59]. Note that since the bank is closed everyday after 17:00, for those customers who cannot be served before 17:00, you must output “Sorry” instead.
Sample Input
2 2 7 5
1 2 6 4 3 534 2
3 4 5 6 7
Sample Output
08:07
08:06
08:10
17:00
Sorry
模拟题,每次遍历所有窗口,找到将要走人的窗口,走人,在加入新的人。并更新当前走人窗口中的下一个开始任务的人的开始时间,直到窗口没人结束。注意的是开始时间大于等于17:00是SORRY而不是结束时间大于17:00。
#include<cstdio>#include<cstring>#include<queue>#include<algorithm>using namespace std;typedef struct{ int starttime; int needtime;}person;person p[1111];queue<int>window[22];int main(){ int n,m,k,q,i,j; scanf("%d%d%d%d",&n,&m,&k,&q); for (i=1;i<=k;i++) scanf("%d",&p[i].needtime); for (i=1;i<=n*m&&i<=k;i++) window[(i-1)%n+1].push(i); for (i=1;i<=n&&i<=k;i++) p[i].starttime=0; int now=n*m+1; while (true) { int time=9999999; bool f=true; for (i=1;i<=n;i++) { if (window[i].empty()) continue; f=false; int head=window[i].front(); if (time>p[head].starttime+p[head].needtime) time=p[head].starttime+p[head].needtime; } if (f) break; for (i=1;i<=n;i++) { if (window[i].empty()) continue; int head=window[i].front(); if (time==p[head].starttime+p[head].needtime) { window[i].pop(); if (now<=k) window[i].push(now++); if (window[i].empty()) continue; int t=window[i].front(); p[t].starttime=time; } } } for (i=0;i<q;i++) { int x; scanf("%d",&x); int st=p[x].starttime; int et=p[x].starttime+p[x].needtime; if (st>=540) printf("Sorry\n"); else printf("%02d:%02d\n",et/60+8,et%60); } return 0;}
- PAT 1014. Waiting in Line
- PAT 1014. Waiting in Line
- PAT 1014. Waiting in Line
- 【PAT】1014. Waiting in Line
- pat 1014. Waiting in Line
- [ZJU.PAT] 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)-PAT
- pat 1014. Waiting in Line (30)
- PAT 1014. Waiting in Line (30)
- PAT A 1014. Waiting in Line (30)
- PAT (Advanced) 1014. Waiting in Line (30)
- PAT 1014. Waiting in Line (30)
- PAT 1014. Waiting in Line (30)
- PAT 1014. Waiting in Line (30)
- 【PAT】1014. Waiting in Line (30)
- PAT 1014. Waiting in Line (30)
- 【PAT甲级】1014. Waiting in Line (30)
- PAT(A) - 1014. Waiting in Line (30)
- Ext.js学习心得二
- C语言程序设计-图书管理系统
- CPU使用情况
- 简单递归应用
- mysql数据库中存照片
- pat 1014. Waiting in Line
- 文件相关
- U-Mail邮件系统带您体验微信收发邮件
- 去除input选中时出现的蓝框
- Java的常用类
- saltstack 学习一 (安装)
- C语言程序设计-计算机设备管理
- 深度学习:识别图片中的电话号码(2)
- Idea 项sout一样添加自定义快捷输入