PAT (Advanced Level) 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 5 1 2 6 4 3 534 2 3 4 5 6 7Sample Output
08:07 08:06 08:10 17:00 Sorry
用N个队列模拟操作，每个顾客结点记录其服务时间，及自身序号。窗口当前时间加上队首顾客服务时间最小的队列pop队首顾客，push下一个顾客，同时更新当前窗口时间，根据顾客序号将出队顾客时间写入结果数组相应位置。
注意不是离队时间在17:00后才输出sorry，而是在17:00后接受服务的才输出sorry，这是个陷阱。
/*2015.7.20cyq*/
#include
#include
#include
#include
#include
#include
using namespace std;
//ifstream fin("case1.txt");
//#define cin fin
string intToString(int n,int t){
if(n-t>=540)//结束服务的时间减服务时间，即开始服务的时间
return "Sorry";
stringstream ss;
string s;
int h=n/60+8;
int m=n%60;
if(h<10)
ss<<"0";//补零
ss<>s;
return s;
}
const int MAX=2147483647;
int main(){
int N,M,K,Q;
cin>>N>>M>>K>>Q;
vector > > q(N);//N个窗口，记录顾客时间和序号
vector custime;
int x;
for(int i=0;i>x;
custime.push_back(x);
}
int cusNum;
for(cusNum=0;cusNum qtime(N,0);//每个窗口的当前时间，初始化为0
vector result(K);//K个顾客结束服务的时间
int count=0;
int quickWindow;
int quickTime;
while(count>x;
cout<