PAT甲级1014
2017-02-08 22:38
253 查看
1014. Waiting in Line (30)
时间限制400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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
#include<cstdio> #include<queue> #include<algorithm> using namespace std; const int maxn = 22; const int maxk = 1000 + 10; int N, M, K, Q; int nowTime = 0; int CloseTime = (17 - 8) * 60; struct customer { int id; int processtime; int donetime; customer():donetime(-1){} }customers[maxk]; queue<customer> line[maxn],behindQueue; int lastTime[maxn] = { 0 }; int main() { scanf("%d%d%d%d", &N, &M, &K, &Q);//注意N、M的意义 int capacity = N*M; for (int i = 1; i <= K; i++) { scanf("%d", &customers[i].processtime); customers[i].id = i; if (i <= capacity) { line[(i - 1) % N + 1].push(customers[i]); } else behindQueue.push(customers[i]);//排队 } int countC = K; while (nowTime < CloseTime&&countC)//模拟时间流动,每分钟检查一次有不有完成的 { nowTime++; for (int i = 1; i <= N; i++) { if (!line[i].empty()) { int donetime = line[i].front().processtime + lastTime[i]; int id = line[i].front().id; if ((donetime>CloseTime||donetime == nowTime)&&lastTime[i]<nowTime) { customers[id].donetime = donetime; lastTime[i] = donetime; line[i].pop(); countC--; if (behindQueue.size()) { line[i].push(behindQueue.front()); behindQueue.pop(); } } else if (lastTime[i] >= nowTime) { line[i].pop(); countC--; if (behindQueue.size()) { line[i].push(behindQueue.front()); behindQueue.pop(); } } } } } int query; for (int i = 0; i < Q; i++) { scanf("%d", &query); if (customers[query].donetime != -1) printf("%02d:%02d\n", 8 + customers[query].donetime / 60, customers[query].donetime % 60); else printf("Sorry\n"); } }
相关文章推荐
- 使用C++实现JNI接口需要注意的事项
- 浅析时钟向量算法
- 关于指针的一些事情
- c++ primer 第五版 笔记前言
- share_ptr的几个注意点
- 书评:《算法之美( Algorithms to Live By )》
- 动易2006序列号破解算法公布
- C#递归算法之分而治之策略
- Ruby实现的矩阵连乘算法
- C#插入法排序算法实例分析
- C#算法之大牛生小牛的问题高效解决方法
- Lua中调用C++函数示例
- Lua教程(一):在C++中嵌入Lua脚本
- Lua教程(二):C++和Lua相互传递数据示例
- C#算法函数:获取一个字符串中的最大长度的数字
- 超大数据量存储常用数据库分表分库算法总结
- C#数据结构与算法揭秘二
- C#冒泡法排序算法实例分析
- 算法练习之从String.indexOf的模拟实现开始
- C#算法之关于大牛生小牛的问题