PAT甲级A1014. Waiting in Line (30)
来源:互联网 发布:热点软件 编辑:程序博客网 时间:2024/06/07 22:50
题目描述
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
题目解析
用队列来模拟排队,注意考虑K
代码
#include<iostream>#include<vector>#include<list>using namespace std;int main(){ int N, M, K, Q; cin >> N >> M >> K >> Q; vector<int> t(K, 0); for (int i = 0; i < K; ++i) cin >> t[i]; vector<int> que(Q, 0); for (int i = 0; i < Q; ++i) cin >> que[i]; vector<list<int> >wnd_list(N); vector<int>wnd_leave(N, 0); vector<int>customer_leave(K,0); vector<int>customer_start(K, 0); int cnt = 0; for (int i = 0; i < M; ++i)//初始化N个队列 { for (int j = 0; j < N; ++j) { if (cnt == K)//注意考虑K<N*M的情况 break; wnd_list[j].push_back(cnt); ++cnt; } if (cnt == K) break; } for (int i = 0; i < N&&i < K; ++i)//初始化wnd_leave { wnd_leave[i] = t[i]; } for (int p=0; p < K; ++p) { int min_w_l = 0;//找到最先空出来的窗口 for (int i = 1; i < N; ++i) { if (wnd_leave[i] < wnd_leave[min_w_l]&&wnd_leave[i]>0)//注意K<N的情况 min_w_l = i; } customer_leave[wnd_list[min_w_l].front()] = wnd_leave[min_w_l];//记录离开的人的离开时间 wnd_list[min_w_l].pop_front(); wnd_list[min_w_l].push_back(cnt++); if (wnd_list[min_w_l].front() < K)//记录开始的时间 customer_start[wnd_list[min_w_l].front()] = wnd_leave[min_w_l]; wnd_leave[min_w_l] += wnd_list[min_w_l].front() < K ? t[wnd_list[min_w_l].front()] : 1000000; } for (int i = 0; i < Q; ++i) { int cust = que[i]-1; if (customer_start[cust] > 539) cout << "Sorry" << endl; else printf_s("%02d:%02d\n", customer_leave[cust] / 60 + 8, customer_leave[cust] % 60); } system("pause"); return 0;}
- PAT甲级A1014. Waiting in Line (30)
- A1014. Waiting in Line (30)
- 【PAT甲级】1014. Waiting in Line (30)
- 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 甲级 1014. Waiting in Line
- [PAT-甲级]1014.Waiting in Line
- 1014. Waiting in Line (30)-PAT甲级真题(queue的应用)
- [PAT甲级]1014. Waiting in Line (30)(银行排队办理业务结束时间 队列的应用)
- [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)
- hdu 1024 Max Sum Plus Plus(m段最大子列和)
- 安装配置Hadoop
- 玛丽卡(spfa删边求最短路)
- 对称算法(计算机图形学)
- Linux grep命令详解
- PAT甲级A1014. Waiting in Line (30)
- 线段树--区间合并--HDU 1540
- redhat 软件包管理
- Collcition的作用及意义
- Spring Transaction属性之propagation
- 2015华为机试练习之合唱队
- Sql Server中GO的作用
- Android的SQLite应用
- linux下,在QT中如何导入第三方的库文件