PAT Advanced 1014 Waiting in Line
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:
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,?customer?1???is served at?window?1???while?customer?2???is served at?window?2??.?Customer?3???will wait in front of?window?1???and?customer?4???will wait in front of?window?2??.?Customer?5???will wait behind the yellow line. At 08:01,?customer?1???is done and?customer?5???enters the line in front of?window?1???since that line seems shorter now.?Customer?2???will leave at 08:02,?customer?4???at 08:06,?customer?3???at 08:07,and finally?customer?5???at 08:10. Input Specification:Each input file contains one test case. Each case starts with a line containing 4 positive integers:?N?(≤,number of windows),?M?(≤,the maximum capacity of each line inside the yellow line),?K?(≤,number of customers),and?Q?(≤,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 Specification:For each of the?Q?customers,print in one line the time at which his/her transaction is finished,in the format? Sample Input:2 2 7 5 1 2 6 4 3 534 2 3 4 5 6 7 Sample Output:
#include <bits/stdc++.h> using namespace std; struct cmp { bool operator () (pair<int,int> a,pair<int,int> b) { if(a.second==b.second) { return a.first>b.first; }else { return a.second>b.second; } } }; int main() { int N,M,K,Q,t; cin>>N>>M>>K>>Q; vector<int> p_times(K+1),f_times(K+1); vector<queue<pair<int,int> > > winds(N,queue<pair<int,int> >()); queue<int> outside; priority_queue<pair<int,int>,vector<pair<int,int> >,cmp> mtime; for(int i=1;i<=N;i++) mtime.push(make_pair(i-1,0)); for(int i=1;i<=K;i++) { //cout<<mtime.top().first<<‘ ‘<<mtime.top().second<<endl; cin>>t; p_times[i]=t; bool hasIn=false; int mincnt=M,minptr=-1; for(int j=0;j<N;j++) { if(winds[j].size()<M) { if(mincnt>winds[j].size()) { mincnt=winds[j].size(); minptr=j; } } } if(minptr!=-1) { winds[minptr].push(make_pair(i,0)); hasIn=true; } if(!hasIn) { priority_queue<pair<int,cmp> tmp; for(int j=0;j<N;j++) { if(!winds[j].empty()) tmp.push(make_pair(j,p_times[winds[j].front().first]+winds[j].front().second)); } pair<int,int> ans=tmp.top(); //cout<<ans.first<<‘ ‘<<winds[ans.first].front().first<<‘ ‘<<ans.second<<endl; f_times[winds[ans.first].front().first]=ans.second; winds[ans.first].pop(); winds[ans.first].push(make_pair(i,ans.second)); winds[ans.first].front().second=ans.second; } } int cnt=0; for(int i=0;i<N;i++) { cnt+=winds[i].size(); } //cout<<cnt<<endl; for(int i=0;i<cnt;i++) { priority_queue<pair<int,int> ans=tmp.top(); //cout<<ans.first<<‘ ‘<<winds[ans.first].front().first<<‘ ‘<<ans.second<<endl; f_times[winds[ans.first].front().first]=ans.second; winds[ans.first].pop(); winds[ans.first].front().second=ans.second; } for(int i=1;i<=Q;i++) { cin>>t; int HH=f_times[t]/60+8; int MM=f_times[t]%60; int pre=f_times[t]-p_times[t]; int PHH=pre/60+8; int PMM=pre%60; if(PHH>=17) { cout<<"Sorry"<<endl; }else { printf("%02d:%02d\n",HH,MM); } } return 0; } (编辑:ASP站长网) |