A1014. Waiting in Line (30)
来源:互联网 发布:广数980g76编程实例 编辑:程序博客网 时间:2024/06/16 22:33
1014. Waiting in Line (30)
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 Input2 2 7 51 2 6 4 3 534 23 4 5 6 7Sample Output
08:0708:0608:1017:00Sorry
#include<cstdio>#include<queue>#include<algorithm>using namespace std;const int init_time = 8 * 60;const int N = 25;const int maxn = 1010;int n, m, k, q;int begin_time[maxn], leave[maxn], service[maxn];int winlasttime[N]; //1 ~ n - 1窗口最后服务时间void tranction(){queue<int> q[N];int i = 1, win = 0;while(i <= n * m && i <= k){q[win % n].push(i);i++; win++;}while(1){int min_last_time = 100000000, x = -1;for(int j = 0; j < n ; ++j){if(!q[j].empty() && winlasttime[j] + service[q[j].front()] < min_last_time){x = j; min_last_time = winlasttime[j] + service[q[j].front()];}}if(x == -1) return ; //所有队空begin_time[q[x].front()] = winlasttime[x];winlasttime[x] += service[q[x].front()];leave[q[x].front()] = winlasttime[x];q[x].pop();if(i <= k) q[x].push(i++);}}int main(){freopen("1014.txt", "r", stdin);scanf("%d%d%d%d", &n, &m, &k, &q);fill(winlasttime, winlasttime + n, init_time);for(int i = 1; i <= k; ++i) scanf("%d", &service[i]);tranction();for(int i = 0; i < q; ++i){int query;scanf("%d", &query);if(begin_time[query] < 17 * 60){ //能17点之前服务的客户,打印其离开时间,可能会在17点以后,这是个坑点printf("%02d:%02d\n", leave[query] / 60, leave[query] %60);}else printf("Sorry\n");}return 0;}
- A1014. Waiting in Line (30)
- PAT甲级A1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014 Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- CPUFreq驱动随笔(一)
- 页面置换算法及磁盘调度算法
- yii2.0目录结构
- 【Luogu】 P1726 上白泽慧音
- 零基础学习wince开发-环境搭建
- A1014. Waiting in Line (30)
- HTTP协议详解
- 数据库范式那些事
- C++设计模式:职责链模式<初探>
- 圆弧的动画效果实现
- The POM for xxxx is missing, no dependency information available
- Java 获取耗时中文描述
- Excel操作帮助类
- JAVA 注释模板-开发规范