pat A1026 Table Tennis （30 分）

个人认为是pat甲级里最难的一道了

//pat A1026 Table Tennis （30 分）
//两个注意点： 
//1、如果存在空闲的vip球桌，则vip客户总是有限选择编号最小的空闲的vip球桌，而不是选择编号最小的空闲的球桌 
//2、如果有多张空闲的球桌，则选择编号最小的球桌，而不是选择最早空出的球桌。 
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn=10010;

struct table{
	int endTime,vip;
}ta[110];

struct customer{
	int comingTime,getTable,servingTime,vip;//分别为到达时间，获得桌子的时间，服务时长，是否为vip 
}cus[maxn];

int convert(int hh,int mm,int ss){
	return hh*3600+mm*60+ss;
}

bool cmp(customer a,customer b){
	return a.comingTime<b.comingTime;
} 

int n,k,m;//n客户对数，k桌子数量，m vip桌子数量
int stTime,edTime,servingThreshold;//开门时间，关门时间 ,服务上限时间 
bool vis[maxn]={false};
int serveNum[110]={0};//serveNum[i]第i号桌服务的客户数量 
 
int main(){
	stTime=convert(8,0,0);
	edTime=convert(21,0,0);
	servingThreshold=2*3600;
	scanf("%d",&n);
	int hh,mm,ss,serveT,tag;
	for(int i=0;i<n;i++){
		scanf("%d:%d:%d%d%d",&hh,&mm,&ss,&serveT,&tag);
		cus[i].comingTime=convert(hh,mm,ss);
		cus[i].servingTime=min(serveT*60,servingThreshold);
		cus[i].vip=tag;
	} 
	int idx;
	scanf("%d%d",&k,&m);
	for(int i=1;i<=k;i++){//开桌时间初始化 
		ta[i].endTime=stTime;
		ta[i].vip=0;
	}
	for(int i=0;i<m;i++){
		scanf("%d",&idx);//vip桌号 
		ta[idx].vip=1;
	}
	sort(cus,cus+n,cmp);
	int num=0,now;//num已访问的客户数量 
	int count=0;//队首客户编号 
	while(num<n){
		while(vis[count]==true){
			count++;
		} 
		int u=-1,MIN=cus[count].comingTime;
		if(cus[count].vip==1){//若为vip客户 
			for(int i=1;i<=k;i++){//选出空闲vip桌子中编号最小的桌子 
				if(ta[i].endTime<=MIN&&ta[i].vip==1){
					u=i;
					break; 
				}	
			}
		}
		if(u==-1){
			for(int i=1;i<=k;i++){//无空闲vip桌子或者不是vip客户，则选出空闲桌子中编号最小的桌子 
				if(ta[i].endTime<=MIN){
					u=i;
					break; 
				}
			}
		}
	
		MIN=1<<30; 
		if(u==-1){//无空闲桌子,则选出最早空闲的桌子 
			for(int i=1;i<=k;i++){
				if(ta[i].endTime<MIN){
					MIN=ta[i].endTime;
					u=i;
				}
			}
		}
		if(ta[u].vip==1){//是vip桌子 
			idx=count;
			bool flag=false;//标记是否有vip客户满足要求 
			while(idx<n&&cus[idx].comingTime<=ta[u].endTime){
				if(cus[idx].vip==1&&vis[idx]==false){//vip客户且未访问 
					now=idx;
					flag=true; 
				//	printf("now=%d\n",now);
				//	printf("u=%d\n",u);
					break;
				}
				idx++;//客户编号 
			}
			if(flag==false){//没找到满足条件(在桌子空闲之前即到达)的vip客户，从队首开始寻找未访问过的客户 
				now=count;
				count++;
			} 
		}
		else{//不是vip桌,从队首开始寻找未访问过的客户 
			now=count;
			count++;
		}
		
		cus[now].getTable=max(ta[u].endTime,cus[now].comingTime);//客户获得桌子的时间为桌子空出的时间与客户到达时间的较大值 
		if(cus[now].getTable>=edTime){
			break;
		}
		ta[u].endTime=cus[now].getTable+cus[now].servingTime;
		serveNum[u]++;
		int arriveT=cus[now].comingTime,serveT=cus[now].getTable;
		printf("%02d:%02d:%02d %02d:%02d:%02d %d\n",arriveT/3600,arriveT%3600/60,arriveT%60,
		serveT/3600,serveT%3600/60,serveT%60,(int)round((serveT-arriveT)*1.0/60)); 
		//round((serveT-arriveT)/60)
		//printf("ta[%d].endTime=%d\n",u,ta[u].endTime);
		vis[now]=true;//标记已访问 
		num++; 
	} 
	for(int i=1;i<=k;i++){
		printf("%d",serveNum[i]);
		if(i!=k){
			printf(" ");
		}
	}
	return 0;
} 
/*
input:
2
08:00:00 10 1
08:05:00 10 1
3 2
2 3

input:
2 
08:00:00 130 0
09:00:00 10 0
1 0

input:
2
21:00:00 10 1
21:01:00 10 1
3 3
1 2 3

input:
2
20:00:00 60 0
20:30:00 10 1
1 1
1

input:
5
08:00:00 60 0
08:10:00 30 0
08:20:00 10 0
08:30:00 10 1
08:40:00 10 1
2 1
2
*/ 

1026 Table Tennis （30 分）

A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive, they will be assigned to the available table with the smallest number. If all the tables are occupied, they will have to wait in a queue. It is assumed that every pair of players can play for at most 2 hours.

Your job is to count for everyone in queue their waiting time, and for each table the number of players it has served for the day.

One thing that makes this procedure a bit complicated is that the club reserves some tables for their VIP members. When a VIP table is open, the first VIP pair in the queue will have the priviledge to take it. However, if there is no VIP in the queue, the next pair of players can take it. On the other hand, if when it is the turn of a VIP pair, yet no VIP table is available, they can be assigned as any ordinary players.

Input Specification:

Each input file contains one test case. For each case, the first line contains an integer N (≤10000) - the total number of pairs of players. Then N lines follow, each contains 2 times and a VIP tag: HH:MM:SS - the arriving time, P - the playing time in minutes of a pair of players, and tag - which is 1 if they hold a VIP card, or 0 if not. It is guaranteed that the arriving time is between 08:00:00 and 21:00:00 while the club is open. It is assumed that no two customers arrives at the same time. Following the players' info, there are 2 positive integers: K (≤100) - the number of tables, and M (< K) - the number of VIP tables. The last line contains M table numbers.

Output Specification:

For each test case, first print the arriving time, serving time and the waiting time for each pair of players in the format shown by the sample. Then print in a line the number of players served by each table. Notice that the output must be listed in chronological order of the serving time. The waiting time must be rounded up to an integer minute(s). If one cannot get a table before the closing time, their information must NOT be printed.

Sample Input:

9
20:52:00 10 0
08:00:00 20 0
08:02:00 30 0
20:51:00 10 0
08:10:00 5 0
08:12:00 10 1
20:50:00 10 0
08:01:30 15 1
20:53:00 10 1
3 1
2

Sample Output:

08:00:00 08:00:00 0
08:01:30 08:01:30 0
08:02:00 08:02:00 0
08:12:00 08:16:30 5
08:10:00 08:20:00 10
20:50:00 20:50:00 0
20:51:00 20:51:00 0
20:52:00 20:52:00 0
3 3 2