1014. Waiting in Line (30) PAT甲级刷题
2018-02-08 01:03
344 查看
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 customer2is 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.InputEach 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.OutputFor 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
思路:用list数组模拟所有窗口队列,某个人的交易完成时间等于他前面排队的人的交易时间加上该队已经处理完的所有交易时间再加上他自己的时间。注意17:00前排到队的都能处理,这里就不能算上自己的时间了。
#include <iostream>
#include <stdio.h>
#include <list>
using namespace std;
int main()
{
int n,m,k,q,tm,i=1;
int req[1001];
cin>>n>>
4000
m>>k>>q;
list<int> windows[21];
int ans[1001] = {0};
int time_pop[21] = {0};
for(;i<=n*m&&i<=k;++i){
cin>>tm;
req[i] = tm;
int i_ = (i-1)%n;
windows[i_].push_back(tm);
for(auto j=windows[i_].begin();j!=windows[i_].end();++j){
ans[i] += *j;
}
}
for(;i<=k;++i){
int min_ = 1000000;
int index = 0;
for(int j=0;j<n;++j){
if(*(windows[j].begin())<min_){
min_ = *windows[j].begin();
index = j;
}
}
for(int k=0;k<n;++k){
*(windows[k].begin()) -= min_;
time_pop[k] += min_;
}
windows[index].pop_front();
cin>>tm;
req[i] = tm;
windows[index].push_back(tm);
for(auto it=windows[index].begin();it!=windows[index].end();++it)
ans[i] += *it;
ans[i] += time_pop[index];
}
int no,h,mi;
while(q--){
cin>>no;
mi = ans[no];
if(mi-req[no]>=540)
cout<<"Sorry"<<endl;
else{
h = mi/60;
mi %= 60;
printf("%02d:%02d\n",h+8,mi);
}
}
return 0;
}
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 customer2is 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.InputEach 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.OutputFor 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 7Sample Output
08:07 08:06 08:10 17:00Sorry
思路:用list数组模拟所有窗口队列,某个人的交易完成时间等于他前面排队的人的交易时间加上该队已经处理完的所有交易时间再加上他自己的时间。注意17:00前排到队的都能处理,这里就不能算上自己的时间了。
#include <iostream>
#include <stdio.h>
#include <list>
using namespace std;
int main()
{
int n,m,k,q,tm,i=1;
int req[1001];
cin>>n>>
4000
m>>k>>q;
list<int> windows[21];
int ans[1001] = {0};
int time_pop[21] = {0};
for(;i<=n*m&&i<=k;++i){
cin>>tm;
req[i] = tm;
int i_ = (i-1)%n;
windows[i_].push_back(tm);
for(auto j=windows[i_].begin();j!=windows[i_].end();++j){
ans[i] += *j;
}
}
for(;i<=k;++i){
int min_ = 1000000;
int index = 0;
for(int j=0;j<n;++j){
if(*(windows[j].begin())<min_){
min_ = *windows[j].begin();
index = j;
}
}
for(int k=0;k<n;++k){
*(windows[k].begin()) -= min_;
time_pop[k] += min_;
}
windows[index].pop_front();
cin>>tm;
req[i] = tm;
windows[index].push_back(tm);
for(auto it=windows[index].begin();it!=windows[index].end();++it)
ans[i] += *it;
ans[i] += time_pop[index];
}
int no,h,mi;
while(q--){
cin>>no;
mi = ans[no];
if(mi-req[no]>=540)
cout<<"Sorry"<<endl;
else{
h = mi/60;
mi %= 60;
printf("%02d:%02d\n",h+8,mi);
}
}
return 0;
}
相关文章推荐
- 1099. Build A Binary Search Tree (30) PAT甲级刷题
- 1127. ZigZagging on a Tree (30) PAT甲级刷题
- ksbsrv: No startup acknowledgement from forked process after 30 seconds
- 30:最小的K个数
- 6/27/2011 2:55:30 PM
- Malaysia Online Casino RM30 Free 50(30 free 50, deposit promotion, free bonus, malaysia online casin
- 30或60天后无法登录域
- PAT (Advanced Level) Practise 1131 Subway Map (30)
- 8/30/2011 4:09:14 PM
- 【30集iCore3_ADP出厂源代码(ARM部分)讲解视频】30-11层驱动之FSMC
- 《那些年啊,那些事——一个程序员的奋斗史》——30
- PAT - 甲级 - 1099. Build A Binary Search Tree (30)(二叉搜索树+层次遍历+中序遍历)
- The Database ID 30, Page (1:1141), slot 71 for LOB data type node does not exist.
- linux 内核编译时出现scripts/sign-file.c:25:30: fatal error: openssl/opensslv.h错误的解决办法
- 30 个很棒的 PHP 开源 CMS 内容管理系统
- 1018. Public Bike Management (30)
- 应该记住的 30 个 CSS 选择器
- 【面试题】剑指Offer-30-最小的第K个数
- 乱码:sem_num.c:30: error: stray ‘\264’ in program
- 启动3个线程,线程1打印1到5,线程2打印5到10,线程3打印11到15,然后线程1打印16到20,以此类推。。。打印到30为止