1014. Waiting in Line (30)-PAT

1014. Waiting in Line (30)

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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, customer₁ is served at window₁ while customer₂ is served at window₂. Customer₃ will wait in front of window₁ and customer₄ will wait in front of window₂. Customer₅ will wait behind the yellow line.

At 08:01, customer₁ is done and customer₅ enters the line in front of window₁ since that line seems shorter now. Customer₂ will leave at 08:02, customer₄ at 08:06, customer₃ at 08:07, and finally customer₅ 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 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

推荐指数：※※※

这个题目要注意17:00开始之前的任务银行都可以办理，不管办多上时间，是否会超过17:00这个时间。

还有看来memset会破坏vector的内部的结构，导致出现内存泄露的问题。以后用vector、string之类的stl容器时要注意了。这个在这个程序上真是血泪史！！！开始手贱对wins进行了memset，悲剧啊。

#include <iostream>
#include<string.h>
#include<stdio.h>
#include<queue>
using namespace std;
#define TIME 1440
#define N 1002
#define MAX_WIN 20
typedef struct wait_queue{
	int now;
	queue<int> win;
}wait_queue;
void inttotime(int leave_time,int cus_time){
	int hh,mm;
	if(leave_time-cus_time>=540){
		printf("Sorry\n");
	}else{
		hh=8+leave_time/60;
		mm=leave_time%60;
		printf("%02d:%02d\n",hh,mm);
	}
}
int main()
{
	int n,m,k,q,i,j;
	int process[N];
	int query[N];
	int leave[N];
	wait_queue wins[MAX_WIN];
	for(i=0;i<MAX_WIN;i++){
		wins[i].now=0;
	}
	cin>>n;
	cin>>m;
	cin>>k;
	cin>>q;
	for(i=1;i<=k;i++){
		cin>>process[i];
	}
	for(i=0;i<q;i++){
		cin>>query[i];
	}
	for(i=0;i<k;i++){
		leave[i]=-1;
	}
	int customer=1,tick=0, min_queue,min_queue_size,flag=0,free_q;
	while(flag==0||customer<k){
		for(j=0;j<n;j++){//对于每一个队列，判断当前是否有需要离开的顾客
			if(!wins[j].win.empty()){
				if(leave[wins[j].win.front()]==tick){
					wins[j].win.pop();
				}
			}
		}
		do{
			free_q=0;
			min_queue=0;
			min_queue_size=m;
			for(j=n-1;j>=0;j--){//寻找最短的队列
				if(wins[j].win.size()<m)
						free_q++;
				if(wins[j].win.size()<=min_queue_size){
					min_queue=j;
					min_queue_size=wins[j].win.size();
				}
			}
			if(free_q==0)
				break;
			if(min_queue_size<m){//一个客户要进入黄线内队列当中
				if(customer<=k){
					wins[min_queue].win.push(customer);
					leave[customer]=process[customer]+wins[min_queue].now;//加入队列后，该顾客离开时间
					wins[min_queue].now=leave[customer];
					free_q--;
					customer++;
				}
			}
		}while(free_q>0&&customer<=k);//有空队列，无需等待
		flag=1;
		for(j=0;j<n;j++){//对于每一个队列，判断当前是否有顾客
			if(!wins[j].win.empty())
				flag=0;
		}
		tick++;
	}
	for(i=0;i<q;i++){
		inttotime(leave[query[i]],process[query[i]]);
	}
	return 0;
}