PAT 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:

• 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 (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, 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 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


思路： 用n个队列来模拟， 排队的过程， 当有队列没有排满的时候， 就排到最短队列后面； 当所有的队列都排满的时候， 排到最先结束的队列之后；
　　　

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
struct Node{
  int id, time;
};
int main(){
  int n, m, k, q, i, j;
  scanf("%d %d %d %d", &n, &m, &k, &q);
  vector<int> finishTime(k+1), trans(k+1);
  for(i=1; i<=k; i++) scanf("%d", &trans[i]);
  vector<queue<Node> > window(n);
  for(i=1; i<=k; i++){
    int minLenth=0, fisrtFinish=0;
     Node node; node.id=i;
    for(j=0; j<n; j++){
      if(window[j].size()==0){
        minLenth = j;
        break;
      }else{//找到最先结束和最短的队列
        if(window[j].size()<window[minLenth].size()) minLenth = j;
        if(window[j].front().time<window[fisrtFinish].front().time) fisrtFinish = j;
      }
    }
    if(window[minLenth].size()<m){//当队列没有排满的时候， 排到最短的队列后面
      if(window[minLenth].size()!=0) node.time = window[minLenth].back().time+trans[i];
      else node.time = 480+trans[i];
      window[minLenth].push(node);
      finishTime[i] = node.time;
    }else{//当队列满了之后，排到最先结束的队列
      node.time = window[fisrtFinish].back().time+trans[i];
      window[fisrtFinish].pop();
      window[fisrtFinish].push(node);
      finishTime[i] = node.time;
    }
  }
 
  for(i=0; i<q; i++){
    int qry;
    scanf("%d", &qry);
    if(finishTime[qry]-trans[qry] >= 17*60) printf("Sorry\n");
    else printf("%02d:%02d\n", finishTime[qry]/60, finishTime[qry]%60);
  }
  return 0;
}