http://pat.zju.edu.cn/contests/pat-practise/1014
来源:互联网 发布:js中绑定含参数函数 编辑:程序博客网 时间:2024/04/30 09:33
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<iostream>
- #include<cstdio>
- #include<memory.h>
- #include<algorithm>
- #include<cstring>
- #include<queue>
- #include<cmath>
- #include<vector>
- #include<cstdlib>
- #include<iomanip>
- #include<string>
- using namespace std;
- #define MAX 0x6fffffff
- struct Node{
- int need;
- int remain;
- int th;
- int donetime;
- };
- vector<Node> a[21];
- Node nodes[1001];
- int main(){
- //freopen("in.txt", "r", stdin);
- int n,m,k,q;
- cin>>n>>m>>k>>q;
- for(int i=1;i<=k;++i){
- scanf("%d", &nodes[i].need);
- nodes[i].th = i;
- nodes[i].remain = nodes[i].need;
- }
- int num = 1;
- for(int i=1;i<=m;++i)
- for(int j=1;j<=n;++j){
- a[j].push_back(nodes[num++]);
- }
- for(int t=0;1;){
- int go = MAX;
- bool flag = true;
- for(int j=1;j<=n;++j){
- if(a[j].size()>0 && go>a[j][0].remain){
- go = a[j][0].remain;
- flag = false;
- }
- }
- if(flag)
- break;
- t += go;
- for(int j=1;j<=n;++j){
- if(a[j].size()>0){
- a[j][0].remain -= go;
- if(a[j][0].remain==0){
- nodes[a[j][0].th].donetime = t;//一开始直接修改队列里的,没修改到nodes数组里的
- a[j].erase(a[j].begin());
- if(num<=k){
- a[j].push_back(nodes[num++]);
- }
- while(a[j].size()>0 && t>=540)//删除开始时间不在17.00之前的
- a[j].erase(a[j].begin());
- }
- }
- }
- }
- int query;
- for(int i=0;i<q;++i){
- scanf("%d", &query);
- if(nodes[query].donetime!=0){
- cout<<setfill('0')<<setw(2)<<8+nodes[query].donetime/60<<":"<<setw(2)<<setfill('0')<<nodes[query].donetime%60<<endl;
- }else
- cout<<"Sorry"<<endl;
- }
- //fclose(stdin);
- return 0;
- }
- http://pat.zju.edu.cn/contests/pat-practise/1014
- http://pat.zju.edu.cn/contests/pat-practise/1030
- http://pat.zju.edu.cn/contests/pat-practise/1034
- http://pat.zju.edu.cn/contests/pat-practise/1016
- http://pat.zju.edu.cn/contests/pat-practise/1032
- http://pat.zju.edu.cn/contests/pat-practise/1037
- http://pat.zju.edu.cn/contests/pat-practise/1021
- http://pat.zju.edu.cn/contests/pat-practise/1040
- http://pat.zju.edu.cn/contests/pat-practise/1038
- http://pat.zju.edu.cn/contests/pat-practise/1025
- http://pat.zju.edu.cn/contests/pat-practise/1023
- http://pat.zju.edu.cn/contests/pat-practise/1029
- http://pat.zju.edu.cn/contests/pat-practise/1035
- http://pat.zju.edu.cn/contests/pat-practise/1024
- http://pat.zju.edu.cn/contests/pat-practise/1031
- http://pat.zju.edu.cn/contests/pat-practise/1028
- http://pat.zju.edu.cn/contests/pat-practise/1020
- http://pat.zju.edu.cn/contests/pat-practise/1015
- 嵌入式C代码优化方案
- opencv 压缩程序格式解析
- awk学习
- http://pat.zju.edu.cn/contests/pat-practise/1015
- 药监局拟禁止非处方药发布广告遭药企反对-药监局-禁止-非处方药
- http://pat.zju.edu.cn/contests/pat-practise/1014
- android Notification的使用
- 两数的最大值
- 关于java数据结构 在什么情况下使用什么样的数据结构的总结
- 越吃越胖的食物
- http://pat.zju.edu.cn/contests/pat-practise/1013
- 人民日报反驳我国地图曾承认钓鱼岛属日本说法-野田-钓鱼岛-国有化
- 调用网上在线聊天
- http://pat.zju.edu.cn/contests/pat-practise/1012